./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label31.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/eca-rers2012/Problem13_label31.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 781b4c30281e668acaf3c14c6cf74c491996fd51fc229d130e4fc767358d6ab3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:33:13,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:33:14,080 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:33:14,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:33:14,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:33:14,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:33:14,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:33:14,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:33:14,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:33:14,118 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:33:14,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:33:14,118 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:33:14,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:33:14,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:33:14,119 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:33:14,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:33:14,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:33:14,120 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:33:14,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:33:14,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:33:14,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:33:14,124 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:33:14,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:33:14,124 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:33:14,125 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:33:14,125 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:33:14,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:33:14,125 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:33:14,126 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:33:14,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:33:14,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:33:14,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:33:14,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:33:14,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:33:14,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:33:14,127 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:33:14,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:33:14,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:33:14,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:33:14,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:33:14,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:33:14,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:33:14,130 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 -> 781b4c30281e668acaf3c14c6cf74c491996fd51fc229d130e4fc767358d6ab3 [2024-11-09 19:33:14,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:33:14,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:33:14,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:33:14,424 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:33:14,424 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:33:14,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label31.c [2024-11-09 19:33:15,885 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:33:16,346 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:33:16,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label31.c [2024-11-09 19:33:16,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceebb3c1c/8fda4da66a1149bda35b02c973041a35/FLAGae5d8ac36 [2024-11-09 19:33:16,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceebb3c1c/8fda4da66a1149bda35b02c973041a35 [2024-11-09 19:33:16,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:33:16,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:33:16,409 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:33:16,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:33:16,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:33:16,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:33:16" (1/1) ... [2024-11-09 19:33:16,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cbffb94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:16, skipping insertion in model container [2024-11-09 19:33:16,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:33:16" (1/1) ... [2024-11-09 19:33:16,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:33:16,794 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label31.c[5792,5805] [2024-11-09 19:33:17,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:33:17,658 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:33:17,685 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label31.c[5792,5805] [2024-11-09 19:33:18,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:33:18,207 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:33:18,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:18 WrapperNode [2024-11-09 19:33:18,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:33:18,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:33:18,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:33:18,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:33:18,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:18" (1/1) ... [2024-11-09 19:33:18,287 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:18" (1/1) ... [2024-11-09 19:33:18,879 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5586 [2024-11-09 19:33:18,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:33:18,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:33:18,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:33:18,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:33:18,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:18" (1/1) ... [2024-11-09 19:33:18,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:18" (1/1) ... [2024-11-09 19:33:19,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:18" (1/1) ... [2024-11-09 19:33:19,485 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-09 19:33:19,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:18" (1/1) ... [2024-11-09 19:33:19,486 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:18" (1/1) ... [2024-11-09 19:33:19,718 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:18" (1/1) ... [2024-11-09 19:33:19,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:18" (1/1) ... [2024-11-09 19:33:19,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:18" (1/1) ... [2024-11-09 19:33:19,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:18" (1/1) ... [2024-11-09 19:33:19,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:33:19,861 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:33:19,862 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:33:19,862 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:33:19,863 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:18" (1/1) ... [2024-11-09 19:33:19,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:33:19,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:33:19,898 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-09 19:33:19,958 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-09 19:33:19,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:33:20,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:33:20,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:33:20,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:33:20,065 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:33:20,067 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:33:26,186 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2024-11-09 19:33:26,186 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2024-11-09 19:33:26,186 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2024-11-09 19:33:26,533 INFO L? ?]: Removed 2111 outVars from TransFormulas that were not future-live. [2024-11-09 19:33:26,533 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:33:26,577 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:33:26,577 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:33:26,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:33:26 BoogieIcfgContainer [2024-11-09 19:33:26,578 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:33:26,581 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:33:26,581 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:33:26,584 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:33:26,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:33:16" (1/3) ... [2024-11-09 19:33:26,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ab3928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:33:26, skipping insertion in model container [2024-11-09 19:33:26,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:18" (2/3) ... [2024-11-09 19:33:26,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ab3928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:33:26, skipping insertion in model container [2024-11-09 19:33:26,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:33:26" (3/3) ... [2024-11-09 19:33:26,586 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label31.c [2024-11-09 19:33:26,602 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:33:26,603 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:33:26,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:33:26,714 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;@2aceea6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:33:26,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:33:26,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 1101 states, 1099 states have (on average 2.4767970882620562) internal successors, (2722), 1100 states have internal predecessors, (2722), 0 states have call successors, (0), 0 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-09 19:33:26,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 19:33:26,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:33:26,734 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] [2024-11-09 19:33:26,735 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:33:26,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:33:26,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1839507387, now seen corresponding path program 1 times [2024-11-09 19:33:26,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:33:26,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158165852] [2024-11-09 19:33:26,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:33:26,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:33:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:33:27,190 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-09 19:33:27,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:33:27,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158165852] [2024-11-09 19:33:27,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158165852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:33:27,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:33:27,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:33:27,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348888526] [2024-11-09 19:33:27,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:33:27,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:33:27,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:33:27,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:33:27,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:33:27,227 INFO L87 Difference]: Start difference. First operand has 1101 states, 1099 states have (on average 2.4767970882620562) internal successors, (2722), 1100 states have internal predecessors, (2722), 0 states have call successors, (0), 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 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:33:32,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:33:32,281 INFO L93 Difference]: Finished difference Result 3088 states and 7843 transitions. [2024-11-09 19:33:32,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:33:32,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-09 19:33:32,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:33:32,314 INFO L225 Difference]: With dead ends: 3088 [2024-11-09 19:33:32,314 INFO L226 Difference]: Without dead ends: 1902 [2024-11-09 19:33:32,320 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-09 19:33:32,323 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 1715 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 4387 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 4986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 4387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:33:32,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 642 Invalid, 4986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 4387 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-09 19:33:32,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2024-11-09 19:33:32,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1897. [2024-11-09 19:33:32,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1896 states have (on average 2.4915611814345993) internal successors, (4724), 1896 states have internal predecessors, (4724), 0 states have call successors, (0), 0 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-09 19:33:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 4724 transitions. [2024-11-09 19:33:32,514 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 4724 transitions. Word has length 42 [2024-11-09 19:33:32,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:33:32,516 INFO L471 AbstractCegarLoop]: Abstraction has 1897 states and 4724 transitions. [2024-11-09 19:33:32,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:33:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 4724 transitions. [2024-11-09 19:33:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 19:33:32,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:33:32,520 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:33:32,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:33:32,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:33:32,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:33:32,523 INFO L85 PathProgramCache]: Analyzing trace with hash 151648029, now seen corresponding path program 1 times [2024-11-09 19:33:32,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:33:32,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883198313] [2024-11-09 19:33:32,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:33:32,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:33:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:33:33,010 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:33:33,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:33:33,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883198313] [2024-11-09 19:33:33,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883198313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:33:33,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:33:33,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:33:33,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617589112] [2024-11-09 19:33:33,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:33:33,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:33:33,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:33:33,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:33:33,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:33:33,017 INFO L87 Difference]: Start difference. First operand 1897 states and 4724 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:33:38,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:33:38,244 INFO L93 Difference]: Finished difference Result 5445 states and 13870 transitions. [2024-11-09 19:33:38,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:33:38,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-09 19:33:38,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:33:38,259 INFO L225 Difference]: With dead ends: 5445 [2024-11-09 19:33:38,259 INFO L226 Difference]: Without dead ends: 3550 [2024-11-09 19:33:38,261 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-09 19:33:38,262 INFO L432 NwaCegarLoop]: 747 mSDtfsCounter, 1531 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 4559 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 4920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 4559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:33:38,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1531 Valid, 885 Invalid, 4920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 4559 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-09 19:33:38,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3550 states. [2024-11-09 19:33:38,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3550 to 3489. [2024-11-09 19:33:38,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3489 states, 3488 states have (on average 2.406823394495413) internal successors, (8395), 3488 states have internal predecessors, (8395), 0 states have call successors, (0), 0 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-09 19:33:38,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 8395 transitions. [2024-11-09 19:33:38,327 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 8395 transitions. Word has length 108 [2024-11-09 19:33:38,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:33:38,328 INFO L471 AbstractCegarLoop]: Abstraction has 3489 states and 8395 transitions. [2024-11-09 19:33:38,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:33:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 8395 transitions. [2024-11-09 19:33:38,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 19:33:38,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:33:38,330 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:33:38,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:33:38,331 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:33:38,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:33:38,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1778676055, now seen corresponding path program 1 times [2024-11-09 19:33:38,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:33:38,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451411174] [2024-11-09 19:33:38,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:33:38,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:33:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:33:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:33:38,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:33:38,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451411174] [2024-11-09 19:33:38,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451411174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:33:38,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:33:38,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:33:38,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954829185] [2024-11-09 19:33:38,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:33:38,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:33:38,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:33:38,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:33:38,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:33:38,466 INFO L87 Difference]: Start difference. First operand 3489 states and 8395 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-09 19:33:42,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:33:42,828 INFO L93 Difference]: Finished difference Result 10164 states and 24767 transitions. [2024-11-09 19:33:42,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:33:42,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2024-11-09 19:33:42,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:33:42,856 INFO L225 Difference]: With dead ends: 10164 [2024-11-09 19:33:42,856 INFO L226 Difference]: Without dead ends: 6677 [2024-11-09 19:33:42,865 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-09 19:33:42,868 INFO L432 NwaCegarLoop]: 1054 mSDtfsCounter, 1516 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 3943 mSolverCounterSat, 780 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 4723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 780 IncrementalHoareTripleChecker+Valid, 3943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:33:42,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1207 Invalid, 4723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [780 Valid, 3943 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-09 19:33:42,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6677 states. [2024-11-09 19:33:43,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6677 to 6661. [2024-11-09 19:33:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 2.237087087087087) internal successors, (14899), 6660 states have internal predecessors, (14899), 0 states have call successors, (0), 0 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-09 19:33:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 14899 transitions. [2024-11-09 19:33:43,048 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 14899 transitions. Word has length 109 [2024-11-09 19:33:43,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:33:43,048 INFO L471 AbstractCegarLoop]: Abstraction has 6661 states and 14899 transitions. [2024-11-09 19:33:43,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-09 19:33:43,049 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 14899 transitions. [2024-11-09 19:33:43,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 19:33:43,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:33:43,052 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:33:43,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:33:43,053 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:33:43,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:33:43,054 INFO L85 PathProgramCache]: Analyzing trace with hash -563246883, now seen corresponding path program 1 times [2024-11-09 19:33:43,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:33:43,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050983121] [2024-11-09 19:33:43,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:33:43,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:33:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:33:43,431 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:33:43,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:33:43,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050983121] [2024-11-09 19:33:43,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050983121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:33:43,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:33:43,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:33:43,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952438743] [2024-11-09 19:33:43,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:33:43,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:33:43,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:33:43,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:33:43,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:33:43,437 INFO L87 Difference]: Start difference. First operand 6661 states and 14899 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 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-09 19:33:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:33:49,865 INFO L93 Difference]: Finished difference Result 14110 states and 32127 transitions. [2024-11-09 19:33:49,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:33:49,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2024-11-09 19:33:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:33:49,889 INFO L225 Difference]: With dead ends: 14110 [2024-11-09 19:33:49,889 INFO L226 Difference]: Without dead ends: 7451 [2024-11-09 19:33:49,897 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-09 19:33:49,898 INFO L432 NwaCegarLoop]: 735 mSDtfsCounter, 4729 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 6299 mSolverCounterSat, 841 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4729 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 7140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 841 IncrementalHoareTripleChecker+Valid, 6299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:33:49,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4729 Valid, 1032 Invalid, 7140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [841 Valid, 6299 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-09 19:33:49,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7451 states. [2024-11-09 19:33:50,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7451 to 7450. [2024-11-09 19:33:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7450 states, 7449 states have (on average 2.2098268223922672) internal successors, (16461), 7449 states have internal predecessors, (16461), 0 states have call successors, (0), 0 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-09 19:33:50,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7450 states to 7450 states and 16461 transitions. [2024-11-09 19:33:50,051 INFO L78 Accepts]: Start accepts. Automaton has 7450 states and 16461 transitions. Word has length 129 [2024-11-09 19:33:50,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:33:50,051 INFO L471 AbstractCegarLoop]: Abstraction has 7450 states and 16461 transitions. [2024-11-09 19:33:50,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 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-09 19:33:50,052 INFO L276 IsEmpty]: Start isEmpty. Operand 7450 states and 16461 transitions. [2024-11-09 19:33:50,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-09 19:33:50,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:33:50,056 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:33:50,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:33:50,056 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:33:50,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:33:50,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1576157510, now seen corresponding path program 1 times [2024-11-09 19:33:50,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:33:50,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043816] [2024-11-09 19:33:50,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:33:50,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:33:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:33:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:33:50,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:33:50,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043816] [2024-11-09 19:33:50,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:33:50,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:33:50,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:33:50,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405542226] [2024-11-09 19:33:50,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:33:50,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:33:50,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:33:50,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:33:50,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:33:50,359 INFO L87 Difference]: Start difference. First operand 7450 states and 16461 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 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-09 19:33:54,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:33:54,547 INFO L93 Difference]: Finished difference Result 17278 states and 39418 transitions. [2024-11-09 19:33:54,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:33:54,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2024-11-09 19:33:54,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:33:54,569 INFO L225 Difference]: With dead ends: 17278 [2024-11-09 19:33:54,569 INFO L226 Difference]: Without dead ends: 10618 [2024-11-09 19:33:54,576 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-09 19:33:54,579 INFO L432 NwaCegarLoop]: 798 mSDtfsCounter, 1617 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 3809 mSolverCounterSat, 929 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1617 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 4738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 929 IncrementalHoareTripleChecker+Valid, 3809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:33:54,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1617 Valid, 919 Invalid, 4738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [929 Valid, 3809 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 19:33:54,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10618 states. [2024-11-09 19:33:54,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10618 to 10610. [2024-11-09 19:33:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10610 states, 10609 states have (on average 2.2014327457818834) internal successors, (23355), 10609 states have internal predecessors, (23355), 0 states have call successors, (0), 0 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-09 19:33:54,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10610 states to 10610 states and 23355 transitions. [2024-11-09 19:33:54,770 INFO L78 Accepts]: Start accepts. Automaton has 10610 states and 23355 transitions. Word has length 207 [2024-11-09 19:33:54,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:33:54,771 INFO L471 AbstractCegarLoop]: Abstraction has 10610 states and 23355 transitions. [2024-11-09 19:33:54,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 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-09 19:33:54,771 INFO L276 IsEmpty]: Start isEmpty. Operand 10610 states and 23355 transitions. [2024-11-09 19:33:54,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-09 19:33:54,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:33:54,774 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:33:54,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:33:54,775 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:33:54,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:33:54,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1501917539, now seen corresponding path program 1 times [2024-11-09 19:33:54,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:33:54,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370629133] [2024-11-09 19:33:54,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:33:54,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:33:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:33:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 19:33:55,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:33:55,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370629133] [2024-11-09 19:33:55,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370629133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:33:55,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:33:55,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:33:55,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975325179] [2024-11-09 19:33:55,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:33:55,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:33:55,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:33:55,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:33:55,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:33:55,007 INFO L87 Difference]: Start difference. First operand 10610 states and 23355 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 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-09 19:33:59,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:33:59,418 INFO L93 Difference]: Finished difference Result 29882 states and 66561 transitions. [2024-11-09 19:33:59,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:33:59,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 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 226 [2024-11-09 19:33:59,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:33:59,473 INFO L225 Difference]: With dead ends: 29882 [2024-11-09 19:33:59,474 INFO L226 Difference]: Without dead ends: 20062 [2024-11-09 19:33:59,485 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-09 19:33:59,487 INFO L432 NwaCegarLoop]: 907 mSDtfsCounter, 1578 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 3775 mSolverCounterSat, 871 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 4646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 871 IncrementalHoareTripleChecker+Valid, 3775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:33:59,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 1056 Invalid, 4646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [871 Valid, 3775 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 19:33:59,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20062 states. [2024-11-09 19:33:59,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20062 to 20061. [2024-11-09 19:33:59,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20061 states, 20060 states have (on average 2.1322033898305084) internal successors, (42772), 20060 states have internal predecessors, (42772), 0 states have call successors, (0), 0 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-09 19:33:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20061 states to 20061 states and 42772 transitions. [2024-11-09 19:33:59,898 INFO L78 Accepts]: Start accepts. Automaton has 20061 states and 42772 transitions. Word has length 226 [2024-11-09 19:33:59,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:33:59,898 INFO L471 AbstractCegarLoop]: Abstraction has 20061 states and 42772 transitions. [2024-11-09 19:33:59,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 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-09 19:33:59,899 INFO L276 IsEmpty]: Start isEmpty. Operand 20061 states and 42772 transitions. [2024-11-09 19:33:59,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 19:33:59,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:33:59,904 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:33:59,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:33:59,905 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:33:59,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:33:59,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1752755300, now seen corresponding path program 1 times [2024-11-09 19:33:59,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:33:59,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67531028] [2024-11-09 19:33:59,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:33:59,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:33:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:00,064 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:34:00,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:00,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67531028] [2024-11-09 19:34:00,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67531028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:00,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:00,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:34:00,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007953187] [2024-11-09 19:34:00,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:00,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:34:00,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:00,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:34:00,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:00,067 INFO L87 Difference]: Start difference. First operand 20061 states and 42772 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 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-09 19:34:03,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:03,987 INFO L93 Difference]: Finished difference Result 39317 states and 84019 transitions. [2024-11-09 19:34:03,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:34:03,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 258 [2024-11-09 19:34:03,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:04,022 INFO L225 Difference]: With dead ends: 39317 [2024-11-09 19:34:04,022 INFO L226 Difference]: Without dead ends: 20046 [2024-11-09 19:34:04,042 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-09 19:34:04,045 INFO L432 NwaCegarLoop]: 2241 mSDtfsCounter, 1753 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 3787 mSolverCounterSat, 598 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1753 SdHoareTripleChecker+Valid, 2381 SdHoareTripleChecker+Invalid, 4385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 598 IncrementalHoareTripleChecker+Valid, 3787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:34:04,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1753 Valid, 2381 Invalid, 4385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [598 Valid, 3787 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 19:34:04,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20046 states. [2024-11-09 19:34:04,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20046 to 20044. [2024-11-09 19:34:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20044 states, 20043 states have (on average 2.056578356533453) internal successors, (41220), 20043 states have internal predecessors, (41220), 0 states have call successors, (0), 0 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-09 19:34:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20044 states to 20044 states and 41220 transitions. [2024-11-09 19:34:04,573 INFO L78 Accepts]: Start accepts. Automaton has 20044 states and 41220 transitions. Word has length 258 [2024-11-09 19:34:04,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:04,574 INFO L471 AbstractCegarLoop]: Abstraction has 20044 states and 41220 transitions. [2024-11-09 19:34:04,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 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-09 19:34:04,574 INFO L276 IsEmpty]: Start isEmpty. Operand 20044 states and 41220 transitions. [2024-11-09 19:34:04,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-11-09 19:34:04,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:04,581 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:34:04,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:34:04,581 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:04,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:04,583 INFO L85 PathProgramCache]: Analyzing trace with hash -129177424, now seen corresponding path program 1 times [2024-11-09 19:34:04,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:04,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750568274] [2024-11-09 19:34:04,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:04,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-09 19:34:04,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:04,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750568274] [2024-11-09 19:34:04,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750568274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:04,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:04,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:34:04,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915965618] [2024-11-09 19:34:04,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:04,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:34:04,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:04,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:34:04,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:04,780 INFO L87 Difference]: Start difference. First operand 20044 states and 41220 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 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-09 19:34:09,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:09,206 INFO L93 Difference]: Finished difference Result 54299 states and 112323 transitions. [2024-11-09 19:34:09,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:34:09,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 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 297 [2024-11-09 19:34:09,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:09,263 INFO L225 Difference]: With dead ends: 54299 [2024-11-09 19:34:09,264 INFO L226 Difference]: Without dead ends: 35045 [2024-11-09 19:34:09,282 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-09 19:34:09,283 INFO L432 NwaCegarLoop]: 760 mSDtfsCounter, 1625 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 3964 mSolverCounterSat, 757 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1625 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 4721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 757 IncrementalHoareTripleChecker+Valid, 3964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:34:09,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1625 Valid, 888 Invalid, 4721 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [757 Valid, 3964 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 19:34:09,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35045 states. [2024-11-09 19:34:09,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35045 to 33455. [2024-11-09 19:34:09,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33455 states, 33454 states have (on average 2.0273509894183057) internal successors, (67823), 33454 states have internal predecessors, (67823), 0 states have call successors, (0), 0 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-09 19:34:09,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33455 states to 33455 states and 67823 transitions. [2024-11-09 19:34:09,704 INFO L78 Accepts]: Start accepts. Automaton has 33455 states and 67823 transitions. Word has length 297 [2024-11-09 19:34:09,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:09,704 INFO L471 AbstractCegarLoop]: Abstraction has 33455 states and 67823 transitions. [2024-11-09 19:34:09,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 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-09 19:34:09,705 INFO L276 IsEmpty]: Start isEmpty. Operand 33455 states and 67823 transitions. [2024-11-09 19:34:09,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-09 19:34:09,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:09,711 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:34:09,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:34:09,711 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:09,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:09,712 INFO L85 PathProgramCache]: Analyzing trace with hash 756274729, now seen corresponding path program 1 times [2024-11-09 19:34:09,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:09,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657620915] [2024-11-09 19:34:09,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:09,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:10,049 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:34:10,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:10,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657620915] [2024-11-09 19:34:10,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657620915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:10,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:10,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:34:10,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806401992] [2024-11-09 19:34:10,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:10,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:34:10,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:10,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:34:10,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:10,053 INFO L87 Difference]: Start difference. First operand 33455 states and 67823 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 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-09 19:34:14,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:14,146 INFO L93 Difference]: Finished difference Result 66933 states and 135681 transitions. [2024-11-09 19:34:14,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:34:14,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 330 [2024-11-09 19:34:14,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:14,196 INFO L225 Difference]: With dead ends: 66933 [2024-11-09 19:34:14,196 INFO L226 Difference]: Without dead ends: 32688 [2024-11-09 19:34:14,215 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-09 19:34:14,217 INFO L432 NwaCegarLoop]: 2439 mSDtfsCounter, 1408 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 3945 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1408 SdHoareTripleChecker+Valid, 2581 SdHoareTripleChecker+Invalid, 4255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 3945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:34:14,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1408 Valid, 2581 Invalid, 4255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 3945 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-09 19:34:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32688 states. [2024-11-09 19:34:14,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32688 to 31875. [2024-11-09 19:34:14,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31875 states, 31874 states have (on average 2.0173809374411746) internal successors, (64302), 31874 states have internal predecessors, (64302), 0 states have call successors, (0), 0 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-09 19:34:14,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31875 states to 31875 states and 64302 transitions. [2024-11-09 19:34:14,617 INFO L78 Accepts]: Start accepts. Automaton has 31875 states and 64302 transitions. Word has length 330 [2024-11-09 19:34:14,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:14,617 INFO L471 AbstractCegarLoop]: Abstraction has 31875 states and 64302 transitions. [2024-11-09 19:34:14,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 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-09 19:34:14,618 INFO L276 IsEmpty]: Start isEmpty. Operand 31875 states and 64302 transitions. [2024-11-09 19:34:14,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-11-09 19:34:14,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:14,629 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:34:14,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:34:14,629 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:14,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:14,633 INFO L85 PathProgramCache]: Analyzing trace with hash 2098494574, now seen corresponding path program 1 times [2024-11-09 19:34:14,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:14,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087392104] [2024-11-09 19:34:14,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:14,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:14,830 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-11-09 19:34:14,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:14,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087392104] [2024-11-09 19:34:14,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087392104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:14,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:14,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:34:14,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952356082] [2024-11-09 19:34:14,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:14,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:34:14,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:14,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:34:14,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:14,833 INFO L87 Difference]: Start difference. First operand 31875 states and 64302 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 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-09 19:34:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:19,622 INFO L93 Difference]: Finished difference Result 74788 states and 152138 transitions. [2024-11-09 19:34:19,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:34:19,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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 335 [2024-11-09 19:34:19,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:19,677 INFO L225 Difference]: With dead ends: 74788 [2024-11-09 19:34:19,677 INFO L226 Difference]: Without dead ends: 43703 [2024-11-09 19:34:19,701 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-09 19:34:19,701 INFO L432 NwaCegarLoop]: 2489 mSDtfsCounter, 1544 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 3955 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 4674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 3955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:34:19,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1544 Valid, 2633 Invalid, 4674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 3955 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-09 19:34:19,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43703 states. [2024-11-09 19:34:20,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43703 to 42911. [2024-11-09 19:34:20,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42911 states, 42910 states have (on average 2.005546492659054) internal successors, (86058), 42910 states have internal predecessors, (86058), 0 states have call successors, (0), 0 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-09 19:34:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42911 states to 42911 states and 86058 transitions. [2024-11-09 19:34:20,360 INFO L78 Accepts]: Start accepts. Automaton has 42911 states and 86058 transitions. Word has length 335 [2024-11-09 19:34:20,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:20,361 INFO L471 AbstractCegarLoop]: Abstraction has 42911 states and 86058 transitions. [2024-11-09 19:34:20,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 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-09 19:34:20,361 INFO L276 IsEmpty]: Start isEmpty. Operand 42911 states and 86058 transitions. [2024-11-09 19:34:20,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-11-09 19:34:20,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:20,370 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:34:20,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:34:20,370 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:20,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:20,371 INFO L85 PathProgramCache]: Analyzing trace with hash 385507662, now seen corresponding path program 1 times [2024-11-09 19:34:20,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:20,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592245661] [2024-11-09 19:34:20,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:20,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:21,066 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-11-09 19:34:21,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:21,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592245661] [2024-11-09 19:34:21,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592245661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:21,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:21,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:34:21,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783111729] [2024-11-09 19:34:21,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:21,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:34:21,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:21,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:34:21,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:21,070 INFO L87 Difference]: Start difference. First operand 42911 states and 86058 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 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-09 19:34:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:24,909 INFO L93 Difference]: Finished difference Result 85030 states and 170604 transitions. [2024-11-09 19:34:24,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:34:24,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 371 [2024-11-09 19:34:24,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:24,959 INFO L225 Difference]: With dead ends: 85030 [2024-11-09 19:34:24,960 INFO L226 Difference]: Without dead ends: 42909 [2024-11-09 19:34:24,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:24,979 INFO L432 NwaCegarLoop]: 2058 mSDtfsCounter, 1878 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 3883 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1878 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 4327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 3883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:34:24,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1878 Valid, 2138 Invalid, 4327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 3883 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:34:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42909 states. [2024-11-09 19:34:25,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42909 to 42908. [2024-11-09 19:34:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42908 states, 42907 states have (on average 1.980679143263337) internal successors, (84985), 42907 states have internal predecessors, (84985), 0 states have call successors, (0), 0 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-09 19:34:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42908 states to 42908 states and 84985 transitions. [2024-11-09 19:34:25,686 INFO L78 Accepts]: Start accepts. Automaton has 42908 states and 84985 transitions. Word has length 371 [2024-11-09 19:34:25,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:25,687 INFO L471 AbstractCegarLoop]: Abstraction has 42908 states and 84985 transitions. [2024-11-09 19:34:25,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 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-09 19:34:25,687 INFO L276 IsEmpty]: Start isEmpty. Operand 42908 states and 84985 transitions. [2024-11-09 19:34:25,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2024-11-09 19:34:25,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:25,699 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:34:25,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:34:25,700 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:25,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:25,701 INFO L85 PathProgramCache]: Analyzing trace with hash -150341216, now seen corresponding path program 1 times [2024-11-09 19:34:25,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:25,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30771977] [2024-11-09 19:34:25,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:25,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:26,269 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 19:34:26,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:26,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30771977] [2024-11-09 19:34:26,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30771977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:26,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:26,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:34:26,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155791545] [2024-11-09 19:34:26,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:26,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:34:26,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:26,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:34:26,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:34:26,274 INFO L87 Difference]: Start difference. First operand 42908 states and 84985 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)