./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-66.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-s_file-66.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 da17d270b97e746bcc3bb567476dd5627c9f96457d30034078a1fde8f8099861 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:05:31,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:05:31,317 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:05:31,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:05:31,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:05:31,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:05:31,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:05:31,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:05:31,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:05:31,353 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:05:31,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:05:31,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:05:31,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:05:31,354 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:05:31,354 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:05:31,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:05:31,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:05:31,355 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:05:31,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:05:31,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:05:31,357 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:05:31,357 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:05:31,357 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:05:31,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:05:31,358 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:05:31,358 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:05:31,358 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:05:31,358 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:05:31,359 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:05:31,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:05:31,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:05:31,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:05:31,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:05:31,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:05:31,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:05:31,361 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:05:31,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:05:31,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:05:31,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:05:31,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:05:31,362 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:05:31,362 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:05:31,362 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 -> da17d270b97e746bcc3bb567476dd5627c9f96457d30034078a1fde8f8099861 [2024-11-09 02:05:31,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:05:31,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:05:31,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:05:31,636 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:05:31,637 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:05:31,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-66.i [2024-11-09 02:05:33,231 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:05:33,419 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:05:33,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-66.i [2024-11-09 02:05:33,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32a56a280/c7e7e139f4df478a8128af492808f043/FLAGa597e2416 [2024-11-09 02:05:33,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32a56a280/c7e7e139f4df478a8128af492808f043 [2024-11-09 02:05:33,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:05:33,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:05:33,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:05:33,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:05:33,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:05:33,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:05:33" (1/1) ... [2024-11-09 02:05:33,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b65f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:33, skipping insertion in model container [2024-11-09 02:05:33,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:05:33" (1/1) ... [2024-11-09 02:05:33,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:05:33,638 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-s_file-66.i[916,929] [2024-11-09 02:05:33,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:05:33,709 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:05:33,719 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-s_file-66.i[916,929] [2024-11-09 02:05:33,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:05:33,793 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:05:33,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:33 WrapperNode [2024-11-09 02:05:33,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:05:33,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:05:33,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:05:33,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:05:33,811 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:05:33" (1/1) ... [2024-11-09 02:05:33,831 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:05:33" (1/1) ... [2024-11-09 02:05:33,877 INFO L138 Inliner]: procedures = 27, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 427 [2024-11-09 02:05:33,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:05:33,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:05:33,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:05:33,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:05:33,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:33" (1/1) ... [2024-11-09 02:05:33,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:33" (1/1) ... [2024-11-09 02:05:33,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:33" (1/1) ... [2024-11-09 02:05:33,908 INFO L175 MemorySlicer]: Split 124 memory accesses to 2 slices as follows [2, 122]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2024-11-09 02:05:33,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:33" (1/1) ... [2024-11-09 02:05:33,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:33" (1/1) ... [2024-11-09 02:05:33,921 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:33" (1/1) ... [2024-11-09 02:05:33,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:33" (1/1) ... [2024-11-09 02:05:33,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:33" (1/1) ... [2024-11-09 02:05:33,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:33" (1/1) ... [2024-11-09 02:05:33,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:05:33,934 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:05:33,935 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:05:33,935 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:05:33,935 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:33" (1/1) ... [2024-11-09 02:05:33,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:05:33,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:05:33,976 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:05:33,985 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:05:34,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:05:34,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-09 02:05:34,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-09 02:05:34,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 02:05:34,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 02:05:34,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 02:05:34,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 02:05:34,023 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:05:34,023 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:05:34,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 02:05:34,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 02:05:34,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:05:34,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:05:34,120 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:05:34,122 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:05:34,477 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-09 02:05:34,477 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:05:34,498 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:05:34,502 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:05:34,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:05:34 BoogieIcfgContainer [2024-11-09 02:05:34,503 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:05:34,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:05:34,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:05:34,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:05:34,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:05:33" (1/3) ... [2024-11-09 02:05:34,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b7f5c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:05:34, skipping insertion in model container [2024-11-09 02:05:34,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:33" (2/3) ... [2024-11-09 02:05:34,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b7f5c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:05:34, skipping insertion in model container [2024-11-09 02:05:34,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:05:34" (3/3) ... [2024-11-09 02:05:34,514 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-66.i [2024-11-09 02:05:34,529 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:05:34,529 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:05:34,585 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:05:34,600 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;@1de47a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:05:34,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:05:34,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 70 states have internal predecessors, (97), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:05:34,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 02:05:34,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:34,620 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:34,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:34,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:34,627 INFO L85 PathProgramCache]: Analyzing trace with hash -966320857, now seen corresponding path program 1 times [2024-11-09 02:05:34,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:34,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887340073] [2024-11-09 02:05:34,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:34,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:05:35,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:35,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887340073] [2024-11-09 02:05:35,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887340073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:35,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:35,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:05:35,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581161952] [2024-11-09 02:05:35,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:35,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:05:35,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:35,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:05:35,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:05:35,202 INFO L87 Difference]: Start difference. First operand has 86 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 70 states have internal predecessors, (97), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:05:35,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:35,259 INFO L93 Difference]: Finished difference Result 168 states and 262 transitions. [2024-11-09 02:05:35,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:05:35,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2024-11-09 02:05:35,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:35,269 INFO L225 Difference]: With dead ends: 168 [2024-11-09 02:05:35,269 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 02:05:35,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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:05:35,276 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 334 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:05:35,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 334 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:05:35,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 02:05:35,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2024-11-09 02:05:35,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:05:35,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2024-11-09 02:05:35,322 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 109 [2024-11-09 02:05:35,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:35,325 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2024-11-09 02:05:35,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:05:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2024-11-09 02:05:35,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 02:05:35,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:35,329 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:35,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:05:35,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:35,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:35,330 INFO L85 PathProgramCache]: Analyzing trace with hash 808686505, now seen corresponding path program 1 times [2024-11-09 02:05:35,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:35,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298328262] [2024-11-09 02:05:35,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:35,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:05:35,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:35,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298328262] [2024-11-09 02:05:35,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298328262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:35,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:35,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:05:35,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939764819] [2024-11-09 02:05:35,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:35,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:05:35,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:35,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:05:35,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:05:35,561 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:05:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:35,604 INFO L93 Difference]: Finished difference Result 168 states and 241 transitions. [2024-11-09 02:05:35,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:05:35,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2024-11-09 02:05:35,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:35,607 INFO L225 Difference]: With dead ends: 168 [2024-11-09 02:05:35,607 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 02:05:35,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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:05:35,612 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 337 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:05:35,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 337 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:05:35,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 02:05:35,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-11-09 02:05:35,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:05:35,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2024-11-09 02:05:35,625 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 109 [2024-11-09 02:05:35,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:35,625 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2024-11-09 02:05:35,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:05:35,626 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2024-11-09 02:05:35,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 02:05:35,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:35,627 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:35,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:05:35,627 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:35,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:35,628 INFO L85 PathProgramCache]: Analyzing trace with hash 810533547, now seen corresponding path program 1 times [2024-11-09 02:05:35,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:35,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722128748] [2024-11-09 02:05:35,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:35,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:36,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:36,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:36,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:36,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:36,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:36,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:36,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:36,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:36,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:36,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:36,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:36,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:36,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:36,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:36,518 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:05:36,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:36,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722128748] [2024-11-09 02:05:36,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722128748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:36,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:36,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:05:36,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009729388] [2024-11-09 02:05:36,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:36,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:05:36,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:36,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:05:36,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:05:36,525 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:05:36,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:36,783 INFO L93 Difference]: Finished difference Result 252 states and 360 transitions. [2024-11-09 02:05:36,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:05:36,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2024-11-09 02:05:36,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:36,786 INFO L225 Difference]: With dead ends: 252 [2024-11-09 02:05:36,786 INFO L226 Difference]: Without dead ends: 169 [2024-11-09 02:05:36,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:05:36,788 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 75 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:36,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 273 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:05:36,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-09 02:05:36,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2024-11-09 02:05:36,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 130 states have (on average 1.3307692307692307) internal successors, (173), 130 states have internal predecessors, (173), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 02:05:36,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 229 transitions. [2024-11-09 02:05:36,803 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 229 transitions. Word has length 109 [2024-11-09 02:05:36,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:36,804 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 229 transitions. [2024-11-09 02:05:36,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:05:36,804 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 229 transitions. [2024-11-09 02:05:36,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 02:05:36,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:36,806 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:36,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:05:36,806 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:36,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:36,806 INFO L85 PathProgramCache]: Analyzing trace with hash -119975266, now seen corresponding path program 1 times [2024-11-09 02:05:36,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:36,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418722351] [2024-11-09 02:05:36,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:36,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:39,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:39,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:39,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:39,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:39,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:39,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:39,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:39,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:39,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:39,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:39,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:39,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:39,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:39,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:05:39,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:39,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418722351] [2024-11-09 02:05:39,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418722351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:39,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:39,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:05:39,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527142666] [2024-11-09 02:05:39,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:39,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:05:39,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:39,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:05:39,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:05:39,187 INFO L87 Difference]: Start difference. First operand 161 states and 229 transitions. Second operand has 10 states, 7 states have (on average 6.142857142857143) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-09 02:05:39,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:39,614 INFO L93 Difference]: Finished difference Result 403 states and 575 transitions. [2024-11-09 02:05:39,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 02:05:39,614 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 6.142857142857143) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 110 [2024-11-09 02:05:39,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:39,616 INFO L225 Difference]: With dead ends: 403 [2024-11-09 02:05:39,616 INFO L226 Difference]: Without dead ends: 245 [2024-11-09 02:05:39,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:05:39,617 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 50 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:39,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 570 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:05:39,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-09 02:05:39,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 177. [2024-11-09 02:05:39,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 146 states have (on average 1.3424657534246576) internal successors, (196), 146 states have internal predecessors, (196), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 02:05:39,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 252 transitions. [2024-11-09 02:05:39,635 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 252 transitions. Word has length 110 [2024-11-09 02:05:39,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:39,636 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 252 transitions. [2024-11-09 02:05:39,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 6.142857142857143) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-09 02:05:39,636 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 252 transitions. [2024-11-09 02:05:39,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 02:05:39,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:39,640 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:39,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:05:39,641 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:39,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:39,641 INFO L85 PathProgramCache]: Analyzing trace with hash -706781280, now seen corresponding path program 1 times [2024-11-09 02:05:39,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:39,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338534944] [2024-11-09 02:05:39,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:39,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:41,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:41,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:41,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:41,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:41,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:41,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:41,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:41,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:41,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:41,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:41,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:41,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:41,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:41,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:41,320 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:05:41,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:41,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338534944] [2024-11-09 02:05:41,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338534944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:41,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:41,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:05:41,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688056127] [2024-11-09 02:05:41,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:41,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:05:41,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:41,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:05:41,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:05:41,323 INFO L87 Difference]: Start difference. First operand 177 states and 252 transitions. Second operand has 10 states, 8 states have (on average 5.375) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 02:05:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:42,694 INFO L93 Difference]: Finished difference Result 422 states and 592 transitions. [2024-11-09 02:05:42,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 02:05:42,699 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.375) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 110 [2024-11-09 02:05:42,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:42,701 INFO L225 Difference]: With dead ends: 422 [2024-11-09 02:05:42,701 INFO L226 Difference]: Without dead ends: 331 [2024-11-09 02:05:42,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-11-09 02:05:42,706 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 292 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:42,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 568 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 02:05:42,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-09 02:05:42,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 261. [2024-11-09 02:05:42,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 224 states have (on average 1.3482142857142858) internal successors, (302), 226 states have internal predecessors, (302), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 02:05:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 366 transitions. [2024-11-09 02:05:42,759 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 366 transitions. Word has length 110 [2024-11-09 02:05:42,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:42,760 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 366 transitions. [2024-11-09 02:05:42,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.375) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 02:05:42,761 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 366 transitions. [2024-11-09 02:05:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 02:05:42,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:42,766 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:42,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:05:42,767 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:42,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:42,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1708323168, now seen corresponding path program 1 times [2024-11-09 02:05:42,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:42,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115681804] [2024-11-09 02:05:42,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:42,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:43,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:43,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:43,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:43,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:43,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:43,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:43,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:43,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:43,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:43,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:43,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:43,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:43,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:43,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:05:43,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:43,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115681804] [2024-11-09 02:05:43,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115681804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:43,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:43,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:05:43,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906721738] [2024-11-09 02:05:43,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:43,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:05:43,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:43,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:05:43,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:05:43,406 INFO L87 Difference]: Start difference. First operand 261 states and 366 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:05:43,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:43,901 INFO L93 Difference]: Finished difference Result 571 states and 784 transitions. [2024-11-09 02:05:43,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:05:43,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2024-11-09 02:05:43,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:43,904 INFO L225 Difference]: With dead ends: 571 [2024-11-09 02:05:43,904 INFO L226 Difference]: Without dead ends: 436 [2024-11-09 02:05:43,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:05:43,910 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 189 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:43,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 255 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:05:43,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-09 02:05:43,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 292. [2024-11-09 02:05:43,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 245 states have (on average 1.3183673469387756) internal successors, (323), 248 states have internal predecessors, (323), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 02:05:43,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 399 transitions. [2024-11-09 02:05:43,936 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 399 transitions. Word has length 110 [2024-11-09 02:05:43,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:43,937 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 399 transitions. [2024-11-09 02:05:43,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:05:43,937 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 399 transitions. [2024-11-09 02:05:43,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 02:05:43,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:43,939 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:43,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:05:43,939 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:43,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:43,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2079434709, now seen corresponding path program 1 times [2024-11-09 02:05:43,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:43,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413157021] [2024-11-09 02:05:43,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:43,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,421 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:05:44,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:44,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413157021] [2024-11-09 02:05:44,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413157021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:44,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:44,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:05:44,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138780648] [2024-11-09 02:05:44,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:44,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:05:44,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:44,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:05:44,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:05:44,423 INFO L87 Difference]: Start difference. First operand 292 states and 399 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:05:44,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:44,580 INFO L93 Difference]: Finished difference Result 566 states and 778 transitions. [2024-11-09 02:05:44,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:05:44,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2024-11-09 02:05:44,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:44,582 INFO L225 Difference]: With dead ends: 566 [2024-11-09 02:05:44,583 INFO L226 Difference]: Without dead ends: 298 [2024-11-09 02:05:44,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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:05:44,584 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 71 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:44,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 222 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:05:44,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-09 02:05:44,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 290. [2024-11-09 02:05:44,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 243 states have (on average 1.308641975308642) internal successors, (318), 246 states have internal predecessors, (318), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 02:05:44,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 394 transitions. [2024-11-09 02:05:44,609 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 394 transitions. Word has length 111 [2024-11-09 02:05:44,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:44,610 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 394 transitions. [2024-11-09 02:05:44,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:05:44,610 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 394 transitions. [2024-11-09 02:05:44,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 02:05:44,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:44,611 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:44,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:05:44,611 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:44,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:44,612 INFO L85 PathProgramCache]: Analyzing trace with hash 977296981, now seen corresponding path program 1 times [2024-11-09 02:05:44,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:44,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027454930] [2024-11-09 02:05:44,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:44,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,012 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:05:45,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:45,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027454930] [2024-11-09 02:05:45,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027454930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:45,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:45,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:05:45,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195625609] [2024-11-09 02:05:45,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:45,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:05:45,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:45,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:05:45,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:05:45,015 INFO L87 Difference]: Start difference. First operand 290 states and 394 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:05:45,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:45,180 INFO L93 Difference]: Finished difference Result 522 states and 711 transitions. [2024-11-09 02:05:45,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:05:45,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2024-11-09 02:05:45,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:45,182 INFO L225 Difference]: With dead ends: 522 [2024-11-09 02:05:45,182 INFO L226 Difference]: Without dead ends: 256 [2024-11-09 02:05:45,183 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:05:45,184 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 74 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:45,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 273 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:05:45,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-09 02:05:45,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 227. [2024-11-09 02:05:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 190 states have (on average 1.305263157894737) internal successors, (248), 191 states have internal predecessors, (248), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 02:05:45,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 308 transitions. [2024-11-09 02:05:45,209 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 308 transitions. Word has length 111 [2024-11-09 02:05:45,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:45,209 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 308 transitions. [2024-11-09 02:05:45,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:05:45,209 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 308 transitions. [2024-11-09 02:05:45,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 02:05:45,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:45,210 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:45,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 02:05:45,211 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:45,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:45,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1213662984, now seen corresponding path program 1 times [2024-11-09 02:05:45,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:45,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992238678] [2024-11-09 02:05:45,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:45,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,770 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:05:45,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:45,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992238678] [2024-11-09 02:05:45,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992238678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:45,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:45,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:05:45,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792081671] [2024-11-09 02:05:45,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:45,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:05:45,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:45,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:05:45,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:05:45,772 INFO L87 Difference]: Start difference. First operand 227 states and 308 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:05:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:46,200 INFO L93 Difference]: Finished difference Result 531 states and 719 transitions. [2024-11-09 02:05:46,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:05:46,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2024-11-09 02:05:46,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:46,202 INFO L225 Difference]: With dead ends: 531 [2024-11-09 02:05:46,203 INFO L226 Difference]: Without dead ends: 390 [2024-11-09 02:05:46,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:05:46,205 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 206 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:46,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 205 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:05:46,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-09 02:05:46,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 233. [2024-11-09 02:05:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 196 states have (on average 1.3112244897959184) internal successors, (257), 197 states have internal predecessors, (257), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 02:05:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 317 transitions. [2024-11-09 02:05:46,223 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 317 transitions. Word has length 112 [2024-11-09 02:05:46,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:46,224 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 317 transitions. [2024-11-09 02:05:46,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:05:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 317 transitions. [2024-11-09 02:05:46,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 02:05:46,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:46,226 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:46,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 02:05:46,226 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:46,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:46,227 INFO L85 PathProgramCache]: Analyzing trace with hash 277271248, now seen corresponding path program 1 times [2024-11-09 02:05:46,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:46,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379998047] [2024-11-09 02:05:46,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:46,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,297 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:05:46,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:46,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379998047] [2024-11-09 02:05:46,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379998047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:46,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:46,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:05:46,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951493538] [2024-11-09 02:05:46,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:46,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:05:46,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:46,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:05:46,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:05:46,298 INFO L87 Difference]: Start difference. First operand 233 states and 317 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:05:46,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:46,325 INFO L93 Difference]: Finished difference Result 466 states and 637 transitions. [2024-11-09 02:05:46,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:05:46,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-09 02:05:46,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:46,327 INFO L225 Difference]: With dead ends: 466 [2024-11-09 02:05:46,328 INFO L226 Difference]: Without dead ends: 236 [2024-11-09 02:05:46,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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:05:46,329 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:46,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:05:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-09 02:05:46,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2024-11-09 02:05:46,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 199 states have (on average 1.306532663316583) internal successors, (260), 200 states have internal predecessors, (260), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 02:05:46,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 320 transitions. [2024-11-09 02:05:46,343 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 320 transitions. Word has length 113 [2024-11-09 02:05:46,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:46,343 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 320 transitions. [2024-11-09 02:05:46,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:05:46,344 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 320 transitions. [2024-11-09 02:05:46,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 02:05:46,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:46,344 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:46,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 02:05:46,345 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:46,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:46,345 INFO L85 PathProgramCache]: Analyzing trace with hash -309534766, now seen corresponding path program 1 times [2024-11-09 02:05:46,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:46,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475707309] [2024-11-09 02:05:46,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:46,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:05:46,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:46,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475707309] [2024-11-09 02:05:46,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475707309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:46,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:46,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:05:46,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581015601] [2024-11-09 02:05:46,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:46,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:05:46,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:46,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:05:46,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:05:46,462 INFO L87 Difference]: Start difference. First operand 236 states and 320 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:05:46,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:46,500 INFO L93 Difference]: Finished difference Result 478 states and 649 transitions. [2024-11-09 02:05:46,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:05:46,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-09 02:05:46,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:46,502 INFO L225 Difference]: With dead ends: 478 [2024-11-09 02:05:46,503 INFO L226 Difference]: Without dead ends: 245 [2024-11-09 02:05:46,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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:05:46,504 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 443 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:05:46,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 443 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:05:46,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-09 02:05:46,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2024-11-09 02:05:46,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 208 states have (on average 1.2932692307692308) internal successors, (269), 209 states have internal predecessors, (269), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 02:05:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 329 transitions. [2024-11-09 02:05:46,518 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 329 transitions. Word has length 113 [2024-11-09 02:05:46,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:46,519 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 329 transitions. [2024-11-09 02:05:46,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:05:46,519 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 329 transitions. [2024-11-09 02:05:46,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 02:05:46,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:46,520 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:46,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 02:05:46,520 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:46,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:46,521 INFO L85 PathProgramCache]: Analyzing trace with hash -919537985, now seen corresponding path program 1 times [2024-11-09 02:05:46,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:46,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718801297] [2024-11-09 02:05:46,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:46,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,208 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:05:47,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:47,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718801297] [2024-11-09 02:05:47,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718801297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:47,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:47,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:05:47,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410775931] [2024-11-09 02:05:47,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:47,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:05:47,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:47,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:05:47,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:05:47,210 INFO L87 Difference]: Start difference. First operand 245 states and 329 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:05:47,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:47,772 INFO L93 Difference]: Finished difference Result 474 states and 639 transitions. [2024-11-09 02:05:47,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:05:47,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2024-11-09 02:05:47,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:47,775 INFO L225 Difference]: With dead ends: 474 [2024-11-09 02:05:47,775 INFO L226 Difference]: Without dead ends: 319 [2024-11-09 02:05:47,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:05:47,776 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 169 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:47,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 337 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:05:47,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-09 02:05:47,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 245. [2024-11-09 02:05:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 208 states have (on average 1.2884615384615385) internal successors, (268), 209 states have internal predecessors, (268), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 02:05:47,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 328 transitions. [2024-11-09 02:05:47,792 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 328 transitions. Word has length 113 [2024-11-09 02:05:47,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:47,793 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 328 transitions. [2024-11-09 02:05:47,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:05:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 328 transitions. [2024-11-09 02:05:47,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 02:05:47,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:47,794 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:47,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 02:05:47,794 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:47,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:47,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1506343999, now seen corresponding path program 1 times [2024-11-09 02:05:47,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:47,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260686385] [2024-11-09 02:05:47,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:47,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:05:48,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:48,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260686385] [2024-11-09 02:05:48,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260686385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:48,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:48,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:05:48,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048974597] [2024-11-09 02:05:48,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:48,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:05:48,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:48,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:05:48,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:05:48,854 INFO L87 Difference]: Start difference. First operand 245 states and 328 transitions. Second operand has 7 states, 5 states have (on average 9.2) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 02:05:49,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:49,124 INFO L93 Difference]: Finished difference Result 437 states and 588 transitions. [2024-11-09 02:05:49,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:05:49,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.2) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2024-11-09 02:05:49,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:49,126 INFO L225 Difference]: With dead ends: 437 [2024-11-09 02:05:49,126 INFO L226 Difference]: Without dead ends: 282 [2024-11-09 02:05:49,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:05:49,127 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 46 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:49,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 607 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:05:49,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-09 02:05:49,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 243. [2024-11-09 02:05:49,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 206 states have (on average 1.2864077669902914) internal successors, (265), 207 states have internal predecessors, (265), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 02:05:49,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 325 transitions. [2024-11-09 02:05:49,150 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 325 transitions. Word has length 113 [2024-11-09 02:05:49,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:49,151 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 325 transitions. [2024-11-09 02:05:49,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.2) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 02:05:49,151 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 325 transitions. [2024-11-09 02:05:49,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 02:05:49,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:49,152 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:49,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 02:05:49,152 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:49,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:49,153 INFO L85 PathProgramCache]: Analyzing trace with hash 452267285, now seen corresponding path program 1 times [2024-11-09 02:05:49,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:49,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193525590] [2024-11-09 02:05:49,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:49,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:49,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:49,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:49,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:49,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:49,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:49,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:49,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:49,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:49,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:49,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:49,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:49,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:49,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:49,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:05:49,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:49,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193525590] [2024-11-09 02:05:49,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193525590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:49,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:49,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:05:49,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634136060] [2024-11-09 02:05:49,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:49,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:05:49,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:49,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:05:49,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:05:49,769 INFO L87 Difference]: Start difference. First operand 243 states and 325 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:05:50,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:50,095 INFO L93 Difference]: Finished difference Result 527 states and 701 transitions. [2024-11-09 02:05:50,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 02:05:50,095 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2024-11-09 02:05:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:50,097 INFO L225 Difference]: With dead ends: 527 [2024-11-09 02:05:50,098 INFO L226 Difference]: Without dead ends: 374 [2024-11-09 02:05:50,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:05:50,099 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 65 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:50,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 515 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:05:50,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-09 02:05:50,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 259. [2024-11-09 02:05:50,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 222 states have (on average 1.2927927927927927) internal successors, (287), 223 states have internal predecessors, (287), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 02:05:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 347 transitions. [2024-11-09 02:05:50,120 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 347 transitions. Word has length 115 [2024-11-09 02:05:50,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:50,121 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 347 transitions. [2024-11-09 02:05:50,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:05:50,121 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 347 transitions. [2024-11-09 02:05:50,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 02:05:50,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:50,122 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:50,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 02:05:50,123 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:50,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:50,123 INFO L85 PathProgramCache]: Analyzing trace with hash -231366615, now seen corresponding path program 1 times [2024-11-09 02:05:50,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:50,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536766040] [2024-11-09 02:05:50,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:50,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:51,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:51,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:51,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:51,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:51,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:51,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:51,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:51,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:51,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:51,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:51,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:51,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:51,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:51,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:05:51,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:51,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536766040] [2024-11-09 02:05:51,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536766040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:51,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:51,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:05:51,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777202455] [2024-11-09 02:05:51,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:51,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:05:51,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:51,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:05:51,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:05:51,201 INFO L87 Difference]: Start difference. First operand 259 states and 347 transitions. Second operand has 10 states, 8 states have (on average 6.0) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 02:05:51,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:51,885 INFO L93 Difference]: Finished difference Result 570 states and 767 transitions. [2024-11-09 02:05:51,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 02:05:51,886 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.0) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2024-11-09 02:05:51,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:51,888 INFO L225 Difference]: With dead ends: 570 [2024-11-09 02:05:51,888 INFO L226 Difference]: Without dead ends: 401 [2024-11-09 02:05:51,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-11-09 02:05:51,889 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 254 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:51,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 472 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:05:51,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-09 02:05:51,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 322. [2024-11-09 02:05:51,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 279 states have (on average 1.3046594982078854) internal successors, (364), 281 states have internal predecessors, (364), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 02:05:51,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 432 transitions. [2024-11-09 02:05:51,909 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 432 transitions. Word has length 115 [2024-11-09 02:05:51,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:51,910 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 432 transitions. [2024-11-09 02:05:51,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.0) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 02:05:51,910 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 432 transitions. [2024-11-09 02:05:51,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 02:05:51,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:51,912 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:51,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 02:05:51,912 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:51,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:51,912 INFO L85 PathProgramCache]: Analyzing trace with hash -972987545, now seen corresponding path program 1 times [2024-11-09 02:05:51,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:51,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52391935] [2024-11-09 02:05:51,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:51,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:52,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:52,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:52,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:52,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:52,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:52,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:52,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:52,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:52,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:52,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:52,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:52,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:52,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:52,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:52,541 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:05:52,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:52,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52391935] [2024-11-09 02:05:52,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52391935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:52,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:52,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:05:52,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785098686] [2024-11-09 02:05:52,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:52,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:05:52,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:52,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:05:52,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:05:52,543 INFO L87 Difference]: Start difference. First operand 322 states and 432 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:05:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:52,962 INFO L93 Difference]: Finished difference Result 569 states and 765 transitions. [2024-11-09 02:05:52,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:05:52,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2024-11-09 02:05:52,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:52,964 INFO L225 Difference]: With dead ends: 569 [2024-11-09 02:05:52,964 INFO L226 Difference]: Without dead ends: 397 [2024-11-09 02:05:52,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:05:52,965 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 235 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:52,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 212 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:05:52,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-09 02:05:52,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 318. [2024-11-09 02:05:52,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 275 states have (on average 1.2945454545454544) internal successors, (356), 277 states have internal predecessors, (356), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 02:05:52,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 424 transitions. [2024-11-09 02:05:52,993 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 424 transitions. Word has length 115 [2024-11-09 02:05:52,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:52,993 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 424 transitions. [2024-11-09 02:05:52,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:05:52,993 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 424 transitions. [2024-11-09 02:05:52,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 02:05:52,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:52,995 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:52,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 02:05:52,995 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:52,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:52,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1484743168, now seen corresponding path program 1 times [2024-11-09 02:05:52,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:52,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458285821] [2024-11-09 02:05:52,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:52,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:53,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:53,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:53,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:53,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:53,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:53,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:53,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:53,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:53,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:53,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:53,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:53,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:53,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:53,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:53,499 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:05:53,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:53,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458285821] [2024-11-09 02:05:53,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458285821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:53,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:53,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:05:53,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926141962] [2024-11-09 02:05:53,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:53,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:05:53,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:53,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:05:53,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:05:53,502 INFO L87 Difference]: Start difference. First operand 318 states and 424 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:05:53,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:53,788 INFO L93 Difference]: Finished difference Result 731 states and 976 transitions. [2024-11-09 02:05:53,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:05:53,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-11-09 02:05:53,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:53,790 INFO L225 Difference]: With dead ends: 731 [2024-11-09 02:05:53,791 INFO L226 Difference]: Without dead ends: 433 [2024-11-09 02:05:53,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:05:53,792 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 62 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:53,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 354 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:05:53,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-09 02:05:53,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 413. [2024-11-09 02:05:53,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 367 states have (on average 1.3024523160762942) internal successors, (478), 370 states have internal predecessors, (478), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 02:05:53,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 550 transitions. [2024-11-09 02:05:53,827 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 550 transitions. Word has length 116 [2024-11-09 02:05:53,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:53,828 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 550 transitions. [2024-11-09 02:05:53,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:05:53,828 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 550 transitions. [2024-11-09 02:05:53,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 02:05:53,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:53,829 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:53,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 02:05:53,829 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:53,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:53,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1062041342, now seen corresponding path program 1 times [2024-11-09 02:05:53,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:53,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762684648] [2024-11-09 02:05:53,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:53,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:54,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:54,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:54,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:54,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:54,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:54,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:54,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:54,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:54,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:54,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:54,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:54,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:54,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:54,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:05:54,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:54,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762684648] [2024-11-09 02:05:54,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762684648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:54,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:54,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:05:54,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828863438] [2024-11-09 02:05:54,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:54,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:05:54,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:54,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:05:54,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:05:54,272 INFO L87 Difference]: Start difference. First operand 413 states and 550 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:05:54,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:54,888 INFO L93 Difference]: Finished difference Result 943 states and 1249 transitions. [2024-11-09 02:05:54,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 02:05:54,889 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-11-09 02:05:54,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:54,890 INFO L225 Difference]: With dead ends: 943 [2024-11-09 02:05:54,890 INFO L226 Difference]: Without dead ends: 533 [2024-11-09 02:05:54,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:05:54,892 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 187 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:54,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 419 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:05:54,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-09 02:05:54,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 412. [2024-11-09 02:05:54,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 366 states have (on average 1.3005464480874316) internal successors, (476), 369 states have internal predecessors, (476), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 02:05:54,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 548 transitions. [2024-11-09 02:05:54,914 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 548 transitions. Word has length 116 [2024-11-09 02:05:54,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:54,915 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 548 transitions. [2024-11-09 02:05:54,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:05:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 548 transitions. [2024-11-09 02:05:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 02:05:54,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:54,916 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:54,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 02:05:54,916 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:54,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:54,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1745675242, now seen corresponding path program 1 times [2024-11-09 02:05:54,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:54,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728052241] [2024-11-09 02:05:54,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:54,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,319 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:05:55,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:55,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728052241] [2024-11-09 02:05:55,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728052241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:55,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:55,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:05:55,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461623911] [2024-11-09 02:05:55,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:55,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:05:55,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:55,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:05:55,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:05:55,321 INFO L87 Difference]: Start difference. First operand 412 states and 548 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:05:55,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:55,469 INFO L93 Difference]: Finished difference Result 823 states and 1094 transitions. [2024-11-09 02:05:55,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:05:55,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-09 02:05:55,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:55,471 INFO L225 Difference]: With dead ends: 823 [2024-11-09 02:05:55,471 INFO L226 Difference]: Without dead ends: 414 [2024-11-09 02:05:55,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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:05:55,472 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 59 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:55,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 224 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:05:55,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-09 02:05:55,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 412. [2024-11-09 02:05:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 366 states have (on average 1.2978142076502732) internal successors, (475), 369 states have internal predecessors, (475), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 02:05:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 547 transitions. [2024-11-09 02:05:55,495 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 547 transitions. Word has length 116 [2024-11-09 02:05:55,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:55,495 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 547 transitions. [2024-11-09 02:05:55,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:05:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 547 transitions. [2024-11-09 02:05:55,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 02:05:55,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:55,496 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:55,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 02:05:55,496 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:55,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:55,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1953062276, now seen corresponding path program 1 times [2024-11-09 02:05:55,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:55,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869994891] [2024-11-09 02:05:55,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:55,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:05:55,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:55,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869994891] [2024-11-09 02:05:55,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869994891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:55,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:55,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:05:55,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020903831] [2024-11-09 02:05:55,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:55,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:05:55,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:55,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:05:55,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:05:55,855 INFO L87 Difference]: Start difference. First operand 412 states and 547 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:05:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:56,052 INFO L93 Difference]: Finished difference Result 812 states and 1076 transitions. [2024-11-09 02:05:56,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:05:56,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-11-09 02:05:56,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:56,055 INFO L225 Difference]: With dead ends: 812 [2024-11-09 02:05:56,055 INFO L226 Difference]: Without dead ends: 403 [2024-11-09 02:05:56,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:05:56,056 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 104 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:56,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 332 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:05:56,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-09 02:05:56,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 400. [2024-11-09 02:05:56,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 354 states have (on average 1.2853107344632768) internal successors, (455), 357 states have internal predecessors, (455), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 02:05:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 527 transitions. [2024-11-09 02:05:56,087 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 527 transitions. Word has length 116 [2024-11-09 02:05:56,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:56,088 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 527 transitions. [2024-11-09 02:05:56,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:05:56,088 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 527 transitions. [2024-11-09 02:05:56,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 02:05:56,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:56,089 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:56,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 02:05:56,090 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:56,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:56,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1715964076, now seen corresponding path program 1 times [2024-11-09 02:05:56,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:56,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192351897] [2024-11-09 02:05:56,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:56,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat