./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c8d69d1f3064c47045f447426cd788cf9b3338c09ab601cc7dd6947b7697cf1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:18:34,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:18:34,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:18:34,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:18:34,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:18:35,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:18:35,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:18:35,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:18:35,007 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:18:35,008 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:18:35,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:18:35,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:18:35,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:18:35,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:18:35,010 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:18:35,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:18:35,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:18:35,012 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:18:35,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:18:35,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:18:35,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:18:35,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:18:35,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:18:35,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:18:35,017 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:18:35,017 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:18:35,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:18:35,018 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:18:35,018 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:18:35,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:18:35,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:18:35,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:18:35,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:18:35,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:18:35,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:18:35,020 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:18:35,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:18:35,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:18:35,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:18:35,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:18:35,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:18:35,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:18:35,024 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4c8d69d1f3064c47045f447426cd788cf9b3338c09ab601cc7dd6947b7697cf1 [2024-11-09 02:18:35,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:18:35,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:18:35,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:18:35,368 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:18:35,369 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:18:35,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i [2024-11-09 02:18:36,875 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:18:37,074 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:18:37,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i [2024-11-09 02:18:37,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17f60174a/ab1ef3bfe07e42deaa7b6c7faa05434f/FLAG9b1c303c9 [2024-11-09 02:18:37,106 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17f60174a/ab1ef3bfe07e42deaa7b6c7faa05434f [2024-11-09 02:18:37,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:18:37,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:18:37,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:18:37,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:18:37,121 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:18:37,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:18:37" (1/1) ... [2024-11-09 02:18:37,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fe161b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:37, skipping insertion in model container [2024-11-09 02:18:37,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:18:37" (1/1) ... [2024-11-09 02:18:37,154 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:18:37,326 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/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i[917,930] [2024-11-09 02:18:37,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:18:37,410 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:18:37,422 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/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i[917,930] [2024-11-09 02:18:37,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:18:37,507 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:18:37,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:37 WrapperNode [2024-11-09 02:18:37,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:18:37,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:18:37,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:18:37,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:18:37,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:37" (1/1) ... [2024-11-09 02:18:37,530 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:37" (1/1) ... [2024-11-09 02:18:37,565 INFO L138 Inliner]: procedures = 30, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 537 [2024-11-09 02:18:37,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:18:37,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:18:37,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:18:37,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:18:37,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:37" (1/1) ... [2024-11-09 02:18:37,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:37" (1/1) ... [2024-11-09 02:18:37,584 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:37" (1/1) ... [2024-11-09 02:18:37,591 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:18:37,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:37" (1/1) ... [2024-11-09 02:18:37,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:37" (1/1) ... [2024-11-09 02:18:37,610 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:37" (1/1) ... [2024-11-09 02:18:37,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:37" (1/1) ... [2024-11-09 02:18:37,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:37" (1/1) ... [2024-11-09 02:18:37,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:37" (1/1) ... [2024-11-09 02:18:37,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:18:37,626 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:18:37,626 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:18:37,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:18:37,627 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:37" (1/1) ... [2024-11-09 02:18:37,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:18:37,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:18:37,705 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:18:37,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:18:37,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:18:37,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:18:37,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:18:37,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:18:37,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:18:37,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:18:37,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:18:37,764 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:18:37,764 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:18:37,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:18:37,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:18:37,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:18:37,955 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:18:37,957 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:18:38,689 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-11-09 02:18:38,690 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:18:38,714 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:18:38,715 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:18:38,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:18:38 BoogieIcfgContainer [2024-11-09 02:18:38,717 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:18:38,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:18:38,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:18:38,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:18:38,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:18:37" (1/3) ... [2024-11-09 02:18:38,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de0b38b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:18:38, skipping insertion in model container [2024-11-09 02:18:38,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:37" (2/3) ... [2024-11-09 02:18:38,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de0b38b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:18:38, skipping insertion in model container [2024-11-09 02:18:38,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:18:38" (3/3) ... [2024-11-09 02:18:38,727 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-88.i [2024-11-09 02:18:38,745 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:18:38,746 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:18:38,814 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:18:38,821 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;@4cbc093e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:18:38,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:18:38,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:18:38,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 02:18:38,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:38,842 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:38,842 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:38,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:38,847 INFO L85 PathProgramCache]: Analyzing trace with hash -100183722, now seen corresponding path program 1 times [2024-11-09 02:18:38,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:38,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862757122] [2024-11-09 02:18:38,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:38,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:39,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:39,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:39,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:39,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:39,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:39,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:39,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:39,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:39,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:18:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:39,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:18:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:39,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:39,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:18:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:39,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:18:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:39,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:39,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:18:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:39,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:18:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:39,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:18:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:39,444 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:18:39,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:39,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862757122] [2024-11-09 02:18:39,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862757122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:39,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:39,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:18:39,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991263951] [2024-11-09 02:18:39,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:39,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:18:39,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:39,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:18:39,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:18:39,521 INFO L87 Difference]: Start difference. First operand has 119 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:18:39,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:39,564 INFO L93 Difference]: Finished difference Result 231 states and 361 transitions. [2024-11-09 02:18:39,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:18:39,567 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-11-09 02:18:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:39,578 INFO L225 Difference]: With dead ends: 231 [2024-11-09 02:18:39,579 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 02:18:39,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-09 02:18:39,588 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:39,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:18:39,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 02:18:39,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-09 02:18:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:18:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2024-11-09 02:18:39,634 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 143 [2024-11-09 02:18:39,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:39,635 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2024-11-09 02:18:39,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:18:39,635 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2024-11-09 02:18:39,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 02:18:39,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:39,638 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:39,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:18:39,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:39,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:39,639 INFO L85 PathProgramCache]: Analyzing trace with hash 753164736, now seen corresponding path program 1 times [2024-11-09 02:18:39,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:39,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765548164] [2024-11-09 02:18:39,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:39,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:18:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:18:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:18:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:18:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:18:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:18:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:18:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:18:40,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:40,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765548164] [2024-11-09 02:18:40,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765548164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:40,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:40,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:18:40,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293830749] [2024-11-09 02:18:40,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:40,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:18:40,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:40,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:18:40,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:18:40,148 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:18:40,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:40,202 INFO L93 Difference]: Finished difference Result 229 states and 336 transitions. [2024-11-09 02:18:40,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:18:40,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-11-09 02:18:40,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:40,211 INFO L225 Difference]: With dead ends: 229 [2024-11-09 02:18:40,212 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 02:18:40,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-09 02:18:40,215 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:40,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:18:40,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 02:18:40,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-09 02:18:40,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:18:40,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2024-11-09 02:18:40,234 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 143 [2024-11-09 02:18:40,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:40,236 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2024-11-09 02:18:40,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:18:40,237 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2024-11-09 02:18:40,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 02:18:40,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:40,239 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:40,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:18:40,240 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:40,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:40,240 INFO L85 PathProgramCache]: Analyzing trace with hash -122854270, now seen corresponding path program 1 times [2024-11-09 02:18:40,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:40,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810688227] [2024-11-09 02:18:40,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:40,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:18:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:18:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:18:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:18:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:18:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:18:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:18:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,576 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:18:40,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:40,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810688227] [2024-11-09 02:18:40,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810688227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:40,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:40,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:18:40,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863285284] [2024-11-09 02:18:40,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:40,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:18:40,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:40,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:18:40,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:18:40,582 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:18:40,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:40,635 INFO L93 Difference]: Finished difference Result 234 states and 341 transitions. [2024-11-09 02:18:40,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:18:40,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-09 02:18:40,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:40,638 INFO L225 Difference]: With dead ends: 234 [2024-11-09 02:18:40,638 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 02:18:40,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-09 02:18:40,640 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:40,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 484 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:18:40,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 02:18:40,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-09 02:18:40,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:18:40,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2024-11-09 02:18:40,652 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 143 [2024-11-09 02:18:40,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:40,652 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2024-11-09 02:18:40,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:18:40,653 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2024-11-09 02:18:40,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 02:18:40,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:40,655 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:40,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:18:40,656 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:40,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:40,656 INFO L85 PathProgramCache]: Analyzing trace with hash 557204100, now seen corresponding path program 1 times [2024-11-09 02:18:40,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:40,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842271159] [2024-11-09 02:18:40,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:40,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:18:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:18:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:18:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:18:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:18:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:18:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:18:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:40,990 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:18:40,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:40,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842271159] [2024-11-09 02:18:40,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842271159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:40,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:40,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:18:40,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842779026] [2024-11-09 02:18:40,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:40,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:18:40,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:40,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:18:40,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:18:40,998 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:18:41,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:41,029 INFO L93 Difference]: Finished difference Result 238 states and 345 transitions. [2024-11-09 02:18:41,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:18:41,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-09 02:18:41,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:41,032 INFO L225 Difference]: With dead ends: 238 [2024-11-09 02:18:41,032 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 02:18:41,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-09 02:18:41,037 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:41,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 485 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:18:41,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 02:18:41,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-09 02:18:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:18:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 174 transitions. [2024-11-09 02:18:41,054 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 174 transitions. Word has length 143 [2024-11-09 02:18:41,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:41,057 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 174 transitions. [2024-11-09 02:18:41,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:18:41,058 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 174 transitions. [2024-11-09 02:18:41,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 02:18:41,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:41,060 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:41,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:18:41,060 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:41,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:41,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1962755834, now seen corresponding path program 1 times [2024-11-09 02:18:41,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:41,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718168780] [2024-11-09 02:18:41,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:41,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:41,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:41,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:41,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:41,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:41,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:41,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:41,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:41,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:41,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:18:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:41,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:18:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:41,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:41,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:18:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:41,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:18:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:41,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:41,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:18:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:41,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:18:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:41,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:18:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:41,295 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:18:41,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:41,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718168780] [2024-11-09 02:18:41,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718168780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:41,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:41,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:18:41,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456116352] [2024-11-09 02:18:41,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:41,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:18:41,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:41,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:18:41,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:18:41,298 INFO L87 Difference]: Start difference. First operand 121 states and 174 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:18:41,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:41,321 INFO L93 Difference]: Finished difference Result 242 states and 349 transitions. [2024-11-09 02:18:41,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:18:41,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-09 02:18:41,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:41,324 INFO L225 Difference]: With dead ends: 242 [2024-11-09 02:18:41,324 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 02:18:41,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-09 02:18:41,326 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:41,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:18:41,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 02:18:41,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-11-09 02:18:41,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 104 states have internal predecessors, (142), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:18:41,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 176 transitions. [2024-11-09 02:18:41,335 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 176 transitions. Word has length 143 [2024-11-09 02:18:41,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:41,335 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 176 transitions. [2024-11-09 02:18:41,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:18:41,336 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 176 transitions. [2024-11-09 02:18:41,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 02:18:41,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:41,337 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:41,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:18:41,338 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:41,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:41,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1960908792, now seen corresponding path program 1 times [2024-11-09 02:18:41,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:41,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874966975] [2024-11-09 02:18:41,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:41,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:43,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:43,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:43,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:43,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:43,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:43,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:43,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:43,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:43,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:18:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:43,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:18:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:43,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:43,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:18:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:43,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:18:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:43,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:43,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:18:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:43,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:18:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:43,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:18:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:18:43,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:43,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874966975] [2024-11-09 02:18:43,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874966975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:43,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:43,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 02:18:43,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088780355] [2024-11-09 02:18:43,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:43,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 02:18:43,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:43,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 02:18:43,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:18:43,972 INFO L87 Difference]: Start difference. First operand 123 states and 176 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:18:45,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:45,108 INFO L93 Difference]: Finished difference Result 307 states and 440 transitions. [2024-11-09 02:18:45,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:18:45,110 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-11-09 02:18:45,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:45,112 INFO L225 Difference]: With dead ends: 307 [2024-11-09 02:18:45,113 INFO L226 Difference]: Without dead ends: 187 [2024-11-09 02:18:45,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:18:45,114 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 391 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:45,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 548 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 02:18:45,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-09 02:18:45,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 141. [2024-11-09 02:18:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 122 states have internal predecessors, (169), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:18:45,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 203 transitions. [2024-11-09 02:18:45,148 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 203 transitions. Word has length 143 [2024-11-09 02:18:45,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:45,149 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 203 transitions. [2024-11-09 02:18:45,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:18:45,149 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 203 transitions. [2024-11-09 02:18:45,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 02:18:45,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:45,151 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:45,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:18:45,151 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:45,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:45,152 INFO L85 PathProgramCache]: Analyzing trace with hash 163957603, now seen corresponding path program 1 times [2024-11-09 02:18:45,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:45,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920938691] [2024-11-09 02:18:45,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:45,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:47,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:47,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:47,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:47,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:47,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:47,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:47,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:47,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:47,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:18:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:47,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:18:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:47,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:47,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:18:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:47,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:18:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:47,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:47,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:18:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:47,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:18:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:47,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:18:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:18:47,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:47,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920938691] [2024-11-09 02:18:47,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920938691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:47,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:47,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 02:18:47,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461515929] [2024-11-09 02:18:47,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:47,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 02:18:47,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:47,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 02:18:47,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:18:47,891 INFO L87 Difference]: Start difference. First operand 141 states and 203 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:18:48,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:48,806 INFO L93 Difference]: Finished difference Result 339 states and 488 transitions. [2024-11-09 02:18:48,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:18:48,807 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2024-11-09 02:18:48,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:48,809 INFO L225 Difference]: With dead ends: 339 [2024-11-09 02:18:48,809 INFO L226 Difference]: Without dead ends: 201 [2024-11-09 02:18:48,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:18:48,811 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 359 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:48,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 399 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 02:18:48,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-09 02:18:48,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 139. [2024-11-09 02:18:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 120 states have internal predecessors, (166), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:18:48,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 200 transitions. [2024-11-09 02:18:48,846 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 200 transitions. Word has length 145 [2024-11-09 02:18:48,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:48,847 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 200 transitions. [2024-11-09 02:18:48,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:18:48,847 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 200 transitions. [2024-11-09 02:18:48,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 02:18:48,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:48,851 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:48,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:18:48,851 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:48,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:48,852 INFO L85 PathProgramCache]: Analyzing trace with hash -224934086, now seen corresponding path program 1 times [2024-11-09 02:18:48,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:48,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656658887] [2024-11-09 02:18:48,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:48,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:49,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:49,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:49,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:49,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:49,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:49,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:49,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:49,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:49,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:18:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:49,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:18:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:49,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:49,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:18:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:49,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:18:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:49,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:49,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:18:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:49,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:18:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:49,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:18:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:18:49,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:49,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656658887] [2024-11-09 02:18:49,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656658887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:49,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:49,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:18:49,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899895512] [2024-11-09 02:18:49,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:49,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:18:49,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:49,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:18:49,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:18:49,117 INFO L87 Difference]: Start difference. First operand 139 states and 200 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:18:49,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:49,157 INFO L93 Difference]: Finished difference Result 278 states and 401 transitions. [2024-11-09 02:18:49,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:18:49,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-11-09 02:18:49,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:49,159 INFO L225 Difference]: With dead ends: 278 [2024-11-09 02:18:49,159 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 02:18:49,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:18:49,160 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:49,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 643 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:18:49,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 02:18:49,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-09 02:18:49,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 123 states have (on average 1.3739837398373984) internal successors, (169), 123 states have internal predecessors, (169), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:18:49,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 203 transitions. [2024-11-09 02:18:49,179 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 203 transitions. Word has length 145 [2024-11-09 02:18:49,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:49,179 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 203 transitions. [2024-11-09 02:18:49,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:18:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 203 transitions. [2024-11-09 02:18:49,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 02:18:49,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:49,181 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:49,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 02:18:49,182 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:49,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:49,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1744053021, now seen corresponding path program 1 times [2024-11-09 02:18:49,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:49,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902175394] [2024-11-09 02:18:49,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:49,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:51,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:51,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:51,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:51,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:51,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:51,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:51,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:51,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:51,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:18:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:51,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:18:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:51,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:51,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:18:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:51,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:18:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:51,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:51,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:18:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:51,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:18:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:51,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:18:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:51,351 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:18:51,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:51,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902175394] [2024-11-09 02:18:51,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902175394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:51,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:51,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:18:51,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802660327] [2024-11-09 02:18:51,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:51,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:18:51,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:51,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:18:51,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:18:51,354 INFO L87 Difference]: Start difference. First operand 142 states and 203 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:18:52,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:52,232 INFO L93 Difference]: Finished difference Result 364 states and 521 transitions. [2024-11-09 02:18:52,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:18:52,232 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2024-11-09 02:18:52,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:52,234 INFO L225 Difference]: With dead ends: 364 [2024-11-09 02:18:52,234 INFO L226 Difference]: Without dead ends: 225 [2024-11-09 02:18:52,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:18:52,235 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 545 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:52,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 399 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 02:18:52,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-09 02:18:52,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 146. [2024-11-09 02:18:52,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 127 states have (on average 1.3779527559055118) internal successors, (175), 127 states have internal predecessors, (175), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:18:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 209 transitions. [2024-11-09 02:18:52,254 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 209 transitions. Word has length 145 [2024-11-09 02:18:52,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:52,255 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 209 transitions. [2024-11-09 02:18:52,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:18:52,255 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 209 transitions. [2024-11-09 02:18:52,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 02:18:52,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:52,256 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:52,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 02:18:52,257 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:52,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:52,257 INFO L85 PathProgramCache]: Analyzing trace with hash 885375514, now seen corresponding path program 1 times [2024-11-09 02:18:52,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:52,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924239868] [2024-11-09 02:18:52,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:52,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:53,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:53,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:53,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:53,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:53,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:53,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:53,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:53,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:53,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:18:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:53,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:18:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:53,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:53,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:18:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:53,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:18:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:53,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:53,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:18:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:53,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:18:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:53,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:18:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:18:53,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:53,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924239868] [2024-11-09 02:18:53,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924239868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:53,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:53,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:18:53,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071618979] [2024-11-09 02:18:53,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:53,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:18:53,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:53,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:18:53,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:18:53,910 INFO L87 Difference]: Start difference. First operand 146 states and 209 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:18:54,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:54,625 INFO L93 Difference]: Finished difference Result 352 states and 502 transitions. [2024-11-09 02:18:54,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:18:54,626 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2024-11-09 02:18:54,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:54,627 INFO L225 Difference]: With dead ends: 352 [2024-11-09 02:18:54,627 INFO L226 Difference]: Without dead ends: 209 [2024-11-09 02:18:54,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:18:54,628 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 560 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:54,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 513 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:18:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-09 02:18:54,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 163. [2024-11-09 02:18:54,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 144 states have (on average 1.4027777777777777) internal successors, (202), 144 states have internal predecessors, (202), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:18:54,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 236 transitions. [2024-11-09 02:18:54,645 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 236 transitions. Word has length 146 [2024-11-09 02:18:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:54,646 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 236 transitions. [2024-11-09 02:18:54,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:18:54,646 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 236 transitions. [2024-11-09 02:18:54,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 02:18:54,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:54,648 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:54,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 02:18:54,648 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:54,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:54,649 INFO L85 PathProgramCache]: Analyzing trace with hash 143086974, now seen corresponding path program 1 times [2024-11-09 02:18:54,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:54,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197796595] [2024-11-09 02:18:54,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:54,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:56,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:56,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:56,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:56,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:56,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:56,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:56,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:56,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:56,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:18:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:56,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:18:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:56,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:56,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:18:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:56,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:18:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:56,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:56,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:18:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:56,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:18:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:56,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:18:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:57,014 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:18:57,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:57,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197796595] [2024-11-09 02:18:57,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197796595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:57,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:57,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 02:18:57,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312067536] [2024-11-09 02:18:57,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:57,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 02:18:57,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:57,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 02:18:57,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:18:57,017 INFO L87 Difference]: Start difference. First operand 163 states and 236 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:18:57,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:57,819 INFO L93 Difference]: Finished difference Result 329 states and 476 transitions. [2024-11-09 02:18:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:18:57,819 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2024-11-09 02:18:57,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:57,822 INFO L225 Difference]: With dead ends: 329 [2024-11-09 02:18:57,822 INFO L226 Difference]: Without dead ends: 169 [2024-11-09 02:18:57,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:18:57,823 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 280 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:57,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 390 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:18:57,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-09 02:18:57,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 147. [2024-11-09 02:18:57,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 128 states have (on average 1.3828125) internal successors, (177), 128 states have internal predecessors, (177), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:18:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 211 transitions. [2024-11-09 02:18:57,840 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 211 transitions. Word has length 147 [2024-11-09 02:18:57,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:57,840 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 211 transitions. [2024-11-09 02:18:57,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:18:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 211 transitions. [2024-11-09 02:18:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 02:18:57,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:57,843 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:57,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 02:18:57,843 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:57,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:57,844 INFO L85 PathProgramCache]: Analyzing trace with hash 945808159, now seen corresponding path program 1 times [2024-11-09 02:18:57,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:57,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967534858] [2024-11-09 02:18:57,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:57,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:58,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:58,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:58,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:58,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:58,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:58,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:58,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:58,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:58,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:18:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:58,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:18:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:58,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:58,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:18:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:58,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:18:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:58,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:58,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:18:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:58,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:18:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:58,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:18:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:58,596 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:18:58,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:58,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967534858] [2024-11-09 02:18:58,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967534858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:58,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:58,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:18:58,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100017463] [2024-11-09 02:18:58,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:58,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:18:58,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:58,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:18:58,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:18:58,598 INFO L87 Difference]: Start difference. First operand 147 states and 211 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:18:58,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:58,873 INFO L93 Difference]: Finished difference Result 436 states and 628 transitions. [2024-11-09 02:18:58,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:18:58,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2024-11-09 02:18:58,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:58,876 INFO L225 Difference]: With dead ends: 436 [2024-11-09 02:18:58,876 INFO L226 Difference]: Without dead ends: 292 [2024-11-09 02:18:58,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:18:58,877 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 137 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:58,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 379 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:18:58,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-09 02:18:58,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 233. [2024-11-09 02:18:58,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 196 states have (on average 1.3520408163265305) internal successors, (265), 196 states have internal predecessors, (265), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 02:18:58,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 333 transitions. [2024-11-09 02:18:58,909 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 333 transitions. Word has length 147 [2024-11-09 02:18:58,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:58,909 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 333 transitions. [2024-11-09 02:18:58,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:18:58,910 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 333 transitions. [2024-11-09 02:18:58,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 02:18:58,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:58,911 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:58,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 02:18:58,912 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:58,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:58,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1270086649, now seen corresponding path program 1 times [2024-11-09 02:18:58,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:58,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124650686] [2024-11-09 02:18:58,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:58,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:18:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:18:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:18:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:18:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:18:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:18:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:18:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:18:59,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:59,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124650686] [2024-11-09 02:18:59,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124650686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:59,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:59,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:18:59,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668974015] [2024-11-09 02:18:59,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:59,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:18:59,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:59,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:18:59,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:18:59,324 INFO L87 Difference]: Start difference. First operand 233 states and 333 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:18:59,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:59,533 INFO L93 Difference]: Finished difference Result 418 states and 595 transitions. [2024-11-09 02:18:59,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:18:59,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-09 02:18:59,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:59,537 INFO L225 Difference]: With dead ends: 418 [2024-11-09 02:18:59,537 INFO L226 Difference]: Without dead ends: 274 [2024-11-09 02:18:59,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 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-09 02:18:59,538 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 43 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:59,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 523 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:18:59,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-09 02:18:59,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 238. [2024-11-09 02:18:59,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 201 states have (on average 1.3532338308457712) internal successors, (272), 201 states have internal predecessors, (272), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 02:18:59,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 340 transitions. [2024-11-09 02:18:59,571 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 340 transitions. Word has length 151 [2024-11-09 02:18:59,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:59,572 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 340 transitions. [2024-11-09 02:18:59,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:18:59,572 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 340 transitions. [2024-11-09 02:18:59,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 02:18:59,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:59,574 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:59,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 02:18:59,575 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:59,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:59,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1488941367, now seen corresponding path program 1 times [2024-11-09 02:18:59,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:59,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295378105] [2024-11-09 02:18:59,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:59,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:19:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:19:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:19:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:19:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:19:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:19:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:19:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:19:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:19:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:19:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:19:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:19:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:19:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:19:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:19:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:19:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:19:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,169 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:19:00,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:19:00,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295378105] [2024-11-09 02:19:00,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295378105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:19:00,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:19:00,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:19:00,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792507967] [2024-11-09 02:19:00,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:19:00,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:19:00,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:19:00,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:19:00,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:19:00,172 INFO L87 Difference]: Start difference. First operand 238 states and 340 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:19:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:19:00,558 INFO L93 Difference]: Finished difference Result 449 states and 639 transitions. [2024-11-09 02:19:00,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:19:00,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-09 02:19:00,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:19:00,561 INFO L225 Difference]: With dead ends: 449 [2024-11-09 02:19:00,561 INFO L226 Difference]: Without dead ends: 300 [2024-11-09 02:19:00,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:19:00,564 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 120 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:19:00,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 638 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:19:00,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-09 02:19:00,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 244. [2024-11-09 02:19:00,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 207 states have (on average 1.3429951690821256) internal successors, (278), 207 states have internal predecessors, (278), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 02:19:00,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 346 transitions. [2024-11-09 02:19:00,595 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 346 transitions. Word has length 151 [2024-11-09 02:19:00,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:19:00,596 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 346 transitions. [2024-11-09 02:19:00,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:19:00,597 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 346 transitions. [2024-11-09 02:19:00,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 02:19:00,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:19:00,598 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:19:00,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 02:19:00,599 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:19:00,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:19:00,599 INFO L85 PathProgramCache]: Analyzing trace with hash -541227323, now seen corresponding path program 1 times [2024-11-09 02:19:00,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:19:00,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982421353] [2024-11-09 02:19:00,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:19:00,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:19:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:02,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:19:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:02,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:19:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:02,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:19:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:02,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:19:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:02,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:19:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:02,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:19:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:02,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:19:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:02,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:19:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:02,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:19:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:02,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:19:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:02,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:19:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:02,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:19:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:02,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:19:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:02,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:19:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:02,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:19:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:02,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:19:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:02,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:19:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:02,827 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:19:02,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:19:02,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982421353] [2024-11-09 02:19:02,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982421353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:19:02,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:19:02,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:19:02,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679265098] [2024-11-09 02:19:02,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:19:02,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:19:02,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:19:02,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:19:02,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:19:02,829 INFO L87 Difference]: Start difference. First operand 244 states and 346 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:19:03,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:19:03,672 INFO L93 Difference]: Finished difference Result 473 states and 670 transitions. [2024-11-09 02:19:03,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:19:03,673 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 152 [2024-11-09 02:19:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:19:03,675 INFO L225 Difference]: With dead ends: 473 [2024-11-09 02:19:03,675 INFO L226 Difference]: Without dead ends: 324 [2024-11-09 02:19:03,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:19:03,678 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 527 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 02:19:03,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 492 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 02:19:03,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-09 02:19:03,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 240. [2024-11-09 02:19:03,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 203 states have (on average 1.3399014778325122) internal successors, (272), 203 states have internal predecessors, (272), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 02:19:03,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 340 transitions. [2024-11-09 02:19:03,707 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 340 transitions. Word has length 152 [2024-11-09 02:19:03,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:19:03,708 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 340 transitions. [2024-11-09 02:19:03,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:19:03,708 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 340 transitions. [2024-11-09 02:19:03,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 02:19:03,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:19:03,711 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:19:03,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 02:19:03,711 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:19:03,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:19:03,712 INFO L85 PathProgramCache]: Analyzing trace with hash 422808358, now seen corresponding path program 1 times [2024-11-09 02:19:03,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:19:03,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405989850] [2024-11-09 02:19:03,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:19:03,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:19:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:06,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:19:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:06,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:19:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:06,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:19:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:06,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:19:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:06,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:19:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:06,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:19:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:06,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:19:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:06,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:19:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:06,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:19:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:06,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:19:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:06,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:19:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:06,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:19:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:06,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:19:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:06,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:19:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:06,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:19:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:06,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:19:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:06,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:19:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:19:06,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:19:06,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405989850] [2024-11-09 02:19:06,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405989850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:19:06,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:19:06,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 02:19:06,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869677471] [2024-11-09 02:19:06,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:19:06,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 02:19:06,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:19:06,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 02:19:06,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:19:06,395 INFO L87 Difference]: Start difference. First operand 240 states and 340 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-09 02:19:07,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:19:07,419 INFO L93 Difference]: Finished difference Result 473 states and 667 transitions. [2024-11-09 02:19:07,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:19:07,420 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 152 [2024-11-09 02:19:07,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:19:07,423 INFO L225 Difference]: With dead ends: 473 [2024-11-09 02:19:07,423 INFO L226 Difference]: Without dead ends: 326 [2024-11-09 02:19:07,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-11-09 02:19:07,425 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 426 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 02:19:07,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 542 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 02:19:07,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-09 02:19:07,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 297. [2024-11-09 02:19:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 260 states have (on average 1.3461538461538463) internal successors, (350), 260 states have internal predecessors, (350), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 02:19:07,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 418 transitions. [2024-11-09 02:19:07,485 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 418 transitions. Word has length 152 [2024-11-09 02:19:07,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:19:07,485 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 418 transitions. [2024-11-09 02:19:07,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-09 02:19:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 418 transitions. [2024-11-09 02:19:07,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 02:19:07,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:19:07,488 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:19:07,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 02:19:07,488 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:19:07,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:19:07,489 INFO L85 PathProgramCache]: Analyzing trace with hash 705062213, now seen corresponding path program 1 times [2024-11-09 02:19:07,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:19:07,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574596705] [2024-11-09 02:19:07,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:19:07,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:19:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:09,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:19:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:09,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:19:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:09,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:19:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:09,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:19:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:09,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:19:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:09,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:19:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:09,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:19:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:09,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:19:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:09,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:19:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:09,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:19:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:09,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:19:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:09,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:19:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:09,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:19:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:09,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:19:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:09,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:19:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:09,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:19:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:09,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:19:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:19:09,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:19:09,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574596705] [2024-11-09 02:19:09,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574596705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:19:09,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:19:09,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:19:09,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441729131] [2024-11-09 02:19:09,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:19:09,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:19:09,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:19:09,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:19:09,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:19:09,299 INFO L87 Difference]: Start difference. First operand 297 states and 418 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:19:09,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:19:09,922 INFO L93 Difference]: Finished difference Result 665 states and 941 transitions. [2024-11-09 02:19:09,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:19:09,923 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-09 02:19:09,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:19:09,925 INFO L225 Difference]: With dead ends: 665 [2024-11-09 02:19:09,925 INFO L226 Difference]: Without dead ends: 473 [2024-11-09 02:19:09,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:19:09,927 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 322 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:19:09,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 568 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:19:09,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-09 02:19:09,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 305. [2024-11-09 02:19:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 268 states have (on average 1.3507462686567164) internal successors, (362), 268 states have internal predecessors, (362), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 02:19:09,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 430 transitions. [2024-11-09 02:19:09,963 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 430 transitions. Word has length 152 [2024-11-09 02:19:09,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:19:09,963 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 430 transitions. [2024-11-09 02:19:09,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:19:09,964 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 430 transitions. [2024-11-09 02:19:09,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-09 02:19:09,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:19:09,965 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:19:09,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 02:19:09,965 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:19:09,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:19:09,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1628395318, now seen corresponding path program 1 times [2024-11-09 02:19:09,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:19:09,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413877944] [2024-11-09 02:19:09,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:19:09,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:19:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:12,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:19:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:12,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:19:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:12,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:19:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:12,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:19:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:12,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:19:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:12,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:19:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:12,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:19:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:12,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:19:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:12,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:19:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:12,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:19:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:12,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:19:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:12,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:19:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:12,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:19:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:12,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:19:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:12,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:19:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:12,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:19:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:12,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:19:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:12,351 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:19:12,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:19:12,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413877944] [2024-11-09 02:19:12,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413877944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:19:12,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:19:12,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:19:12,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266823104] [2024-11-09 02:19:12,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:19:12,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:19:12,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:19:12,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:19:12,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:19:12,354 INFO L87 Difference]: Start difference. First operand 305 states and 430 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:19:13,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:19:13,233 INFO L93 Difference]: Finished difference Result 501 states and 714 transitions. [2024-11-09 02:19:13,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:19:13,235 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2024-11-09 02:19:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:19:13,236 INFO L225 Difference]: With dead ends: 501 [2024-11-09 02:19:13,236 INFO L226 Difference]: Without dead ends: 305 [2024-11-09 02:19:13,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:19:13,238 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 269 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 02:19:13,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 522 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 02:19:13,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-09 02:19:13,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 245. [2024-11-09 02:19:13,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 208 states have (on average 1.3173076923076923) internal successors, (274), 208 states have internal predecessors, (274), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 02:19:13,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 342 transitions. [2024-11-09 02:19:13,278 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 342 transitions. Word has length 154 [2024-11-09 02:19:13,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:19:13,279 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 342 transitions. [2024-11-09 02:19:13,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:19:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 342 transitions. [2024-11-09 02:19:13,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-09 02:19:13,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:19:13,281 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:19:13,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 02:19:13,282 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:19:13,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:19:13,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1686606453, now seen corresponding path program 1 times [2024-11-09 02:19:13,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:19:13,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653059989] [2024-11-09 02:19:13,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:19:13,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:19:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:13,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:19:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:13,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:19:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:13,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:19:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:13,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:19:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:13,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:19:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:13,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:19:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:13,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:19:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:13,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:19:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:13,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:19:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:13,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:19:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:13,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:19:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:13,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:19:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:13,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:19:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:13,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:19:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:13,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:19:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:13,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:19:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:13,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:19:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:13,396 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:19:13,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:19:13,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653059989] [2024-11-09 02:19:13,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653059989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:19:13,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:19:13,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:19:13,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822967219] [2024-11-09 02:19:13,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:19:13,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:19:13,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:19:13,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:19:13,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:19:13,399 INFO L87 Difference]: Start difference. First operand 245 states and 342 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:19:13,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:19:13,441 INFO L93 Difference]: Finished difference Result 406 states and 571 transitions. [2024-11-09 02:19:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:19:13,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2024-11-09 02:19:13,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:19:13,443 INFO L225 Difference]: With dead ends: 406 [2024-11-09 02:19:13,443 INFO L226 Difference]: Without dead ends: 247 [2024-11-09 02:19:13,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:19:13,444 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:19:13,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 324 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:19:13,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-09 02:19:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-11-09 02:19:13,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 210 states have (on average 1.3142857142857143) internal successors, (276), 210 states have internal predecessors, (276), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 02:19:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 344 transitions. [2024-11-09 02:19:13,478 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 344 transitions. Word has length 154 [2024-11-09 02:19:13,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:19:13,478 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 344 transitions. [2024-11-09 02:19:13,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:19:13,479 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 344 transitions. [2024-11-09 02:19:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-09 02:19:13,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:19:13,480 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:19:13,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 02:19:13,480 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:19:13,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:19:13,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1541026190, now seen corresponding path program 1 times [2024-11-09 02:19:13,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:19:13,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537558545] [2024-11-09 02:19:13,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:19:13,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:19:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:15,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:19:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:15,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:19:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:15,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:19:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:15,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:19:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:15,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:19:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:15,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:19:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:15,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:19:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:15,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:19:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:15,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:19:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:15,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:19:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:15,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:19:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:15,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:19:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:15,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:19:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:15,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:19:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:15,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:19:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:15,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:19:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:15,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:19:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:15,557 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:19:15,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:19:15,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537558545] [2024-11-09 02:19:15,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537558545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:19:15,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:19:15,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 02:19:15,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492437189] [2024-11-09 02:19:15,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:19:15,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 02:19:15,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:19:15,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 02:19:15,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:19:15,560 INFO L87 Difference]: Start difference. First operand 247 states and 344 transitions. Second operand has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-09 02:19:16,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:19:16,355 INFO L93 Difference]: Finished difference Result 252 states and 349 transitions. [2024-11-09 02:19:16,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:19:16,356 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 154 [2024-11-09 02:19:16,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:19:16,358 INFO L225 Difference]: With dead ends: 252 [2024-11-09 02:19:16,358 INFO L226 Difference]: Without dead ends: 250 [2024-11-09 02:19:16,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-09 02:19:16,359 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 364 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:19:16,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 482 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:19:16,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-09 02:19:16,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2024-11-09 02:19:16,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 213 states have (on average 1.3098591549295775) internal successors, (279), 213 states have internal predecessors, (279), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 02:19:16,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 347 transitions. [2024-11-09 02:19:16,409 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 347 transitions. Word has length 154 [2024-11-09 02:19:16,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:19:16,410 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 347 transitions. [2024-11-09 02:19:16,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-09 02:19:16,410 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 347 transitions. [2024-11-09 02:19:16,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-09 02:19:16,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:19:16,412 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:19:16,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 02:19:16,412 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:19:16,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:19:16,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1539179148, now seen corresponding path program 1 times [2024-11-09 02:19:16,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:19:16,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027109700] [2024-11-09 02:19:16,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:19:16,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:19:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:19,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:19:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:19,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:19:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:19,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:19:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:19,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:19:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:19,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:19:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:19,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:19:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:19,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:19:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:19,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:19:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:19,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:19:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:19,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:19:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:19,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:19:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:19,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:19:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:19,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:19:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:19,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:19:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:19,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:19:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:19,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:19:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:19,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:19:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:19,273 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-09 02:19:19,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:19:19,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027109700] [2024-11-09 02:19:19,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027109700] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:19:19,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781850699] [2024-11-09 02:19:19,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:19:19,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:19:19,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:19:19,278 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:19:19,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 02:19:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:19,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-09 02:19:19,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:19:20,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2024-11-09 02:19:20,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 85 [2024-11-09 02:19:21,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 85 [2024-11-09 02:19:22,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 85 [2024-11-09 02:19:23,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 85 [2024-11-09 02:19:24,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 85 [2024-11-09 02:19:25,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 85 [2024-11-09 02:19:27,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 99 [2024-11-09 02:19:28,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 99 [2024-11-09 02:19:29,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 99 [2024-11-09 02:19:30,305 INFO L349 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2024-11-09 02:19:30,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 111 [2024-11-09 02:19:31,879 INFO L349 Elim1Store]: treesize reduction 141, result has 26.9 percent of original size [2024-11-09 02:19:31,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 511 treesize of output 462 [2024-11-09 02:19:34,308 INFO L349 Elim1Store]: treesize reduction 96, result has 41.8 percent of original size [2024-11-09 02:19:34,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 1177 treesize of output 1225