./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n2_w8_d16_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n2_w8_d16_e0.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 893891534ef912417047ee29382e9a38873f3028656bf3329b1f530cde6080e5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:15:48,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:15:48,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 01:15:48,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:15:48,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:15:48,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:15:48,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:15:48,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:15:48,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:15:48,514 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:15:48,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:15:48,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:15:48,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:15:48,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:15:48,518 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:15:48,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:15:48,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:15:48,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:15:48,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:15:48,520 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:15:48,520 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:15:48,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:15:48,522 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:15:48,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:15:48,523 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:15:48,523 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:15:48,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:15:48,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:15:48,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:15:48,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:15:48,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:15:48,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:15:48,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:15:48,526 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:15:48,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:15:48,526 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:15:48,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:15:48,527 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:15:48,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:15:48,527 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 -> 893891534ef912417047ee29382e9a38873f3028656bf3329b1f530cde6080e5 [2024-11-10 01:15:48,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:15:48,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:15:48,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:15:48,828 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:15:48,829 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:15:48,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n2_w8_d16_e0.c [2024-11-10 01:15:50,325 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:15:50,616 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:15:50,617 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n2_w8_d16_e0.c [2024-11-10 01:15:50,635 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c20a1c54/62a3f017fef94c2eb2ca72f52a44f6bb/FLAGbff09637b [2024-11-10 01:15:50,648 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c20a1c54/62a3f017fef94c2eb2ca72f52a44f6bb [2024-11-10 01:15:50,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:15:50,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:15:50,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:15:50,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:15:50,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:15:50,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:15:50" (1/1) ... [2024-11-10 01:15:50,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18203245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:15:50, skipping insertion in model container [2024-11-10 01:15:50,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:15:50" (1/1) ... [2024-11-10 01:15:50,731 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:15:50,927 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n2_w8_d16_e0.c[1270,1283] [2024-11-10 01:15:51,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:15:51,356 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:15:51,366 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n2_w8_d16_e0.c[1270,1283] [2024-11-10 01:15:51,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:15:51,537 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:15:51,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:15:51 WrapperNode [2024-11-10 01:15:51,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:15:51,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:15:51,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:15:51,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:15:51,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:15:51" (1/1) ... [2024-11-10 01:15:51,616 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:15:51" (1/1) ... [2024-11-10 01:15:52,023 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3622 [2024-11-10 01:15:52,024 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:15:52,025 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:15:52,025 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:15:52,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:15:52,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:15:51" (1/1) ... [2024-11-10 01:15:52,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:15:51" (1/1) ... [2024-11-10 01:15:52,127 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:15:51" (1/1) ... [2024-11-10 01:15:52,341 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 01:15:52,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:15:51" (1/1) ... [2024-11-10 01:15:52,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:15:51" (1/1) ... [2024-11-10 01:15:52,450 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:15:51" (1/1) ... [2024-11-10 01:15:52,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:15:51" (1/1) ... [2024-11-10 01:15:52,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:15:51" (1/1) ... [2024-11-10 01:15:52,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:15:51" (1/1) ... [2024-11-10 01:15:52,621 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:15:52,623 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:15:52,624 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:15:52,624 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:15:52,625 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:15:51" (1/1) ... [2024-11-10 01:15:52,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:15:52,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:15:52,665 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 01:15:52,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 01:15:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:15:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 01:15:52,715 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 01:15:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:15:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:15:52,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:15:53,028 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:15:53,030 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:15:56,902 INFO L? ?]: Removed 2044 outVars from TransFormulas that were not future-live. [2024-11-10 01:15:56,905 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:15:57,073 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:15:57,074 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:15:57,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:15:57 BoogieIcfgContainer [2024-11-10 01:15:57,076 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:15:57,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:15:57,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:15:57,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:15:57,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:15:50" (1/3) ... [2024-11-10 01:15:57,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ba10bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:15:57, skipping insertion in model container [2024-11-10 01:15:57,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:15:51" (2/3) ... [2024-11-10 01:15:57,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ba10bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:15:57, skipping insertion in model container [2024-11-10 01:15:57,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:15:57" (3/3) ... [2024-11-10 01:15:57,086 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.arbitrated_top_n2_w8_d16_e0.c [2024-11-10 01:15:57,107 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:15:57,108 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 01:15:57,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:15:57,226 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;@39eb4329, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:15:57,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 01:15:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand has 1035 states, 1025 states have (on average 1.4936585365853658) internal successors, (1531), 1026 states have internal predecessors, (1531), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 01:15:57,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-10 01:15:57,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:15:57,268 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:15:57,268 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:15:57,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:15:57,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1464547204, now seen corresponding path program 1 times [2024-11-10 01:15:57,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:15:57,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306336499] [2024-11-10 01:15:57,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:15:57,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:15:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:15:58,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:15:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:15:58,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:15:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:15:58,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 01:15:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:15:58,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 01:15:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:15:58,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 01:15:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:15:58,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 01:15:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:15:58,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 01:15:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:15:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:15:58,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:15:58,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306336499] [2024-11-10 01:15:58,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306336499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:15:58,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:15:58,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 01:15:58,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450828543] [2024-11-10 01:15:58,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:15:58,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 01:15:58,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:15:58,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 01:15:58,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:15:58,264 INFO L87 Difference]: Start difference. First operand has 1035 states, 1025 states have (on average 1.4936585365853658) internal successors, (1531), 1026 states have internal predecessors, (1531), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 140.0) internal successors, (280), 2 states have internal predecessors, (280), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 01:15:58,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:15:58,709 INFO L93 Difference]: Finished difference Result 1883 states and 2821 transitions. [2024-11-10 01:15:58,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 01:15:58,712 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 140.0) internal successors, (280), 2 states have internal predecessors, (280), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 312 [2024-11-10 01:15:58,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:15:58,735 INFO L225 Difference]: With dead ends: 1883 [2024-11-10 01:15:58,735 INFO L226 Difference]: Without dead ends: 1030 [2024-11-10 01:15:58,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:15:58,750 INFO L432 NwaCegarLoop]: 1287 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:15:58,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1287 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:15:58,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2024-11-10 01:15:58,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1030. [2024-11-10 01:15:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1021 states have (on average 1.4926542605288933) internal successors, (1524), 1021 states have internal predecessors, (1524), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 01:15:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1538 transitions. [2024-11-10 01:15:58,865 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1538 transitions. Word has length 312 [2024-11-10 01:15:58,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:15:58,866 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1538 transitions. [2024-11-10 01:15:58,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 140.0) internal successors, (280), 2 states have internal predecessors, (280), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 01:15:58,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1538 transitions. [2024-11-10 01:15:58,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-10 01:15:58,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:15:58,875 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:15:58,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:15:58,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:15:58,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:15:58,880 INFO L85 PathProgramCache]: Analyzing trace with hash 281713995, now seen corresponding path program 1 times [2024-11-10 01:15:58,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:15:58,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577847271] [2024-11-10 01:15:58,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:15:58,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:15:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:00,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:00,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:00,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 01:16:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:00,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 01:16:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:00,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 01:16:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:00,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 01:16:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:00,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 01:16:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:00,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:00,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577847271] [2024-11-10 01:16:00,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577847271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:00,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:00,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:16:00,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715177260] [2024-11-10 01:16:00,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:00,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:16:00,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:00,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:16:00,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:16:00,763 INFO L87 Difference]: Start difference. First operand 1030 states and 1538 transitions. Second operand has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:01,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:01,350 INFO L93 Difference]: Finished difference Result 1035 states and 1543 transitions. [2024-11-10 01:16:01,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:01,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 312 [2024-11-10 01:16:01,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:01,360 INFO L225 Difference]: With dead ends: 1035 [2024-11-10 01:16:01,360 INFO L226 Difference]: Without dead ends: 1032 [2024-11-10 01:16:01,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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-11-10 01:16:01,364 INFO L432 NwaCegarLoop]: 1285 mSDtfsCounter, 0 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3850 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:01,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3850 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:16:01,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2024-11-10 01:16:01,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1032. [2024-11-10 01:16:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 1023 states have (on average 1.4916911045943304) internal successors, (1526), 1023 states have internal predecessors, (1526), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 01:16:01,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1540 transitions. [2024-11-10 01:16:01,390 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1540 transitions. Word has length 312 [2024-11-10 01:16:01,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:01,392 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1540 transitions. [2024-11-10 01:16:01,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1540 transitions. [2024-11-10 01:16:01,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-10 01:16:01,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:01,403 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:01,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:16:01,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:01,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:01,404 INFO L85 PathProgramCache]: Analyzing trace with hash 288253463, now seen corresponding path program 1 times [2024-11-10 01:16:01,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:01,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728781066] [2024-11-10 01:16:01,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:01,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:02,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:02,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:02,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 01:16:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:02,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 01:16:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:02,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 01:16:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:02,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 01:16:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:02,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 01:16:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:02,354 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:02,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:02,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728781066] [2024-11-10 01:16:02,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728781066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:02,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:02,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:16:02,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612377699] [2024-11-10 01:16:02,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:02,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:16:02,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:02,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:16:02,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:02,358 INFO L87 Difference]: Start difference. First operand 1032 states and 1540 transitions. Second operand has 5 states, 5 states have (on average 56.2) internal successors, (281), 5 states have internal predecessors, (281), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:03,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:03,659 INFO L93 Difference]: Finished difference Result 2577 states and 3849 transitions. [2024-11-10 01:16:03,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:16:03,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.2) internal successors, (281), 5 states have internal predecessors, (281), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 313 [2024-11-10 01:16:03,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:03,667 INFO L225 Difference]: With dead ends: 2577 [2024-11-10 01:16:03,667 INFO L226 Difference]: Without dead ends: 1032 [2024-11-10 01:16:03,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 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-11-10 01:16:03,673 INFO L432 NwaCegarLoop]: 1347 mSDtfsCounter, 2993 mSDsluCounter, 2338 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2993 SdHoareTripleChecker+Valid, 3685 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:03,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2993 Valid, 3685 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 01:16:03,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2024-11-10 01:16:03,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1032. [2024-11-10 01:16:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 1023 states have (on average 1.490713587487781) internal successors, (1525), 1023 states have internal predecessors, (1525), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 01:16:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1539 transitions. [2024-11-10 01:16:03,704 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1539 transitions. Word has length 313 [2024-11-10 01:16:03,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:03,705 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1539 transitions. [2024-11-10 01:16:03,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.2) internal successors, (281), 5 states have internal predecessors, (281), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:03,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1539 transitions. [2024-11-10 01:16:03,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-11-10 01:16:03,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:03,711 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:03,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:16:03,711 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:03,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:03,712 INFO L85 PathProgramCache]: Analyzing trace with hash 307782432, now seen corresponding path program 1 times [2024-11-10 01:16:03,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:03,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826782343] [2024-11-10 01:16:03,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:03,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:04,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:04,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:04,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 01:16:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:04,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 01:16:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:04,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 01:16:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:04,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 01:16:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:04,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 01:16:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:04,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:04,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826782343] [2024-11-10 01:16:04,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826782343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:04,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:04,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:16:04,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496565374] [2024-11-10 01:16:04,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:04,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:16:04,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:04,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:16:04,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:04,745 INFO L87 Difference]: Start difference. First operand 1032 states and 1539 transitions. Second operand has 5 states, 5 states have (on average 56.4) internal successors, (282), 5 states have internal predecessors, (282), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:05,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:05,765 INFO L93 Difference]: Finished difference Result 1882 states and 2806 transitions. [2024-11-10 01:16:05,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:05,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.4) internal successors, (282), 5 states have internal predecessors, (282), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 314 [2024-11-10 01:16:05,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:05,772 INFO L225 Difference]: With dead ends: 1882 [2024-11-10 01:16:05,772 INFO L226 Difference]: Without dead ends: 1032 [2024-11-10 01:16:05,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:16:05,776 INFO L432 NwaCegarLoop]: 969 mSDtfsCounter, 1473 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1951 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:05,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1951 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 01:16:05,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2024-11-10 01:16:05,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1032. [2024-11-10 01:16:05,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 1023 states have (on average 1.4897360703812317) internal successors, (1524), 1023 states have internal predecessors, (1524), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 01:16:05,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1538 transitions. [2024-11-10 01:16:05,810 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1538 transitions. Word has length 314 [2024-11-10 01:16:05,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:05,811 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1538 transitions. [2024-11-10 01:16:05,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.4) internal successors, (282), 5 states have internal predecessors, (282), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:05,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1538 transitions. [2024-11-10 01:16:05,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2024-11-10 01:16:05,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:05,818 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:05,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:16:05,819 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:05,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:05,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1286901532, now seen corresponding path program 1 times [2024-11-10 01:16:05,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:05,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959078650] [2024-11-10 01:16:05,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:05,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:06,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:06,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:06,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 01:16:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:06,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 01:16:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:06,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 01:16:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:06,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 01:16:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:06,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 01:16:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:06,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:06,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959078650] [2024-11-10 01:16:06,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959078650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:06,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:06,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:16:06,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323753704] [2024-11-10 01:16:06,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:06,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:16:06,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:06,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:16:06,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:16:06,698 INFO L87 Difference]: Start difference. First operand 1032 states and 1538 transitions. Second operand has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:07,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:07,232 INFO L93 Difference]: Finished difference Result 1884 states and 2807 transitions. [2024-11-10 01:16:07,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:07,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 315 [2024-11-10 01:16:07,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:07,238 INFO L225 Difference]: With dead ends: 1884 [2024-11-10 01:16:07,238 INFO L226 Difference]: Without dead ends: 1034 [2024-11-10 01:16:07,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 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-11-10 01:16:07,242 INFO L432 NwaCegarLoop]: 1283 mSDtfsCounter, 0 mSDsluCounter, 2558 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3841 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:07,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3841 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:16:07,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-10 01:16:07,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-11-10 01:16:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1025 states have (on average 1.488780487804878) internal successors, (1526), 1025 states have internal predecessors, (1526), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 01:16:07,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1540 transitions. [2024-11-10 01:16:07,267 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1540 transitions. Word has length 315 [2024-11-10 01:16:07,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:07,268 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1540 transitions. [2024-11-10 01:16:07,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:07,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1540 transitions. [2024-11-10 01:16:07,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-11-10 01:16:07,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:07,272 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:07,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 01:16:07,272 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:07,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:07,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1491997437, now seen corresponding path program 1 times [2024-11-10 01:16:07,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:07,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471766116] [2024-11-10 01:16:07,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:07,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:08,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:08,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:08,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 01:16:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:08,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 01:16:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:08,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 01:16:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:08,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 01:16:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:08,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 01:16:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:08,274 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:08,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:08,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471766116] [2024-11-10 01:16:08,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471766116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:08,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:08,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:16:08,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508437243] [2024-11-10 01:16:08,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:08,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:16:08,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:08,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:16:08,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:16:08,277 INFO L87 Difference]: Start difference. First operand 1034 states and 1540 transitions. Second operand has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:08,797 INFO L93 Difference]: Finished difference Result 1886 states and 2808 transitions. [2024-11-10 01:16:08,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:08,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 316 [2024-11-10 01:16:08,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:08,802 INFO L225 Difference]: With dead ends: 1886 [2024-11-10 01:16:08,803 INFO L226 Difference]: Without dead ends: 1034 [2024-11-10 01:16:08,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:08,805 INFO L432 NwaCegarLoop]: 1241 mSDtfsCounter, 1296 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 2484 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:08,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 2484 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:16:08,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-10 01:16:08,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-11-10 01:16:08,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1025 states have (on average 1.486829268292683) internal successors, (1524), 1025 states have internal predecessors, (1524), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 01:16:08,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1538 transitions. [2024-11-10 01:16:08,830 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1538 transitions. Word has length 316 [2024-11-10 01:16:08,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:08,831 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1538 transitions. [2024-11-10 01:16:08,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:08,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1538 transitions. [2024-11-10 01:16:08,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2024-11-10 01:16:08,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:08,836 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:08,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 01:16:08,837 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:08,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:08,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2069942985, now seen corresponding path program 1 times [2024-11-10 01:16:08,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:08,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276349562] [2024-11-10 01:16:08,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:08,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:09,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:09,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:09,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 01:16:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:09,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 01:16:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:09,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 01:16:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:09,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 01:16:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:09,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 01:16:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:09,663 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:09,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:09,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276349562] [2024-11-10 01:16:09,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276349562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:09,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:09,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:16:09,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181494458] [2024-11-10 01:16:09,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:09,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:16:09,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:09,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:16:09,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:09,669 INFO L87 Difference]: Start difference. First operand 1034 states and 1538 transitions. Second operand has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:10,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:10,305 INFO L93 Difference]: Finished difference Result 1972 states and 2931 transitions. [2024-11-10 01:16:10,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:16:10,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 318 [2024-11-10 01:16:10,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:10,310 INFO L225 Difference]: With dead ends: 1972 [2024-11-10 01:16:10,311 INFO L226 Difference]: Without dead ends: 1034 [2024-11-10 01:16:10,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 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-11-10 01:16:10,315 INFO L432 NwaCegarLoop]: 1273 mSDtfsCounter, 1545 mSDsluCounter, 2522 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 3795 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:10,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1545 Valid, 3795 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:16:10,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-10 01:16:10,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-11-10 01:16:10,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1025 states have (on average 1.4858536585365854) internal successors, (1523), 1025 states have internal predecessors, (1523), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 01:16:10,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1537 transitions. [2024-11-10 01:16:10,342 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1537 transitions. Word has length 318 [2024-11-10 01:16:10,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:10,343 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1537 transitions. [2024-11-10 01:16:10,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:10,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1537 transitions. [2024-11-10 01:16:10,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2024-11-10 01:16:10,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:10,348 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:10,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 01:16:10,349 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:10,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:10,349 INFO L85 PathProgramCache]: Analyzing trace with hash -601375511, now seen corresponding path program 1 times [2024-11-10 01:16:10,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:10,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057572493] [2024-11-10 01:16:10,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:10,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:11,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:11,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:11,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 01:16:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:11,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 01:16:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:11,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 01:16:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:11,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 01:16:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:11,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 01:16:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:11,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:11,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057572493] [2024-11-10 01:16:11,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057572493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:11,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:11,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:16:11,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170857006] [2024-11-10 01:16:11,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:11,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:16:11,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:11,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:16:11,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:11,307 INFO L87 Difference]: Start difference. First operand 1034 states and 1537 transitions. Second operand has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:11,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:11,828 INFO L93 Difference]: Finished difference Result 1886 states and 2802 transitions. [2024-11-10 01:16:11,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:11,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 319 [2024-11-10 01:16:11,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:11,837 INFO L225 Difference]: With dead ends: 1886 [2024-11-10 01:16:11,837 INFO L226 Difference]: Without dead ends: 1034 [2024-11-10 01:16:11,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:16:11,843 INFO L432 NwaCegarLoop]: 1241 mSDtfsCounter, 1513 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 2495 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:11,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 2495 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:16:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-10 01:16:11,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-11-10 01:16:11,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1025 states have (on average 1.4848780487804878) internal successors, (1522), 1025 states have internal predecessors, (1522), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 01:16:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1536 transitions. [2024-11-10 01:16:11,872 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1536 transitions. Word has length 319 [2024-11-10 01:16:11,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:11,872 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1536 transitions. [2024-11-10 01:16:11,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:11,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1536 transitions. [2024-11-10 01:16:11,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-11-10 01:16:11,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:11,875 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:11,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 01:16:11,876 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:11,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:11,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2145451346, now seen corresponding path program 1 times [2024-11-10 01:16:11,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:11,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605104817] [2024-11-10 01:16:11,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:11,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:12,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:12,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:12,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 01:16:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:12,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 01:16:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:12,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 01:16:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:12,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 01:16:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:12,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 01:16:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:12,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:12,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605104817] [2024-11-10 01:16:12,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605104817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:12,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:12,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:16:12,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920259486] [2024-11-10 01:16:12,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:12,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:16:12,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:12,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:16:12,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:12,656 INFO L87 Difference]: Start difference. First operand 1034 states and 1536 transitions. Second operand has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:13,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:13,172 INFO L93 Difference]: Finished difference Result 1886 states and 2800 transitions. [2024-11-10 01:16:13,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:13,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 320 [2024-11-10 01:16:13,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:13,178 INFO L225 Difference]: With dead ends: 1886 [2024-11-10 01:16:13,178 INFO L226 Difference]: Without dead ends: 1034 [2024-11-10 01:16:13,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:16:13,181 INFO L432 NwaCegarLoop]: 1241 mSDtfsCounter, 2747 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2754 SdHoareTripleChecker+Valid, 2484 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:13,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2754 Valid, 2484 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:16:13,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-10 01:16:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-11-10 01:16:13,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1025 states have (on average 1.4839024390243902) internal successors, (1521), 1025 states have internal predecessors, (1521), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 01:16:13,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1535 transitions. [2024-11-10 01:16:13,204 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1535 transitions. Word has length 320 [2024-11-10 01:16:13,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:13,204 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1535 transitions. [2024-11-10 01:16:13,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:13,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1535 transitions. [2024-11-10 01:16:13,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2024-11-10 01:16:13,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:13,207 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:13,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 01:16:13,208 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:13,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:13,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1912049758, now seen corresponding path program 1 times [2024-11-10 01:16:13,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:13,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395897931] [2024-11-10 01:16:13,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:13,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:14,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:14,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:14,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 01:16:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:14,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 01:16:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:14,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 01:16:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:14,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 01:16:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:14,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 01:16:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:14,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:14,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395897931] [2024-11-10 01:16:14,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395897931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:14,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:14,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:16:14,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073663593] [2024-11-10 01:16:14,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:14,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:16:14,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:14,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:16:14,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:16:14,471 INFO L87 Difference]: Start difference. First operand 1034 states and 1535 transitions. Second operand has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:15,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:15,104 INFO L93 Difference]: Finished difference Result 1886 states and 2798 transitions. [2024-11-10 01:16:15,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:15,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 321 [2024-11-10 01:16:15,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:15,110 INFO L225 Difference]: With dead ends: 1886 [2024-11-10 01:16:15,111 INFO L226 Difference]: Without dead ends: 1034 [2024-11-10 01:16:15,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:15,114 INFO L432 NwaCegarLoop]: 1204 mSDtfsCounter, 1277 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 2410 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:15,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 2410 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:16:15,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-10 01:16:15,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-11-10 01:16:15,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1025 states have (on average 1.4829268292682927) internal successors, (1520), 1025 states have internal predecessors, (1520), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 01:16:15,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1534 transitions. [2024-11-10 01:16:15,141 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1534 transitions. Word has length 321 [2024-11-10 01:16:15,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:15,141 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1534 transitions. [2024-11-10 01:16:15,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:15,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1534 transitions. [2024-11-10 01:16:15,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-11-10 01:16:15,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:15,146 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:15,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 01:16:15,146 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:15,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:15,147 INFO L85 PathProgramCache]: Analyzing trace with hash -37445914, now seen corresponding path program 1 times [2024-11-10 01:16:15,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:15,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63266841] [2024-11-10 01:16:15,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:15,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:15,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:15,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:15,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 01:16:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:15,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 01:16:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:15,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 01:16:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:15,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 01:16:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:15,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 01:16:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:15,874 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:15,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:15,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63266841] [2024-11-10 01:16:15,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63266841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:15,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:15,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:16:15,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972150893] [2024-11-10 01:16:15,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:15,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:16:15,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:15,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:16:15,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:15,881 INFO L87 Difference]: Start difference. First operand 1034 states and 1534 transitions. Second operand has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:16,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:16,582 INFO L93 Difference]: Finished difference Result 1974 states and 2923 transitions. [2024-11-10 01:16:16,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:16:16,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 322 [2024-11-10 01:16:16,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:16,586 INFO L225 Difference]: With dead ends: 1974 [2024-11-10 01:16:16,586 INFO L226 Difference]: Without dead ends: 1034 [2024-11-10 01:16:16,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 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-11-10 01:16:16,589 INFO L432 NwaCegarLoop]: 1264 mSDtfsCounter, 1516 mSDsluCounter, 2476 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 3740 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:16,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 3740 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:16:16,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-10 01:16:16,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-11-10 01:16:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1025 states have (on average 1.481951219512195) internal successors, (1519), 1025 states have internal predecessors, (1519), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 01:16:16,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1533 transitions. [2024-11-10 01:16:16,615 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1533 transitions. Word has length 322 [2024-11-10 01:16:16,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:16,616 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1533 transitions. [2024-11-10 01:16:16,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:16,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1533 transitions. [2024-11-10 01:16:16,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-11-10 01:16:16,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:16,618 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:16,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 01:16:16,618 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:16,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:16,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1159531592, now seen corresponding path program 1 times [2024-11-10 01:16:16,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:16,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390372141] [2024-11-10 01:16:16,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:16,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:17,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:17,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:17,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 01:16:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:17,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 01:16:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:17,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 01:16:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:17,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 01:16:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:17,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 01:16:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:17,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:17,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390372141] [2024-11-10 01:16:17,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390372141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:17,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:17,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:16:17,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771536550] [2024-11-10 01:16:17,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:17,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:16:17,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:17,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:16:17,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:17,301 INFO L87 Difference]: Start difference. First operand 1034 states and 1533 transitions. Second operand has 5 states, 5 states have (on average 58.2) internal successors, (291), 5 states have internal predecessors, (291), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:17,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:17,819 INFO L93 Difference]: Finished difference Result 1886 states and 2794 transitions. [2024-11-10 01:16:17,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:17,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.2) internal successors, (291), 5 states have internal predecessors, (291), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 323 [2024-11-10 01:16:17,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:17,840 INFO L225 Difference]: With dead ends: 1886 [2024-11-10 01:16:17,840 INFO L226 Difference]: Without dead ends: 1034 [2024-11-10 01:16:17,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:16:17,849 INFO L432 NwaCegarLoop]: 1204 mSDtfsCounter, 1509 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 2421 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:17,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 2421 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:16:17,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-10 01:16:17,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-11-10 01:16:17,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1025 states have (on average 1.4809756097560975) internal successors, (1518), 1025 states have internal predecessors, (1518), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 01:16:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1532 transitions. [2024-11-10 01:16:17,883 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1532 transitions. Word has length 323 [2024-11-10 01:16:17,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:17,883 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1532 transitions. [2024-11-10 01:16:17,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.2) internal successors, (291), 5 states have internal predecessors, (291), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:17,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1532 transitions. [2024-11-10 01:16:17,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-11-10 01:16:17,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:17,886 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:17,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 01:16:17,887 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:17,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:17,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1039020607, now seen corresponding path program 1 times [2024-11-10 01:16:17,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:17,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638997428] [2024-11-10 01:16:17,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:17,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:18,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:18,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:18,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 01:16:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:18,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 01:16:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:18,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 01:16:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:18,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 01:16:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:18,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 01:16:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:18,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:18,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638997428] [2024-11-10 01:16:18,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638997428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:18,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:18,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:16:18,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767860980] [2024-11-10 01:16:18,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:18,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:16:18,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:18,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:16:18,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:18,508 INFO L87 Difference]: Start difference. First operand 1034 states and 1532 transitions. Second operand has 5 states, 5 states have (on average 58.4) internal successors, (292), 5 states have internal predecessors, (292), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:19,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:19,006 INFO L93 Difference]: Finished difference Result 1886 states and 2792 transitions. [2024-11-10 01:16:19,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:19,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.4) internal successors, (292), 5 states have internal predecessors, (292), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 324 [2024-11-10 01:16:19,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:19,011 INFO L225 Difference]: With dead ends: 1886 [2024-11-10 01:16:19,012 INFO L226 Difference]: Without dead ends: 1034 [2024-11-10 01:16:19,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:16:19,014 INFO L432 NwaCegarLoop]: 1204 mSDtfsCounter, 1505 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 2421 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:19,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 2421 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:16:19,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-10 01:16:19,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-11-10 01:16:19,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1025 states have (on average 1.48) internal successors, (1517), 1025 states have internal predecessors, (1517), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 01:16:19,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1531 transitions. [2024-11-10 01:16:19,036 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1531 transitions. Word has length 324 [2024-11-10 01:16:19,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:19,037 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1531 transitions. [2024-11-10 01:16:19,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.4) internal successors, (292), 5 states have internal predecessors, (292), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:19,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1531 transitions. [2024-11-10 01:16:19,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-10 01:16:19,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:19,040 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:19,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 01:16:19,040 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:19,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:19,041 INFO L85 PathProgramCache]: Analyzing trace with hash 511915059, now seen corresponding path program 1 times [2024-11-10 01:16:19,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:19,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939682486] [2024-11-10 01:16:19,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:19,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:19,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:19,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:19,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 01:16:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:19,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 01:16:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:19,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 01:16:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:19,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 01:16:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:19,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 01:16:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:19,661 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:19,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:19,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939682486] [2024-11-10 01:16:19,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939682486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:19,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:19,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:16:19,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301532543] [2024-11-10 01:16:19,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:19,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:16:19,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:19,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:16:19,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:19,665 INFO L87 Difference]: Start difference. First operand 1034 states and 1531 transitions. Second operand has 5 states, 5 states have (on average 58.6) internal successors, (293), 5 states have internal predecessors, (293), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:20,181 INFO L93 Difference]: Finished difference Result 1886 states and 2790 transitions. [2024-11-10 01:16:20,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:20,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.6) internal successors, (293), 5 states have internal predecessors, (293), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 325 [2024-11-10 01:16:20,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:20,186 INFO L225 Difference]: With dead ends: 1886 [2024-11-10 01:16:20,186 INFO L226 Difference]: Without dead ends: 1034 [2024-11-10 01:16:20,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:16:20,188 INFO L432 NwaCegarLoop]: 1204 mSDtfsCounter, 1501 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 2421 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:20,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 2421 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:16:20,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-10 01:16:20,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-11-10 01:16:20,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1025 states have (on average 1.4790243902439024) internal successors, (1516), 1025 states have internal predecessors, (1516), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 01:16:20,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1530 transitions. [2024-11-10 01:16:20,214 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1530 transitions. Word has length 325 [2024-11-10 01:16:20,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:20,215 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1530 transitions. [2024-11-10 01:16:20,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.6) internal successors, (293), 5 states have internal predecessors, (293), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:20,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1530 transitions. [2024-11-10 01:16:20,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-11-10 01:16:20,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:20,218 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:20,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 01:16:20,218 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:20,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:20,219 INFO L85 PathProgramCache]: Analyzing trace with hash -899566052, now seen corresponding path program 1 times [2024-11-10 01:16:20,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:20,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717567898] [2024-11-10 01:16:20,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:20,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:20,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:20,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:20,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 01:16:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:20,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 01:16:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:20,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 01:16:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:20,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 01:16:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:20,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 01:16:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:20,851 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:20,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:20,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717567898] [2024-11-10 01:16:20,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717567898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:20,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:20,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:16:20,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586009902] [2024-11-10 01:16:20,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:20,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:16:20,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:20,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:16:20,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:20,854 INFO L87 Difference]: Start difference. First operand 1034 states and 1530 transitions. Second operand has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:21,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:21,381 INFO L93 Difference]: Finished difference Result 1886 states and 2788 transitions. [2024-11-10 01:16:21,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:21,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 326 [2024-11-10 01:16:21,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:21,386 INFO L225 Difference]: With dead ends: 1886 [2024-11-10 01:16:21,387 INFO L226 Difference]: Without dead ends: 1034 [2024-11-10 01:16:21,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:16:21,391 INFO L432 NwaCegarLoop]: 1204 mSDtfsCounter, 2727 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2734 SdHoareTripleChecker+Valid, 2410 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:21,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2734 Valid, 2410 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:16:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-10 01:16:21,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-11-10 01:16:21,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1025 states have (on average 1.4780487804878049) internal successors, (1515), 1025 states have internal predecessors, (1515), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 01:16:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1529 transitions. [2024-11-10 01:16:21,414 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1529 transitions. Word has length 326 [2024-11-10 01:16:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:21,415 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1529 transitions. [2024-11-10 01:16:21,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1529 transitions. [2024-11-10 01:16:21,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-11-10 01:16:21,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:21,417 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:21,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 01:16:21,418 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:21,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:21,418 INFO L85 PathProgramCache]: Analyzing trace with hash 424993627, now seen corresponding path program 1 times [2024-11-10 01:16:21,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:21,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160845854] [2024-11-10 01:16:21,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:21,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:22,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:22,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:22,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 01:16:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:22,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 01:16:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:22,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 01:16:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:22,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 01:16:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:22,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 01:16:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:22,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:22,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160845854] [2024-11-10 01:16:22,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160845854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:22,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:22,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:16:22,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022581206] [2024-11-10 01:16:22,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:22,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:16:22,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:22,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:16:22,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:22,045 INFO L87 Difference]: Start difference. First operand 1034 states and 1529 transitions. Second operand has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:22,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:22,506 INFO L93 Difference]: Finished difference Result 1886 states and 2786 transitions. [2024-11-10 01:16:22,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:22,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 327 [2024-11-10 01:16:22,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:22,511 INFO L225 Difference]: With dead ends: 1886 [2024-11-10 01:16:22,511 INFO L226 Difference]: Without dead ends: 1034 [2024-11-10 01:16:22,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:16:22,514 INFO L432 NwaCegarLoop]: 1204 mSDtfsCounter, 2719 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2726 SdHoareTripleChecker+Valid, 2410 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:22,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2726 Valid, 2410 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:16:22,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-10 01:16:22,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-11-10 01:16:22,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1025 states have (on average 1.4770731707317073) internal successors, (1514), 1025 states have internal predecessors, (1514), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 01:16:22,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1528 transitions. [2024-11-10 01:16:22,534 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1528 transitions. Word has length 327 [2024-11-10 01:16:22,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:22,535 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1528 transitions. [2024-11-10 01:16:22,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:22,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1528 transitions. [2024-11-10 01:16:22,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-10 01:16:22,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:22,538 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:22,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 01:16:22,538 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:22,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:22,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1183358807, now seen corresponding path program 1 times [2024-11-10 01:16:22,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:22,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026725905] [2024-11-10 01:16:22,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:22,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:23,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:23,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:23,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 01:16:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:23,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 01:16:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:23,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 01:16:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:23,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 01:16:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:23,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 01:16:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:23,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:23,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026725905] [2024-11-10 01:16:23,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026725905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:23,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:23,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:16:23,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088135649] [2024-11-10 01:16:23,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:23,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:16:23,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:23,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:16:23,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:23,222 INFO L87 Difference]: Start difference. First operand 1034 states and 1528 transitions. Second operand has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:23,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:23,761 INFO L93 Difference]: Finished difference Result 1886 states and 2784 transitions. [2024-11-10 01:16:23,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:23,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 328 [2024-11-10 01:16:23,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:23,767 INFO L225 Difference]: With dead ends: 1886 [2024-11-10 01:16:23,767 INFO L226 Difference]: Without dead ends: 1034 [2024-11-10 01:16:23,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:16:23,770 INFO L432 NwaCegarLoop]: 1204 mSDtfsCounter, 1447 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1454 SdHoareTripleChecker+Valid, 2421 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:23,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1454 Valid, 2421 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:16:23,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-10 01:16:23,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-11-10 01:16:23,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1025 states have (on average 1.4760975609756097) internal successors, (1513), 1025 states have internal predecessors, (1513), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 01:16:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1527 transitions. [2024-11-10 01:16:23,791 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1527 transitions. Word has length 328 [2024-11-10 01:16:23,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:23,792 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1527 transitions. [2024-11-10 01:16:23,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1527 transitions. [2024-11-10 01:16:23,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-10 01:16:23,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:23,795 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:23,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 01:16:23,795 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:23,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:23,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1343504118, now seen corresponding path program 1 times [2024-11-10 01:16:23,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:23,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313200260] [2024-11-10 01:16:23,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:23,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:25,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:25,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:25,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 01:16:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:25,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 01:16:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:25,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 01:16:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:25,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 01:16:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:25,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 01:16:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:25,396 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:25,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:25,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313200260] [2024-11-10 01:16:25,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313200260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:25,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:25,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:16:25,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262951044] [2024-11-10 01:16:25,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:25,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:16:25,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:25,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:16:25,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:16:25,399 INFO L87 Difference]: Start difference. First operand 1034 states and 1527 transitions. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:25,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:25,790 INFO L93 Difference]: Finished difference Result 1886 states and 2782 transitions. [2024-11-10 01:16:25,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:25,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 329 [2024-11-10 01:16:25,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:25,794 INFO L225 Difference]: With dead ends: 1886 [2024-11-10 01:16:25,794 INFO L226 Difference]: Without dead ends: 1034 [2024-11-10 01:16:25,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:25,796 INFO L432 NwaCegarLoop]: 1233 mSDtfsCounter, 1330 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1330 SdHoareTripleChecker+Valid, 2468 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:25,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1330 Valid, 2468 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:16:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-10 01:16:25,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-11-10 01:16:25,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1025 states have (on average 1.4751219512195122) internal successors, (1512), 1025 states have internal predecessors, (1512), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 01:16:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1526 transitions. [2024-11-10 01:16:25,816 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1526 transitions. Word has length 329 [2024-11-10 01:16:25,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:25,817 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1526 transitions. [2024-11-10 01:16:25,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:25,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1526 transitions. [2024-11-10 01:16:25,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-10 01:16:25,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:25,819 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:25,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 01:16:25,820 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:25,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:25,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1014018326, now seen corresponding path program 1 times [2024-11-10 01:16:25,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:25,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971528238] [2024-11-10 01:16:25,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:25,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:27,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:27,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:27,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 01:16:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:27,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 01:16:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:27,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 01:16:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:27,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 01:16:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:27,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 01:16:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:27,513 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:27,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:27,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971528238] [2024-11-10 01:16:27,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971528238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:27,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:27,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:16:27,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714460718] [2024-11-10 01:16:27,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:27,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:16:27,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:27,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:16:27,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:16:27,517 INFO L87 Difference]: Start difference. First operand 1034 states and 1526 transitions. Second operand has 6 states, 6 states have (on average 49.666666666666664) internal successors, (298), 6 states have internal predecessors, (298), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 01:16:28,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:28,616 INFO L93 Difference]: Finished difference Result 2823 states and 4163 transitions. [2024-11-10 01:16:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:16:28,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.666666666666664) internal successors, (298), 6 states have internal predecessors, (298), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 330 [2024-11-10 01:16:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:28,623 INFO L225 Difference]: With dead ends: 2823 [2024-11-10 01:16:28,623 INFO L226 Difference]: Without dead ends: 1871 [2024-11-10 01:16:28,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:16:28,626 INFO L432 NwaCegarLoop]: 1344 mSDtfsCounter, 1288 mSDsluCounter, 4920 mSDsCounter, 0 mSdLazyCounter, 1660 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 6264 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:28,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 6264 Invalid, 1671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1660 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 01:16:28,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2024-11-10 01:16:28,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1093. [2024-11-10 01:16:28,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 1082 states have (on average 1.4741219963031422) internal successors, (1595), 1082 states have internal predecessors, (1595), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:16:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1613 transitions. [2024-11-10 01:16:28,670 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1613 transitions. Word has length 330 [2024-11-10 01:16:28,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:28,671 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1613 transitions. [2024-11-10 01:16:28,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.666666666666664) internal successors, (298), 6 states have internal predecessors, (298), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 01:16:28,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1613 transitions. [2024-11-10 01:16:28,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-11-10 01:16:28,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:28,674 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:28,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 01:16:28,674 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:28,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:28,675 INFO L85 PathProgramCache]: Analyzing trace with hash -251570059, now seen corresponding path program 1 times [2024-11-10 01:16:28,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:28,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336503870] [2024-11-10 01:16:28,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:28,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:29,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:29,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:29,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 01:16:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:29,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 01:16:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:29,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 01:16:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:29,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-10 01:16:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:29,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-10 01:16:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:29,996 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:29,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:29,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336503870] [2024-11-10 01:16:29,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336503870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:29,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:29,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:16:29,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663965282] [2024-11-10 01:16:29,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:29,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:16:29,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:29,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:16:29,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:16:29,999 INFO L87 Difference]: Start difference. First operand 1093 states and 1613 transitions. Second operand has 4 states, 4 states have (on average 74.75) internal successors, (299), 4 states have internal predecessors, (299), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:30,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:30,520 INFO L93 Difference]: Finished difference Result 1945 states and 2867 transitions. [2024-11-10 01:16:30,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:30,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.75) internal successors, (299), 4 states have internal predecessors, (299), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 331 [2024-11-10 01:16:30,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:30,524 INFO L225 Difference]: With dead ends: 1945 [2024-11-10 01:16:30,524 INFO L226 Difference]: Without dead ends: 1093 [2024-11-10 01:16:30,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:30,525 INFO L432 NwaCegarLoop]: 1203 mSDtfsCounter, 1321 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1321 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:30,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1321 Valid, 2408 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:16:30,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2024-11-10 01:16:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1093. [2024-11-10 01:16:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 1082 states have (on average 1.4731977818853974) internal successors, (1594), 1082 states have internal predecessors, (1594), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:16:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1612 transitions. [2024-11-10 01:16:30,553 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1612 transitions. Word has length 331 [2024-11-10 01:16:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:30,554 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1612 transitions. [2024-11-10 01:16:30,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.75) internal successors, (299), 4 states have internal predecessors, (299), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1612 transitions. [2024-11-10 01:16:30,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-10 01:16:30,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:30,557 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:30,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 01:16:30,557 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:30,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:30,558 INFO L85 PathProgramCache]: Analyzing trace with hash 64188822, now seen corresponding path program 1 times [2024-11-10 01:16:30,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:30,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236029475] [2024-11-10 01:16:30,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:30,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:31,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:31,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:31,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 01:16:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:31,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 01:16:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:31,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 01:16:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:31,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-10 01:16:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:31,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-10 01:16:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:31,618 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:31,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:31,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236029475] [2024-11-10 01:16:31,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236029475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:31,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:31,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:16:31,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90025245] [2024-11-10 01:16:31,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:31,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:16:31,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:31,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:16:31,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:31,621 INFO L87 Difference]: Start difference. First operand 1093 states and 1612 transitions. Second operand has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:32,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:32,138 INFO L93 Difference]: Finished difference Result 1945 states and 2865 transitions. [2024-11-10 01:16:32,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:32,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 332 [2024-11-10 01:16:32,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:32,142 INFO L225 Difference]: With dead ends: 1945 [2024-11-10 01:16:32,142 INFO L226 Difference]: Without dead ends: 1093 [2024-11-10 01:16:32,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:16:32,144 INFO L432 NwaCegarLoop]: 1203 mSDtfsCounter, 2634 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2634 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:32,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2634 Valid, 2408 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:16:32,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2024-11-10 01:16:32,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1093. [2024-11-10 01:16:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 1082 states have (on average 1.4722735674676526) internal successors, (1593), 1082 states have internal predecessors, (1593), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:16:32,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1611 transitions. [2024-11-10 01:16:32,167 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1611 transitions. Word has length 332 [2024-11-10 01:16:32,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:32,168 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1611 transitions. [2024-11-10 01:16:32,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:32,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1611 transitions. [2024-11-10 01:16:32,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-11-10 01:16:32,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:32,173 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:32,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 01:16:32,173 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:32,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:32,174 INFO L85 PathProgramCache]: Analyzing trace with hash 890034324, now seen corresponding path program 1 times [2024-11-10 01:16:32,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:32,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764114127] [2024-11-10 01:16:32,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:32,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:33,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:33,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:33,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 01:16:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:33,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 01:16:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:33,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 01:16:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:33,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-10 01:16:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:33,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-10 01:16:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:33,143 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:33,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:33,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764114127] [2024-11-10 01:16:33,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764114127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:33,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:33,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:16:33,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704610539] [2024-11-10 01:16:33,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:33,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:16:33,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:33,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:16:33,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:33,146 INFO L87 Difference]: Start difference. First operand 1093 states and 1611 transitions. Second operand has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:33,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:33,691 INFO L93 Difference]: Finished difference Result 1945 states and 2863 transitions. [2024-11-10 01:16:33,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:33,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 333 [2024-11-10 01:16:33,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:33,696 INFO L225 Difference]: With dead ends: 1945 [2024-11-10 01:16:33,696 INFO L226 Difference]: Without dead ends: 1093 [2024-11-10 01:16:33,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:16:33,698 INFO L432 NwaCegarLoop]: 1203 mSDtfsCounter, 1318 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1318 SdHoareTripleChecker+Valid, 2419 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:33,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1318 Valid, 2419 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:16:33,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2024-11-10 01:16:33,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1093. [2024-11-10 01:16:33,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 1082 states have (on average 1.4713493530499075) internal successors, (1592), 1082 states have internal predecessors, (1592), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:16:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1610 transitions. [2024-11-10 01:16:33,727 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1610 transitions. Word has length 333 [2024-11-10 01:16:33,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:33,727 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1610 transitions. [2024-11-10 01:16:33,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:33,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1610 transitions. [2024-11-10 01:16:33,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-10 01:16:33,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:33,730 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:33,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 01:16:33,731 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:33,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:33,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1424622288, now seen corresponding path program 1 times [2024-11-10 01:16:33,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:33,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640984648] [2024-11-10 01:16:33,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:33,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:34,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:34,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:34,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 01:16:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:34,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 01:16:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:34,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 01:16:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:34,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-10 01:16:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:34,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-10 01:16:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:34,696 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:34,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:34,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640984648] [2024-11-10 01:16:34,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640984648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:34,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:34,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:16:34,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423049344] [2024-11-10 01:16:34,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:34,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:16:34,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:34,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:16:34,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:34,699 INFO L87 Difference]: Start difference. First operand 1093 states and 1610 transitions. Second operand has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:35,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:35,177 INFO L93 Difference]: Finished difference Result 1945 states and 2861 transitions. [2024-11-10 01:16:35,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:35,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 334 [2024-11-10 01:16:35,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:35,186 INFO L225 Difference]: With dead ends: 1945 [2024-11-10 01:16:35,186 INFO L226 Difference]: Without dead ends: 1093 [2024-11-10 01:16:35,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:16:35,189 INFO L432 NwaCegarLoop]: 1203 mSDtfsCounter, 1317 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 2419 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:35,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 2419 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:16:35,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2024-11-10 01:16:35,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1093. [2024-11-10 01:16:35,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 1082 states have (on average 1.4704251386321627) internal successors, (1591), 1082 states have internal predecessors, (1591), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:16:35,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1609 transitions. [2024-11-10 01:16:35,212 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1609 transitions. Word has length 334 [2024-11-10 01:16:35,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:35,213 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1609 transitions. [2024-11-10 01:16:35,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:35,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1609 transitions. [2024-11-10 01:16:35,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-11-10 01:16:35,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:35,216 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:35,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 01:16:35,216 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:35,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:35,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1640924145, now seen corresponding path program 1 times [2024-11-10 01:16:35,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:35,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756869800] [2024-11-10 01:16:35,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:35,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:36,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:36,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:36,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 01:16:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:36,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 01:16:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:36,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 01:16:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:36,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-10 01:16:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:36,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-10 01:16:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:36,226 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:36,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:36,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756869800] [2024-11-10 01:16:36,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756869800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:36,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:36,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:16:36,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515931366] [2024-11-10 01:16:36,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:36,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:16:36,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:36,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:16:36,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:36,229 INFO L87 Difference]: Start difference. First operand 1093 states and 1609 transitions. Second operand has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:36,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:36,724 INFO L93 Difference]: Finished difference Result 1945 states and 2859 transitions. [2024-11-10 01:16:36,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:36,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 335 [2024-11-10 01:16:36,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:36,728 INFO L225 Difference]: With dead ends: 1945 [2024-11-10 01:16:36,728 INFO L226 Difference]: Without dead ends: 1093 [2024-11-10 01:16:36,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:16:36,730 INFO L432 NwaCegarLoop]: 1203 mSDtfsCounter, 1316 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1316 SdHoareTripleChecker+Valid, 2419 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:36,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1316 Valid, 2419 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:16:36,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2024-11-10 01:16:36,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1093. [2024-11-10 01:16:36,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 1082 states have (on average 1.4695009242144177) internal successors, (1590), 1082 states have internal predecessors, (1590), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:16:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1608 transitions. [2024-11-10 01:16:36,750 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1608 transitions. Word has length 335 [2024-11-10 01:16:36,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:36,751 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1608 transitions. [2024-11-10 01:16:36,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:36,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1608 transitions. [2024-11-10 01:16:36,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-10 01:16:36,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:36,754 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:36,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 01:16:36,754 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:36,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:36,755 INFO L85 PathProgramCache]: Analyzing trace with hash 291422278, now seen corresponding path program 1 times [2024-11-10 01:16:36,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:36,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294968346] [2024-11-10 01:16:36,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:36,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:37,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:37,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:37,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 01:16:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:37,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 01:16:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:37,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 01:16:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:37,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-10 01:16:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:37,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-10 01:16:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:37,553 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:37,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:37,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294968346] [2024-11-10 01:16:37,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294968346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:37,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:37,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:16:37,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194074455] [2024-11-10 01:16:37,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:37,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:16:37,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:37,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:16:37,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:37,556 INFO L87 Difference]: Start difference. First operand 1093 states and 1608 transitions. Second operand has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:38,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:38,044 INFO L93 Difference]: Finished difference Result 1945 states and 2857 transitions. [2024-11-10 01:16:38,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:38,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 336 [2024-11-10 01:16:38,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:38,048 INFO L225 Difference]: With dead ends: 1945 [2024-11-10 01:16:38,048 INFO L226 Difference]: Without dead ends: 1093 [2024-11-10 01:16:38,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:16:38,050 INFO L432 NwaCegarLoop]: 1203 mSDtfsCounter, 2565 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2565 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:38,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2565 Valid, 2408 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:16:38,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2024-11-10 01:16:38,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1093. [2024-11-10 01:16:38,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 1082 states have (on average 1.4685767097966729) internal successors, (1589), 1082 states have internal predecessors, (1589), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:16:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1607 transitions. [2024-11-10 01:16:38,071 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1607 transitions. Word has length 336 [2024-11-10 01:16:38,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:38,071 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1607 transitions. [2024-11-10 01:16:38,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1607 transitions. [2024-11-10 01:16:38,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-10 01:16:38,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:38,074 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:38,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 01:16:38,074 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:38,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:38,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1312315289, now seen corresponding path program 1 times [2024-11-10 01:16:38,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:38,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944199181] [2024-11-10 01:16:38,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:38,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:39,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:39,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:39,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 01:16:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:39,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 01:16:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:39,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 01:16:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:39,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-10 01:16:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:39,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-10 01:16:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:39,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:39,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944199181] [2024-11-10 01:16:39,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944199181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:39,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:39,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:16:39,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777684884] [2024-11-10 01:16:39,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:39,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:16:39,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:39,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:16:39,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:39,372 INFO L87 Difference]: Start difference. First operand 1093 states and 1607 transitions. Second operand has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 01:16:40,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:40,356 INFO L93 Difference]: Finished difference Result 1949 states and 2861 transitions. [2024-11-10 01:16:40,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:16:40,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 337 [2024-11-10 01:16:40,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:40,363 INFO L225 Difference]: With dead ends: 1949 [2024-11-10 01:16:40,363 INFO L226 Difference]: Without dead ends: 1097 [2024-11-10 01:16:40,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:40,365 INFO L432 NwaCegarLoop]: 962 mSDtfsCounter, 1444 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1446 SdHoareTripleChecker+Valid, 2854 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:40,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1446 Valid, 2854 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1682 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 01:16:40,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2024-11-10 01:16:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1095. [2024-11-10 01:16:40,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1084 states have (on average 1.4677121771217712) internal successors, (1591), 1084 states have internal predecessors, (1591), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:16:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1609 transitions. [2024-11-10 01:16:40,387 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1609 transitions. Word has length 337 [2024-11-10 01:16:40,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:40,388 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1609 transitions. [2024-11-10 01:16:40,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 01:16:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1609 transitions. [2024-11-10 01:16:40,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-11-10 01:16:40,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:40,391 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:40,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 01:16:40,391 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:40,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:40,392 INFO L85 PathProgramCache]: Analyzing trace with hash -545681341, now seen corresponding path program 1 times [2024-11-10 01:16:40,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:40,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191206320] [2024-11-10 01:16:40,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:40,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:41,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:41,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:41,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 01:16:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:41,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 01:16:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:41,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 01:16:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:41,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-10 01:16:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:41,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-10 01:16:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:41,700 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:41,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:41,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191206320] [2024-11-10 01:16:41,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191206320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:41,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:41,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:16:41,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57375566] [2024-11-10 01:16:41,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:41,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:16:41,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:41,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:16:41,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:16:41,703 INFO L87 Difference]: Start difference. First operand 1095 states and 1609 transitions. Second operand has 6 states, 6 states have (on average 51.0) internal successors, (306), 6 states have internal predecessors, (306), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 01:16:43,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:43,102 INFO L93 Difference]: Finished difference Result 2729 states and 4001 transitions. [2024-11-10 01:16:43,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:16:43,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.0) internal successors, (306), 6 states have internal predecessors, (306), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 338 [2024-11-10 01:16:43,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:43,106 INFO L225 Difference]: With dead ends: 2729 [2024-11-10 01:16:43,107 INFO L226 Difference]: Without dead ends: 1875 [2024-11-10 01:16:43,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:16:43,108 INFO L432 NwaCegarLoop]: 960 mSDtfsCounter, 3772 mSDsluCounter, 2830 mSDsCounter, 0 mSdLazyCounter, 2251 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3784 SdHoareTripleChecker+Valid, 3790 SdHoareTripleChecker+Invalid, 2256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:43,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3784 Valid, 3790 Invalid, 2256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2251 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 01:16:43,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2024-11-10 01:16:43,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1096. [2024-11-10 01:16:43,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1085 states have (on average 1.4672811059907833) internal successors, (1592), 1085 states have internal predecessors, (1592), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:16:43,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1610 transitions. [2024-11-10 01:16:43,138 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1610 transitions. Word has length 338 [2024-11-10 01:16:43,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:43,138 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1610 transitions. [2024-11-10 01:16:43,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.0) internal successors, (306), 6 states have internal predecessors, (306), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 01:16:43,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1610 transitions. [2024-11-10 01:16:43,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-11-10 01:16:43,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:43,141 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:43,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 01:16:43,142 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:43,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:43,142 INFO L85 PathProgramCache]: Analyzing trace with hash 106033665, now seen corresponding path program 1 times [2024-11-10 01:16:43,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:43,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424354400] [2024-11-10 01:16:43,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:43,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:43,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 01:16:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:43,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 01:16:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:43,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 01:16:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:43,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 01:16:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:43,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 01:16:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:43,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-10 01:16:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:43,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-10 01:16:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:43,859 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:43,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:43,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424354400] [2024-11-10 01:16:43,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424354400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:43,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:43,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:16:43,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040856838] [2024-11-10 01:16:43,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:43,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:16:43,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:43,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:16:43,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:16:43,861 INFO L87 Difference]: Start difference. First operand 1096 states and 1610 transitions. Second operand has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 01:16:44,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:44,521 INFO L93 Difference]: Finished difference Result 2052 states and 3011 transitions. [2024-11-10 01:16:44,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:44,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 338 [2024-11-10 01:16:44,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:44,525 INFO L225 Difference]: With dead ends: 2052 [2024-11-10 01:16:44,525 INFO L226 Difference]: Without dead ends: 1096 [2024-11-10 01:16:44,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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-11-10 01:16:44,527 INFO L432 NwaCegarLoop]: 1372 mSDtfsCounter, 72 mSDsluCounter, 2336 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 3708 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:44,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 3708 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:16:44,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2024-11-10 01:16:44,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1096. [2024-11-10 01:16:44,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1085 states have (on average 1.4663594470046082) internal successors, (1591), 1085 states have internal predecessors, (1591), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:16:44,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1609 transitions. [2024-11-10 01:16:44,547 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1609 transitions. Word has length 338 [2024-11-10 01:16:44,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:44,548 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1609 transitions. [2024-11-10 01:16:44,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 01:16:44,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1609 transitions. [2024-11-10 01:16:44,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-10 01:16:44,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:44,551 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:44,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 01:16:44,551 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:44,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:44,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1940870274, now seen corresponding path program 1 times [2024-11-10 01:16:44,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:44,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783667028] [2024-11-10 01:16:44,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:44,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:45,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:45,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:45,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-10 01:16:45,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:45,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 01:16:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:45,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 01:16:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:45,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 01:16:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:45,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 01:16:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:45,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:45,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783667028] [2024-11-10 01:16:45,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783667028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:45,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:45,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:16:45,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217142473] [2024-11-10 01:16:45,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:45,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:16:45,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:45,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:16:45,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:16:45,427 INFO L87 Difference]: Start difference. First operand 1096 states and 1609 transitions. Second operand has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 01:16:46,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:46,104 INFO L93 Difference]: Finished difference Result 1950 states and 2858 transitions. [2024-11-10 01:16:46,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:46,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 339 [2024-11-10 01:16:46,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:46,107 INFO L225 Difference]: With dead ends: 1950 [2024-11-10 01:16:46,107 INFO L226 Difference]: Without dead ends: 1096 [2024-11-10 01:16:46,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:16:46,109 INFO L432 NwaCegarLoop]: 963 mSDtfsCounter, 1378 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:46,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 1914 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:16:46,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2024-11-10 01:16:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1096. [2024-11-10 01:16:46,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1085 states have (on average 1.4654377880184333) internal successors, (1590), 1085 states have internal predecessors, (1590), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:16:46,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1608 transitions. [2024-11-10 01:16:46,130 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1608 transitions. Word has length 339 [2024-11-10 01:16:46,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:46,131 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1608 transitions. [2024-11-10 01:16:46,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 01:16:46,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1608 transitions. [2024-11-10 01:16:46,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-11-10 01:16:46,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:46,134 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:46,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 01:16:46,134 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:46,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:46,137 INFO L85 PathProgramCache]: Analyzing trace with hash 161208903, now seen corresponding path program 1 times [2024-11-10 01:16:46,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:46,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152893862] [2024-11-10 01:16:46,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:46,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:47,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:47,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:47,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-10 01:16:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:47,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 01:16:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:47,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 01:16:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:47,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 01:16:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:47,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 01:16:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:47,423 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:47,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:47,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152893862] [2024-11-10 01:16:47,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152893862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:47,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:47,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:16:47,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883119417] [2024-11-10 01:16:47,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:47,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:16:47,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:47,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:16:47,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:47,426 INFO L87 Difference]: Start difference. First operand 1096 states and 1608 transitions. Second operand has 5 states, 5 states have (on average 61.6) internal successors, (308), 5 states have internal predecessors, (308), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:48,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:48,333 INFO L93 Difference]: Finished difference Result 1952 states and 2859 transitions. [2024-11-10 01:16:48,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:16:48,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.6) internal successors, (308), 5 states have internal predecessors, (308), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 340 [2024-11-10 01:16:48,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:48,336 INFO L225 Difference]: With dead ends: 1952 [2024-11-10 01:16:48,336 INFO L226 Difference]: Without dead ends: 1098 [2024-11-10 01:16:48,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:16:48,338 INFO L432 NwaCegarLoop]: 962 mSDtfsCounter, 1327 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1327 SdHoareTripleChecker+Valid, 2854 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:48,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1327 Valid, 2854 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 01:16:48,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2024-11-10 01:16:48,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1097. [2024-11-10 01:16:48,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 1086 states have (on average 1.4650092081031307) internal successors, (1591), 1086 states have internal predecessors, (1591), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:16:48,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1609 transitions. [2024-11-10 01:16:48,357 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1609 transitions. Word has length 340 [2024-11-10 01:16:48,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:48,358 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1609 transitions. [2024-11-10 01:16:48,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.6) internal successors, (308), 5 states have internal predecessors, (308), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 01:16:48,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1609 transitions. [2024-11-10 01:16:48,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-11-10 01:16:48,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:48,361 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:48,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 01:16:48,361 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:48,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:48,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1398805460, now seen corresponding path program 1 times [2024-11-10 01:16:48,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:48,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118146450] [2024-11-10 01:16:48,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:48,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:49,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:49,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:49,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-10 01:16:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:49,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 01:16:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:49,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 01:16:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:49,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 01:16:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:49,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 01:16:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:49,516 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:49,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:49,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118146450] [2024-11-10 01:16:49,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118146450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:49,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:49,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:16:49,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958980963] [2024-11-10 01:16:49,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:49,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:16:49,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:49,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:16:49,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:16:49,518 INFO L87 Difference]: Start difference. First operand 1097 states and 1609 transitions. Second operand has 9 states, 9 states have (on average 34.22222222222222) internal successors, (308), 9 states have internal predecessors, (308), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-10 01:16:51,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:51,247 INFO L93 Difference]: Finished difference Result 1964 states and 2876 transitions. [2024-11-10 01:16:51,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:16:51,248 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 34.22222222222222) internal successors, (308), 9 states have internal predecessors, (308), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 340 [2024-11-10 01:16:51,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:51,250 INFO L225 Difference]: With dead ends: 1964 [2024-11-10 01:16:51,250 INFO L226 Difference]: Without dead ends: 1109 [2024-11-10 01:16:51,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:16:51,252 INFO L432 NwaCegarLoop]: 954 mSDtfsCounter, 1491 mSDsluCounter, 5649 mSDsCounter, 0 mSdLazyCounter, 3972 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 6603 SdHoareTripleChecker+Invalid, 3975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:51,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 6603 Invalid, 3975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3972 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 01:16:51,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2024-11-10 01:16:51,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1105. [2024-11-10 01:16:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 1094 states have (on average 1.4643510054844606) internal successors, (1602), 1094 states have internal predecessors, (1602), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:16:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1620 transitions. [2024-11-10 01:16:51,270 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1620 transitions. Word has length 340 [2024-11-10 01:16:51,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:51,271 INFO L471 AbstractCegarLoop]: Abstraction has 1105 states and 1620 transitions. [2024-11-10 01:16:51,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.22222222222222) internal successors, (308), 9 states have internal predecessors, (308), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-10 01:16:51,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1620 transitions. [2024-11-10 01:16:51,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-10 01:16:51,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:51,274 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:51,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 01:16:51,274 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:51,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:51,275 INFO L85 PathProgramCache]: Analyzing trace with hash 747869052, now seen corresponding path program 1 times [2024-11-10 01:16:51,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:51,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886052418] [2024-11-10 01:16:51,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:51,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:51,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:51,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:51,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-10 01:16:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:51,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 01:16:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:51,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-10 01:16:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:51,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 01:16:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:51,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 01:16:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:51,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:51,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886052418] [2024-11-10 01:16:51,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886052418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:51,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:51,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:16:51,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713737010] [2024-11-10 01:16:51,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:51,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:16:51,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:51,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:16:51,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:16:51,760 INFO L87 Difference]: Start difference. First operand 1105 states and 1620 transitions. Second operand has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 01:16:52,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:16:52,141 INFO L93 Difference]: Finished difference Result 1970 states and 2883 transitions. [2024-11-10 01:16:52,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:16:52,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 341 [2024-11-10 01:16:52,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:16:52,144 INFO L225 Difference]: With dead ends: 1970 [2024-11-10 01:16:52,144 INFO L226 Difference]: Without dead ends: 1107 [2024-11-10 01:16:52,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 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-11-10 01:16:52,146 INFO L432 NwaCegarLoop]: 1261 mSDtfsCounter, 0 mSDsluCounter, 2501 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3762 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:16:52,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3762 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:16:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2024-11-10 01:16:52,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1107. [2024-11-10 01:16:52,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 1096 states have (on average 1.4635036496350364) internal successors, (1604), 1096 states have internal predecessors, (1604), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:16:52,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1622 transitions. [2024-11-10 01:16:52,165 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1622 transitions. Word has length 341 [2024-11-10 01:16:52,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:16:52,166 INFO L471 AbstractCegarLoop]: Abstraction has 1107 states and 1622 transitions. [2024-11-10 01:16:52,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 01:16:52,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1622 transitions. [2024-11-10 01:16:52,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-10 01:16:52,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:16:52,168 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:16:52,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 01:16:52,169 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:16:52,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:16:52,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1729385781, now seen corresponding path program 1 times [2024-11-10 01:16:52,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:16:52,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565802144] [2024-11-10 01:16:52,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:16:52,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:16:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:54,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 01:16:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:54,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 01:16:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:54,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-10 01:16:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:54,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 01:16:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:54,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-10 01:16:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:54,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 01:16:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:54,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 01:16:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:16:54,063 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 01:16:54,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:16:54,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565802144] [2024-11-10 01:16:54,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565802144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:16:54,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:16:54,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 01:16:54,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368710284] [2024-11-10 01:16:54,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:16:54,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 01:16:54,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:16:54,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 01:16:54,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-10 01:16:54,067 INFO L87 Difference]: Start difference. First operand 1107 states and 1622 transitions. Second operand has 11 states, 11 states have (on average 28.09090909090909) internal successors, (309), 11 states have internal predecessors, (309), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)