./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal20.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal20.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 4dc4211f2b8131a829ff8e1fa12908da9356d5cadf0e7b793aab2903e0fde547 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 03:40:03,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 03:40:03,587 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-24 03:40:03,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 03:40:03,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 03:40:03,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 03:40:03,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 03:40:03,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 03:40:03,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 03:40:03,631 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 03:40:03,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 03:40:03,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 03:40:03,632 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 03:40:03,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 03:40:03,632 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 03:40:03,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 03:40:03,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 03:40:03,633 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 03:40:03,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 03:40:03,635 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 03:40:03,635 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 03:40:03,635 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 03:40:03,636 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 03:40:03,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 03:40:03,636 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 03:40:03,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 03:40:03,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 03:40:03,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 03:40:03,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 03:40:03,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 03:40:03,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 03:40:03,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 03:40:03,638 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 03:40:03,639 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 03:40:03,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 03:40:03,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 03:40:03,639 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 03:40:03,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 03:40:03,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 03:40:03,640 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4dc4211f2b8131a829ff8e1fa12908da9356d5cadf0e7b793aab2903e0fde547 [2024-10-24 03:40:03,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 03:40:03,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 03:40:03,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 03:40:03,977 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 03:40:03,978 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 03:40:03,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal20.c [2024-10-24 03:40:05,408 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 03:40:05,712 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 03:40:05,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal20.c [2024-10-24 03:40:05,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcaca9f12/020f91f0801d44dab23d52f9d2c05b0f/FLAG845c4b436 [2024-10-24 03:40:05,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcaca9f12/020f91f0801d44dab23d52f9d2c05b0f [2024-10-24 03:40:05,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 03:40:05,758 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 03:40:05,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 03:40:05,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 03:40:05,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 03:40:05,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:40:05" (1/1) ... [2024-10-24 03:40:05,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5476730f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:40:05, skipping insertion in model container [2024-10-24 03:40:05,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:40:05" (1/1) ... [2024-10-24 03:40:05,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 03:40:06,069 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal20.c[1245,1258] [2024-10-24 03:40:06,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 03:40:06,537 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 03:40:06,548 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal20.c[1245,1258] [2024-10-24 03:40:06,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 03:40:06,683 INFO L204 MainTranslator]: Completed translation [2024-10-24 03:40:06,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:40:06 WrapperNode [2024-10-24 03:40:06,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 03:40:06,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 03:40:06,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 03:40:06,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 03:40:06,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:40:06" (1/1) ... [2024-10-24 03:40:06,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:40:06" (1/1) ... [2024-10-24 03:40:07,265 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3557 [2024-10-24 03:40:07,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 03:40:07,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 03:40:07,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 03:40:07,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 03:40:07,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:40:06" (1/1) ... [2024-10-24 03:40:07,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:40:06" (1/1) ... [2024-10-24 03:40:07,367 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:40:06" (1/1) ... [2024-10-24 03:40:07,582 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-24 03:40:07,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:40:06" (1/1) ... [2024-10-24 03:40:07,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:40:06" (1/1) ... [2024-10-24 03:40:07,697 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:40:06" (1/1) ... [2024-10-24 03:40:07,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:40:06" (1/1) ... [2024-10-24 03:40:07,764 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:40:06" (1/1) ... [2024-10-24 03:40:07,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:40:06" (1/1) ... [2024-10-24 03:40:07,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 03:40:07,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 03:40:07,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 03:40:07,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 03:40:07,900 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:40:06" (1/1) ... [2024-10-24 03:40:07,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 03:40:07,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:40:07,936 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 03:40:07,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 03:40:07,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 03:40:07,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 03:40:07,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 03:40:07,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 03:40:07,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 03:40:08,284 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 03:40:08,285 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 03:40:11,956 INFO L? ?]: Removed 1995 outVars from TransFormulas that were not future-live. [2024-10-24 03:40:11,956 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 03:40:12,059 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 03:40:12,061 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 03:40:12,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:40:12 BoogieIcfgContainer [2024-10-24 03:40:12,062 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 03:40:12,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 03:40:12,066 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 03:40:12,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 03:40:12,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:40:05" (1/3) ... [2024-10-24 03:40:12,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b145bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:40:12, skipping insertion in model container [2024-10-24 03:40:12,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:40:06" (2/3) ... [2024-10-24 03:40:12,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b145bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:40:12, skipping insertion in model container [2024-10-24 03:40:12,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:40:12" (3/3) ... [2024-10-24 03:40:12,073 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal20.c [2024-10-24 03:40:12,092 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 03:40:12,093 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 03:40:12,193 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 03:40:12,199 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;@19c36ef3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 03:40:12,200 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 03:40:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 1058 states, 1056 states have (on average 1.5018939393939394) internal successors, (1586), 1057 states have internal predecessors, (1586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:12,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-10-24 03:40:12,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:40:12,235 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:40:12,236 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:40:12,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:40:12,242 INFO L85 PathProgramCache]: Analyzing trace with hash 106512666, now seen corresponding path program 1 times [2024-10-24 03:40:12,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:40:12,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353068257] [2024-10-24 03:40:12,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:40:12,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:40:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:40:14,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:40:14,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:40:14,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353068257] [2024-10-24 03:40:14,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353068257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:40:14,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:40:14,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 03:40:14,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853370710] [2024-10-24 03:40:15,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:40:15,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 03:40:15,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:40:15,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 03:40:15,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 03:40:15,041 INFO L87 Difference]: Start difference. First operand has 1058 states, 1056 states have (on average 1.5018939393939394) internal successors, (1586), 1057 states have internal predecessors, (1586), 0 states have call successors, (0), 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 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:15,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:40:15,192 INFO L93 Difference]: Finished difference Result 2088 states and 3132 transitions. [2024-10-24 03:40:15,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 03:40:15,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 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 332 [2024-10-24 03:40:15,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:40:15,219 INFO L225 Difference]: With dead ends: 2088 [2024-10-24 03:40:15,220 INFO L226 Difference]: Without dead ends: 1059 [2024-10-24 03:40:15,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 03:40:15,229 INFO L432 NwaCegarLoop]: 1581 mSDtfsCounter, 0 mSDsluCounter, 3157 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4738 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 03:40:15,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4738 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 03:40:15,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2024-10-24 03:40:15,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1059. [2024-10-24 03:40:15,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 1058 states have (on average 1.4990548204158791) internal successors, (1586), 1058 states have internal predecessors, (1586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1586 transitions. [2024-10-24 03:40:15,347 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1586 transitions. Word has length 332 [2024-10-24 03:40:15,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:40:15,351 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1586 transitions. [2024-10-24 03:40:15,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:15,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1586 transitions. [2024-10-24 03:40:15,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-10-24 03:40:15,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:40:15,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:40:15,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 03:40:15,362 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:40:15,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:40:15,363 INFO L85 PathProgramCache]: Analyzing trace with hash -991377350, now seen corresponding path program 1 times [2024-10-24 03:40:15,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:40:15,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752013314] [2024-10-24 03:40:15,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:40:15,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:40:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:40:16,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:40:16,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:40:16,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752013314] [2024-10-24 03:40:16,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752013314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:40:16,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:40:16,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 03:40:16,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773511591] [2024-10-24 03:40:16,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:40:16,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 03:40:16,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:40:16,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 03:40:16,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 03:40:16,826 INFO L87 Difference]: Start difference. First operand 1059 states and 1586 transitions. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:16,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:40:16,886 INFO L93 Difference]: Finished difference Result 2091 states and 3132 transitions. [2024-10-24 03:40:16,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 03:40:16,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 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 333 [2024-10-24 03:40:16,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:40:16,893 INFO L225 Difference]: With dead ends: 2091 [2024-10-24 03:40:16,893 INFO L226 Difference]: Without dead ends: 1061 [2024-10-24 03:40:16,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 03:40:16,898 INFO L432 NwaCegarLoop]: 1581 mSDtfsCounter, 0 mSDsluCounter, 3154 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4735 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 03:40:16,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4735 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 03:40:16,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2024-10-24 03:40:16,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1061. [2024-10-24 03:40:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 1060 states have (on average 1.4981132075471697) internal successors, (1588), 1060 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:16,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1588 transitions. [2024-10-24 03:40:16,923 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1588 transitions. Word has length 333 [2024-10-24 03:40:16,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:40:16,925 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1588 transitions. [2024-10-24 03:40:16,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1588 transitions. [2024-10-24 03:40:16,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-10-24 03:40:16,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:40:16,932 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:40:16,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 03:40:16,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:40:16,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:40:16,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1765890573, now seen corresponding path program 1 times [2024-10-24 03:40:16,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:40:16,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340098259] [2024-10-24 03:40:16,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:40:16,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:40:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:40:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:40:21,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:40:21,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340098259] [2024-10-24 03:40:21,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340098259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:40:21,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:40:21,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 03:40:21,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884842593] [2024-10-24 03:40:21,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:40:21,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:40:21,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:40:21,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:40:21,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:40:21,731 INFO L87 Difference]: Start difference. First operand 1061 states and 1588 transitions. Second operand has 6 states, 6 states have (on average 55.666666666666664) internal successors, (334), 5 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:21,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:40:21,990 INFO L93 Difference]: Finished difference Result 2733 states and 4090 transitions. [2024-10-24 03:40:21,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 03:40:21,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 55.666666666666664) internal successors, (334), 5 states have internal predecessors, (334), 0 states have call successors, (0), 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 334 [2024-10-24 03:40:21,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:40:21,998 INFO L225 Difference]: With dead ends: 2733 [2024-10-24 03:40:21,998 INFO L226 Difference]: Without dead ends: 1701 [2024-10-24 03:40:22,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 03:40:22,001 INFO L432 NwaCegarLoop]: 1561 mSDtfsCounter, 4049 mSDsluCounter, 4687 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4049 SdHoareTripleChecker+Valid, 6248 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 03:40:22,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4049 Valid, 6248 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 03:40:22,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2024-10-24 03:40:22,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1682. [2024-10-24 03:40:22,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1681 states have (on average 1.4991076740035694) internal successors, (2520), 1681 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2520 transitions. [2024-10-24 03:40:22,044 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2520 transitions. Word has length 334 [2024-10-24 03:40:22,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:40:22,045 INFO L471 AbstractCegarLoop]: Abstraction has 1682 states and 2520 transitions. [2024-10-24 03:40:22,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.666666666666664) internal successors, (334), 5 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:22,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2520 transitions. [2024-10-24 03:40:22,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-10-24 03:40:22,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:40:22,052 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:40:22,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 03:40:22,053 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:40:22,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:40:22,054 INFO L85 PathProgramCache]: Analyzing trace with hash 2000856033, now seen corresponding path program 1 times [2024-10-24 03:40:22,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:40:22,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682872319] [2024-10-24 03:40:22,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:40:22,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:40:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:40:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:40:25,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:40:25,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682872319] [2024-10-24 03:40:25,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682872319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:40:25,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:40:25,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:40:25,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031604251] [2024-10-24 03:40:25,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:40:25,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 03:40:25,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:40:25,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 03:40:25,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:40:25,319 INFO L87 Difference]: Start difference. First operand 1682 states and 2520 transitions. Second operand has 8 states, 8 states have (on average 41.875) internal successors, (335), 7 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:25,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:40:25,658 INFO L93 Difference]: Finished difference Result 2735 states and 4092 transitions. [2024-10-24 03:40:25,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 03:40:25,658 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 41.875) internal successors, (335), 7 states have internal predecessors, (335), 0 states have call successors, (0), 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-10-24 03:40:25,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:40:25,665 INFO L225 Difference]: With dead ends: 2735 [2024-10-24 03:40:25,665 INFO L226 Difference]: Without dead ends: 1703 [2024-10-24 03:40:25,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-24 03:40:25,670 INFO L432 NwaCegarLoop]: 1560 mSDtfsCounter, 4052 mSDsluCounter, 7800 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4052 SdHoareTripleChecker+Valid, 9360 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 03:40:25,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4052 Valid, 9360 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 03:40:25,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2024-10-24 03:40:25,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1685. [2024-10-24 03:40:25,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1685 states, 1684 states have (on average 1.498812351543943) internal successors, (2524), 1684 states have internal predecessors, (2524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 2524 transitions. [2024-10-24 03:40:25,709 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 2524 transitions. Word has length 335 [2024-10-24 03:40:25,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:40:25,710 INFO L471 AbstractCegarLoop]: Abstraction has 1685 states and 2524 transitions. [2024-10-24 03:40:25,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 41.875) internal successors, (335), 7 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:25,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2524 transitions. [2024-10-24 03:40:25,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-10-24 03:40:25,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:40:25,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:40:25,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 03:40:25,716 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:40:25,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:40:25,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2078623984, now seen corresponding path program 1 times [2024-10-24 03:40:25,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:40:25,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593349912] [2024-10-24 03:40:25,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:40:25,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:40:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:40:29,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:40:29,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:40:29,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593349912] [2024-10-24 03:40:29,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593349912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:40:29,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:40:29,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 03:40:29,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43393521] [2024-10-24 03:40:29,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:40:29,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 03:40:29,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:40:29,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 03:40:29,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 03:40:29,585 INFO L87 Difference]: Start difference. First operand 1685 states and 2524 transitions. Second operand has 9 states, 9 states have (on average 37.333333333333336) internal successors, (336), 8 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:29,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:40:29,960 INFO L93 Difference]: Finished difference Result 2735 states and 4091 transitions. [2024-10-24 03:40:29,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 03:40:29,961 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 37.333333333333336) internal successors, (336), 8 states have internal predecessors, (336), 0 states have call successors, (0), 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 336 [2024-10-24 03:40:29,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:40:29,967 INFO L225 Difference]: With dead ends: 2735 [2024-10-24 03:40:29,967 INFO L226 Difference]: Without dead ends: 1703 [2024-10-24 03:40:29,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-24 03:40:29,971 INFO L432 NwaCegarLoop]: 1554 mSDtfsCounter, 4047 mSDsluCounter, 7776 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4047 SdHoareTripleChecker+Valid, 9330 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 03:40:29,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4047 Valid, 9330 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 03:40:29,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2024-10-24 03:40:30,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1689. [2024-10-24 03:40:30,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 1688 states have (on average 1.4982227488151658) internal successors, (2529), 1688 states have internal predecessors, (2529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2529 transitions. [2024-10-24 03:40:30,012 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2529 transitions. Word has length 336 [2024-10-24 03:40:30,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:40:30,013 INFO L471 AbstractCegarLoop]: Abstraction has 1689 states and 2529 transitions. [2024-10-24 03:40:30,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 37.333333333333336) internal successors, (336), 8 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:30,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2529 transitions. [2024-10-24 03:40:30,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-10-24 03:40:30,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:40:30,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:40:30,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 03:40:30,019 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:40:30,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:40:30,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1551713184, now seen corresponding path program 1 times [2024-10-24 03:40:30,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:40:30,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214646869] [2024-10-24 03:40:30,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:40:30,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:40:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:40:33,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:40:33,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:40:33,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214646869] [2024-10-24 03:40:33,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214646869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:40:33,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:40:33,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:40:33,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618622824] [2024-10-24 03:40:33,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:40:33,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 03:40:33,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:40:33,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 03:40:33,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:40:33,252 INFO L87 Difference]: Start difference. First operand 1689 states and 2529 transitions. Second operand has 8 states, 8 states have (on average 42.125) internal successors, (337), 7 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:33,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:40:33,890 INFO L93 Difference]: Finished difference Result 5297 states and 7935 transitions. [2024-10-24 03:40:33,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 03:40:33,891 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 42.125) internal successors, (337), 7 states have internal predecessors, (337), 0 states have call successors, (0), 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 337 [2024-10-24 03:40:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:40:33,902 INFO L225 Difference]: With dead ends: 5297 [2024-10-24 03:40:33,903 INFO L226 Difference]: Without dead ends: 2633 [2024-10-24 03:40:33,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-24 03:40:33,913 INFO L432 NwaCegarLoop]: 2170 mSDtfsCounter, 5380 mSDsluCounter, 10104 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5380 SdHoareTripleChecker+Valid, 12274 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 03:40:33,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5380 Valid, 12274 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 03:40:33,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2024-10-24 03:40:33,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2579. [2024-10-24 03:40:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2579 states, 2578 states have (on average 1.4992242048099302) internal successors, (3865), 2578 states have internal predecessors, (3865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 3865 transitions. [2024-10-24 03:40:33,973 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 3865 transitions. Word has length 337 [2024-10-24 03:40:33,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:40:33,975 INFO L471 AbstractCegarLoop]: Abstraction has 2579 states and 3865 transitions. [2024-10-24 03:40:33,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 42.125) internal successors, (337), 7 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:33,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 3865 transitions. [2024-10-24 03:40:33,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-10-24 03:40:33,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:40:33,984 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:40:33,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 03:40:33,984 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:40:33,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:40:33,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1425017382, now seen corresponding path program 1 times [2024-10-24 03:40:33,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:40:33,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136403779] [2024-10-24 03:40:33,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:40:33,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:40:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:40:37,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:40:37,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:40:37,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136403779] [2024-10-24 03:40:37,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136403779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:40:37,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:40:37,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 03:40:37,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574065452] [2024-10-24 03:40:37,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:40:37,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:40:37,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:40:37,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:40:37,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:40:37,768 INFO L87 Difference]: Start difference. First operand 2579 states and 3865 transitions. Second operand has 7 states, 7 states have (on average 48.285714285714285) internal successors, (338), 6 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:37,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:40:37,960 INFO L93 Difference]: Finished difference Result 6407 states and 9599 transitions. [2024-10-24 03:40:37,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 03:40:37,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 48.285714285714285) internal successors, (338), 6 states have internal predecessors, (338), 0 states have call successors, (0), 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 338 [2024-10-24 03:40:37,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:40:37,979 INFO L225 Difference]: With dead ends: 6407 [2024-10-24 03:40:37,979 INFO L226 Difference]: Without dead ends: 4857 [2024-10-24 03:40:37,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 03:40:37,987 INFO L432 NwaCegarLoop]: 1569 mSDtfsCounter, 3707 mSDsluCounter, 6262 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3707 SdHoareTripleChecker+Valid, 7831 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:40:37,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3707 Valid, 7831 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 03:40:37,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4857 states. [2024-10-24 03:40:38,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4857 to 4511. [2024-10-24 03:40:38,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4511 states, 4510 states have (on average 1.5) internal successors, (6765), 4510 states have internal predecessors, (6765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:38,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4511 states to 4511 states and 6765 transitions. [2024-10-24 03:40:38,079 INFO L78 Accepts]: Start accepts. Automaton has 4511 states and 6765 transitions. Word has length 338 [2024-10-24 03:40:38,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:40:38,080 INFO L471 AbstractCegarLoop]: Abstraction has 4511 states and 6765 transitions. [2024-10-24 03:40:38,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.285714285714285) internal successors, (338), 6 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:38,081 INFO L276 IsEmpty]: Start isEmpty. Operand 4511 states and 6765 transitions. [2024-10-24 03:40:38,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-10-24 03:40:38,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:40:38,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:40:38,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 03:40:38,088 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:40:38,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:40:38,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1263218847, now seen corresponding path program 1 times [2024-10-24 03:40:38,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:40:38,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744650316] [2024-10-24 03:40:38,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:40:38,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:40:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:40:41,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:40:41,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:40:41,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744650316] [2024-10-24 03:40:41,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744650316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:40:41,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:40:41,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 03:40:41,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784837876] [2024-10-24 03:40:41,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:40:41,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:40:41,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:40:41,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:40:41,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:40:41,151 INFO L87 Difference]: Start difference. First operand 4511 states and 6765 transitions. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 6 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:42,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:40:42,217 INFO L93 Difference]: Finished difference Result 7031 states and 10541 transitions. [2024-10-24 03:40:42,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:40:42,218 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 6 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 339 [2024-10-24 03:40:42,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:40:42,234 INFO L225 Difference]: With dead ends: 7031 [2024-10-24 03:40:42,234 INFO L226 Difference]: Without dead ends: 4519 [2024-10-24 03:40:42,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-24 03:40:42,240 INFO L432 NwaCegarLoop]: 1283 mSDtfsCounter, 2171 mSDsluCounter, 4207 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2171 SdHoareTripleChecker+Valid, 5490 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 03:40:42,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2171 Valid, 5490 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 03:40:42,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2024-10-24 03:40:42,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 4517. [2024-10-24 03:40:42,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4517 states, 4516 states have (on average 1.49933569530558) internal successors, (6771), 4516 states have internal predecessors, (6771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4517 states to 4517 states and 6771 transitions. [2024-10-24 03:40:42,389 INFO L78 Accepts]: Start accepts. Automaton has 4517 states and 6771 transitions. Word has length 339 [2024-10-24 03:40:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:40:42,390 INFO L471 AbstractCegarLoop]: Abstraction has 4517 states and 6771 transitions. [2024-10-24 03:40:42,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 6 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 4517 states and 6771 transitions. [2024-10-24 03:40:42,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-10-24 03:40:42,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:40:42,397 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:40:42,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 03:40:42,398 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:40:42,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:40:42,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1075419517, now seen corresponding path program 1 times [2024-10-24 03:40:42,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:40:42,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593543450] [2024-10-24 03:40:42,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:40:42,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:40:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:40:47,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:40:47,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:40:47,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593543450] [2024-10-24 03:40:47,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593543450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:40:47,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:40:47,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 03:40:47,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149069766] [2024-10-24 03:40:47,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:40:47,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 03:40:47,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:40:47,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 03:40:47,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:40:47,305 INFO L87 Difference]: Start difference. First operand 4517 states and 6771 transitions. Second operand has 11 states, 11 states have (on average 30.90909090909091) internal successors, (340), 10 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:49,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:40:49,408 INFO L93 Difference]: Finished difference Result 9365 states and 14013 transitions. [2024-10-24 03:40:49,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 03:40:49,411 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 30.90909090909091) internal successors, (340), 10 states have internal predecessors, (340), 0 states have call successors, (0), 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 340 [2024-10-24 03:40:49,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:40:49,443 INFO L225 Difference]: With dead ends: 9365 [2024-10-24 03:40:49,443 INFO L226 Difference]: Without dead ends: 6845 [2024-10-24 03:40:49,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2024-10-24 03:40:49,454 INFO L432 NwaCegarLoop]: 1273 mSDtfsCounter, 7024 mSDsluCounter, 10188 mSDsCounter, 0 mSdLazyCounter, 2841 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7024 SdHoareTripleChecker+Valid, 11461 SdHoareTripleChecker+Invalid, 2843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 03:40:49,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7024 Valid, 11461 Invalid, 2843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2841 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 03:40:49,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6845 states. [2024-10-24 03:40:49,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6845 to 6079. [2024-10-24 03:40:49,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6079 states, 6078 states have (on average 1.4986837775584074) internal successors, (9109), 6078 states have internal predecessors, (9109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6079 states to 6079 states and 9109 transitions. [2024-10-24 03:40:49,610 INFO L78 Accepts]: Start accepts. Automaton has 6079 states and 9109 transitions. Word has length 340 [2024-10-24 03:40:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:40:49,611 INFO L471 AbstractCegarLoop]: Abstraction has 6079 states and 9109 transitions. [2024-10-24 03:40:49,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 30.90909090909091) internal successors, (340), 10 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 6079 states and 9109 transitions. [2024-10-24 03:40:49,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-10-24 03:40:49,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:40:49,621 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:40:49,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 03:40:49,622 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:40:49,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:40:49,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1816364772, now seen corresponding path program 1 times [2024-10-24 03:40:49,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:40:49,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721526289] [2024-10-24 03:40:49,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:40:49,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:40:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:40:52,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:40:52,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:40:52,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721526289] [2024-10-24 03:40:52,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721526289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:40:52,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:40:52,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:40:52,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104326389] [2024-10-24 03:40:52,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:40:52,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:40:52,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:40:52,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:40:52,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:40:52,760 INFO L87 Difference]: Start difference. First operand 6079 states and 9109 transitions. Second operand has 7 states, 7 states have (on average 48.714285714285715) internal successors, (341), 7 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:52,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:40:52,912 INFO L93 Difference]: Finished difference Result 9347 states and 14003 transitions. [2024-10-24 03:40:52,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:40:52,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 48.714285714285715) internal successors, (341), 7 states have internal predecessors, (341), 0 states have call successors, (0), 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 341 [2024-10-24 03:40:52,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:40:52,922 INFO L225 Difference]: With dead ends: 9347 [2024-10-24 03:40:52,923 INFO L226 Difference]: Without dead ends: 6079 [2024-10-24 03:40:52,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-24 03:40:52,929 INFO L432 NwaCegarLoop]: 1563 mSDtfsCounter, 1325 mSDsluCounter, 4048 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 5611 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:40:52,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 5611 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 03:40:52,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6079 states. [2024-10-24 03:40:52,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6079 to 6079. [2024-10-24 03:40:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6079 states, 6078 states have (on average 1.4983547219480091) internal successors, (9107), 6078 states have internal predecessors, (9107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:53,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6079 states to 6079 states and 9107 transitions. [2024-10-24 03:40:53,009 INFO L78 Accepts]: Start accepts. Automaton has 6079 states and 9107 transitions. Word has length 341 [2024-10-24 03:40:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:40:53,009 INFO L471 AbstractCegarLoop]: Abstraction has 6079 states and 9107 transitions. [2024-10-24 03:40:53,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.714285714285715) internal successors, (341), 7 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:53,010 INFO L276 IsEmpty]: Start isEmpty. Operand 6079 states and 9107 transitions. [2024-10-24 03:40:53,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-10-24 03:40:53,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:40:53,016 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:40:53,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 03:40:53,017 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:40:53,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:40:53,018 INFO L85 PathProgramCache]: Analyzing trace with hash -694386225, now seen corresponding path program 1 times [2024-10-24 03:40:53,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:40:53,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708315515] [2024-10-24 03:40:53,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:40:53,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:40:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:40:55,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:40:55,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:40:55,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708315515] [2024-10-24 03:40:55,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708315515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:40:55,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:40:55,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 03:40:55,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749057402] [2024-10-24 03:40:55,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:40:55,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:40:55,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:40:55,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:40:55,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:40:55,848 INFO L87 Difference]: Start difference. First operand 6079 states and 9107 transitions. Second operand has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:56,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:40:56,312 INFO L93 Difference]: Finished difference Result 19993 states and 29924 transitions. [2024-10-24 03:40:56,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 03:40:56,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 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 342 [2024-10-24 03:40:56,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:40:56,340 INFO L225 Difference]: With dead ends: 19993 [2024-10-24 03:40:56,341 INFO L226 Difference]: Without dead ends: 16705 [2024-10-24 03:40:56,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:40:56,352 INFO L432 NwaCegarLoop]: 2419 mSDtfsCounter, 2008 mSDsluCounter, 7684 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2008 SdHoareTripleChecker+Valid, 10103 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 03:40:56,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2008 Valid, 10103 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 03:40:56,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16705 states. [2024-10-24 03:40:56,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16705 to 13359. [2024-10-24 03:40:56,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13359 states, 13358 states have (on average 1.4980536008384489) internal successors, (20011), 13358 states have internal predecessors, (20011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13359 states to 13359 states and 20011 transitions. [2024-10-24 03:40:56,543 INFO L78 Accepts]: Start accepts. Automaton has 13359 states and 20011 transitions. Word has length 342 [2024-10-24 03:40:56,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:40:56,544 INFO L471 AbstractCegarLoop]: Abstraction has 13359 states and 20011 transitions. [2024-10-24 03:40:56,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:40:56,545 INFO L276 IsEmpty]: Start isEmpty. Operand 13359 states and 20011 transitions. [2024-10-24 03:40:56,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-10-24 03:40:56,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:40:56,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:40:56,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 03:40:56,558 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:40:56,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:40:56,559 INFO L85 PathProgramCache]: Analyzing trace with hash 907860311, now seen corresponding path program 1 times [2024-10-24 03:40:56,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:40:56,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601138888] [2024-10-24 03:40:56,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:40:56,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:40:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:40:59,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:40:59,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:40:59,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601138888] [2024-10-24 03:40:59,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601138888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:40:59,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:40:59,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 03:40:59,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526925240] [2024-10-24 03:40:59,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:40:59,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 03:40:59,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:40:59,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 03:40:59,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 03:40:59,256 INFO L87 Difference]: Start difference. First operand 13359 states and 20011 transitions. Second operand has 9 states, 9 states have (on average 38.0) internal successors, (342), 8 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:41:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:41:00,004 INFO L93 Difference]: Finished difference Result 20317 states and 30425 transitions. [2024-10-24 03:41:00,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 03:41:00,005 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 38.0) internal successors, (342), 8 states have internal predecessors, (342), 0 states have call successors, (0), 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 342 [2024-10-24 03:41:00,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:41:00,030 INFO L225 Difference]: With dead ends: 20317 [2024-10-24 03:41:00,030 INFO L226 Difference]: Without dead ends: 13367 [2024-10-24 03:41:00,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-10-24 03:41:00,042 INFO L432 NwaCegarLoop]: 1416 mSDtfsCounter, 1683 mSDsluCounter, 6104 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1683 SdHoareTripleChecker+Valid, 7520 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 03:41:00,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1683 Valid, 7520 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 03:41:00,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13367 states. [2024-10-24 03:41:00,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13367 to 9599. [2024-10-24 03:41:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9599 states, 9598 states have (on average 1.4979162325484476) internal successors, (14377), 9598 states have internal predecessors, (14377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:41:00,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9599 states to 9599 states and 14377 transitions. [2024-10-24 03:41:00,178 INFO L78 Accepts]: Start accepts. Automaton has 9599 states and 14377 transitions. Word has length 342 [2024-10-24 03:41:00,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:41:00,179 INFO L471 AbstractCegarLoop]: Abstraction has 9599 states and 14377 transitions. [2024-10-24 03:41:00,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 38.0) internal successors, (342), 8 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:41:00,180 INFO L276 IsEmpty]: Start isEmpty. Operand 9599 states and 14377 transitions. [2024-10-24 03:41:00,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2024-10-24 03:41:00,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:41:00,189 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:41:00,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 03:41:00,189 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:41:00,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:41:00,191 INFO L85 PathProgramCache]: Analyzing trace with hash -2035820929, now seen corresponding path program 1 times [2024-10-24 03:41:00,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:41:00,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537280533] [2024-10-24 03:41:00,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:41:00,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:41:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:41:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:41:01,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:41:01,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537280533] [2024-10-24 03:41:01,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537280533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:41:01,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:41:01,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 03:41:01,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262068046] [2024-10-24 03:41:01,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:41:01,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 03:41:01,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:41:01,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 03:41:01,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 03:41:01,199 INFO L87 Difference]: Start difference. First operand 9599 states and 14377 transitions. Second operand has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:41:01,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:41:01,253 INFO L93 Difference]: Finished difference Result 14634 states and 21914 transitions. [2024-10-24 03:41:01,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 03:41:01,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 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 343 [2024-10-24 03:41:01,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:41:01,272 INFO L225 Difference]: With dead ends: 14634 [2024-10-24 03:41:01,272 INFO L226 Difference]: Without dead ends: 9605 [2024-10-24 03:41:01,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 03:41:01,282 INFO L432 NwaCegarLoop]: 1578 mSDtfsCounter, 0 mSDsluCounter, 3150 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4728 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 03:41:01,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4728 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 03:41:01,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9605 states. [2024-10-24 03:41:01,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9605 to 9605. [2024-10-24 03:41:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9605 states, 9604 states have (on average 1.4976051645147854) internal successors, (14383), 9604 states have internal predecessors, (14383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:41:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9605 states to 9605 states and 14383 transitions. [2024-10-24 03:41:01,399 INFO L78 Accepts]: Start accepts. Automaton has 9605 states and 14383 transitions. Word has length 343 [2024-10-24 03:41:01,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:41:01,400 INFO L471 AbstractCegarLoop]: Abstraction has 9605 states and 14383 transitions. [2024-10-24 03:41:01,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:41:01,401 INFO L276 IsEmpty]: Start isEmpty. Operand 9605 states and 14383 transitions. [2024-10-24 03:41:01,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-10-24 03:41:01,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:41:01,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:41:01,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 03:41:01,410 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:41:01,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:41:01,411 INFO L85 PathProgramCache]: Analyzing trace with hash 795367514, now seen corresponding path program 1 times [2024-10-24 03:41:01,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:41:01,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292668400] [2024-10-24 03:41:01,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:41:01,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:41:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:41:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:41:03,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:41:03,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292668400] [2024-10-24 03:41:03,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292668400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:41:03,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:41:03,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 03:41:03,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123806630] [2024-10-24 03:41:03,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:41:03,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 03:41:03,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:41:03,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 03:41:03,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 03:41:03,516 INFO L87 Difference]: Start difference. First operand 9605 states and 14383 transitions. Second operand has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:41:03,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:41:03,849 INFO L93 Difference]: Finished difference Result 19166 states and 28678 transitions. [2024-10-24 03:41:03,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:41:03,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 0 states have call successors, (0), 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 344 [2024-10-24 03:41:03,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:41:03,862 INFO L225 Difference]: With dead ends: 19166 [2024-10-24 03:41:03,862 INFO L226 Difference]: Without dead ends: 9605 [2024-10-24 03:41:03,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:41:03,876 INFO L432 NwaCegarLoop]: 2322 mSDtfsCounter, 1695 mSDsluCounter, 5006 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1695 SdHoareTripleChecker+Valid, 7328 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 03:41:03,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1695 Valid, 7328 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 03:41:03,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9605 states. [2024-10-24 03:41:03,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9605 to 4795. [2024-10-24 03:41:03,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4795 states, 4794 states have (on average 1.4933249895702962) internal successors, (7159), 4794 states have internal predecessors, (7159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:41:03,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4795 states to 4795 states and 7159 transitions. [2024-10-24 03:41:03,962 INFO L78 Accepts]: Start accepts. Automaton has 4795 states and 7159 transitions. Word has length 344 [2024-10-24 03:41:03,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:41:03,963 INFO L471 AbstractCegarLoop]: Abstraction has 4795 states and 7159 transitions. [2024-10-24 03:41:03,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:41:03,964 INFO L276 IsEmpty]: Start isEmpty. Operand 4795 states and 7159 transitions. [2024-10-24 03:41:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-10-24 03:41:03,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:41:03,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:41:03,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 03:41:03,969 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:41:03,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:41:03,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1246805142, now seen corresponding path program 1 times [2024-10-24 03:41:03,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:41:03,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732907199] [2024-10-24 03:41:03,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:41:03,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:41:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat