./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-27.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 2188f6336d1ca1c280fca67f4da63aab9226326f5793dc0ad50e5520551c6099 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:26:27,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:26:28,066 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:26:28,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:26:28,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:26:28,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:26:28,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:26:28,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:26:28,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:26:28,115 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:26:28,116 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:26:28,116 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:26:28,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:26:28,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:26:28,118 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:26:28,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:26:28,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:26:28,120 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:26:28,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:26:28,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:26:28,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:26:28,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:26:28,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:26:28,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:26:28,126 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:26:28,126 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:26:28,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:26:28,127 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:26:28,127 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:26:28,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:26:28,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:26:28,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:26:28,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:26:28,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:26:28,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:26:28,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:26:28,130 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:26:28,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:26:28,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:26:28,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:26:28,131 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:26:28,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:26:28,132 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 -> 2188f6336d1ca1c280fca67f4da63aab9226326f5793dc0ad50e5520551c6099 [2024-10-13 06:26:28,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:26:28,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:26:28,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:26:28,433 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:26:28,433 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:26:28,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-27.i [2024-10-13 06:26:29,976 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:26:30,196 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:26:30,197 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-27.i [2024-10-13 06:26:30,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf961222/66685956a6f3412199bd9611d8645b4d/FLAGb81d30b14 [2024-10-13 06:26:30,574 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf961222/66685956a6f3412199bd9611d8645b4d [2024-10-13 06:26:30,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:26:30,578 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:26:30,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:26:30,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:26:30,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:26:30,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:26:30" (1/1) ... [2024-10-13 06:26:30,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a183152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:30, skipping insertion in model container [2024-10-13 06:26:30,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:26:30" (1/1) ... [2024-10-13 06:26:30,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:26:30,803 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-27.i[916,929] [2024-10-13 06:26:30,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:26:30,886 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:26:30,899 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-27.i[916,929] [2024-10-13 06:26:30,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:26:30,968 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:26:30,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:30 WrapperNode [2024-10-13 06:26:30,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:26:30,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:26:30,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:26:30,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:26:30,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:30" (1/1) ... [2024-10-13 06:26:30,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:30" (1/1) ... [2024-10-13 06:26:31,047 INFO L138 Inliner]: procedures = 26, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 427 [2024-10-13 06:26:31,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:26:31,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:26:31,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:26:31,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:26:31,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:30" (1/1) ... [2024-10-13 06:26:31,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:30" (1/1) ... [2024-10-13 06:26:31,066 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:30" (1/1) ... [2024-10-13 06:26:31,094 INFO L175 MemorySlicer]: Split 123 memory accesses to 2 slices as follows [2, 121]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 16 writes are split as follows [0, 16]. [2024-10-13 06:26:31,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:30" (1/1) ... [2024-10-13 06:26:31,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:30" (1/1) ... [2024-10-13 06:26:31,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:30" (1/1) ... [2024-10-13 06:26:31,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:30" (1/1) ... [2024-10-13 06:26:31,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:30" (1/1) ... [2024-10-13 06:26:31,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:30" (1/1) ... [2024-10-13 06:26:31,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:26:31,139 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:26:31,139 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:26:31,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:26:31,141 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:30" (1/1) ... [2024-10-13 06:26:31,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:26:31,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:26:31,198 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:26:31,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:26:31,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:26:31,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:26:31,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:26:31,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:26:31,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:26:31,262 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:26:31,263 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:26:31,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:26:31,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:26:31,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:26:31,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:26:31,395 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:26:31,397 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:26:32,015 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-10-13 06:26:32,015 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:26:32,089 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:26:32,090 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:26:32,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:26:32 BoogieIcfgContainer [2024-10-13 06:26:32,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:26:32,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:26:32,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:26:32,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:26:32,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:26:30" (1/3) ... [2024-10-13 06:26:32,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69fdd7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:26:32, skipping insertion in model container [2024-10-13 06:26:32,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:30" (2/3) ... [2024-10-13 06:26:32,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69fdd7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:26:32, skipping insertion in model container [2024-10-13 06:26:32,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:26:32" (3/3) ... [2024-10-13 06:26:32,104 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-27.i [2024-10-13 06:26:32,121 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:26:32,121 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:26:32,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:26:32,200 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;@7f0e5485, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:26:32,200 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:26:32,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:26:32,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 06:26:32,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:32,219 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:32,220 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:32,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:32,225 INFO L85 PathProgramCache]: Analyzing trace with hash -719955901, now seen corresponding path program 1 times [2024-10-13 06:26:32,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:32,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222599149] [2024-10-13 06:26:32,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:32,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:26:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:26:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:26:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:26:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:26:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:26:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:26:32,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:32,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222599149] [2024-10-13 06:26:32,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222599149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:32,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:32,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:26:32,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196749507] [2024-10-13 06:26:32,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:32,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:26:32,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:32,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:26:32,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:26:32,726 INFO L87 Difference]: Start difference. First operand has 87 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:26:32,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:32,771 INFO L93 Difference]: Finished difference Result 171 states and 273 transitions. [2024-10-13 06:26:32,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:26:32,773 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 126 [2024-10-13 06:26:32,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:32,780 INFO L225 Difference]: With dead ends: 171 [2024-10-13 06:26:32,780 INFO L226 Difference]: Without dead ends: 85 [2024-10-13 06:26:32,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:26:32,787 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:32,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:26:32,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-13 06:26:32,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-13 06:26:32,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:26:32,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 124 transitions. [2024-10-13 06:26:32,833 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 124 transitions. Word has length 126 [2024-10-13 06:26:32,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:32,834 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 124 transitions. [2024-10-13 06:26:32,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:26:32,835 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 124 transitions. [2024-10-13 06:26:32,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 06:26:32,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:32,840 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:32,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:26:32,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:32,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:32,842 INFO L85 PathProgramCache]: Analyzing trace with hash -953029023, now seen corresponding path program 1 times [2024-10-13 06:26:32,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:32,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201122839] [2024-10-13 06:26:32,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:32,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:34,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:34,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:34,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:34,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:34,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:34,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:34,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:34,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:34,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:34,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:34,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:26:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:34,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:26:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:34,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:34,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:26:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:34,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:26:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:34,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:26:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:34,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:26:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:34,466 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:26:34,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:34,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201122839] [2024-10-13 06:26:34,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201122839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:34,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:34,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:26:34,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99051690] [2024-10-13 06:26:34,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:34,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:26:34,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:34,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:26:34,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:26:34,471 INFO L87 Difference]: Start difference. First operand 85 states and 124 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:26:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:34,807 INFO L93 Difference]: Finished difference Result 253 states and 370 transitions. [2024-10-13 06:26:34,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:26:34,808 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2024-10-13 06:26:34,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:34,813 INFO L225 Difference]: With dead ends: 253 [2024-10-13 06:26:34,813 INFO L226 Difference]: Without dead ends: 169 [2024-10-13 06:26:34,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-10-13 06:26:34,817 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 76 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:34,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 284 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:26:34,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-13 06:26:34,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2024-10-13 06:26:34,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 128 states have (on average 1.359375) internal successors, (174), 128 states have internal predecessors, (174), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:26:34,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 242 transitions. [2024-10-13 06:26:34,857 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 242 transitions. Word has length 126 [2024-10-13 06:26:34,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:34,858 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 242 transitions. [2024-10-13 06:26:34,859 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:26:34,859 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 242 transitions. [2024-10-13 06:26:34,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 06:26:34,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:34,861 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:34,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:26:34,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:34,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:34,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1041115683, now seen corresponding path program 1 times [2024-10-13 06:26:34,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:34,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329917739] [2024-10-13 06:26:34,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:34,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:35,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:35,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:35,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:35,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:35,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:35,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:35,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:35,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:35,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:35,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:35,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:26:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:35,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:26:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:35,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:35,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:26:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:35,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:26:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:35,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:26:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:35,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:26:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:35,954 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:26:35,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:35,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329917739] [2024-10-13 06:26:35,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329917739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:35,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:35,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:26:35,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210098677] [2024-10-13 06:26:35,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:35,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:26:35,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:35,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:26:35,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:26:35,959 INFO L87 Difference]: Start difference. First operand 165 states and 242 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:26:36,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:36,400 INFO L93 Difference]: Finished difference Result 455 states and 666 transitions. [2024-10-13 06:26:36,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:26:36,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 126 [2024-10-13 06:26:36,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:36,404 INFO L225 Difference]: With dead ends: 455 [2024-10-13 06:26:36,405 INFO L226 Difference]: Without dead ends: 291 [2024-10-13 06:26:36,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:26:36,407 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 76 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:36,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 472 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:26:36,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-13 06:26:36,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2024-10-13 06:26:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 232 states have (on average 1.3793103448275863) internal successors, (320), 234 states have internal predecessors, (320), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-13 06:26:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 420 transitions. [2024-10-13 06:26:36,448 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 420 transitions. Word has length 126 [2024-10-13 06:26:36,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:36,449 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 420 transitions. [2024-10-13 06:26:36,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:26:36,452 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 420 transitions. [2024-10-13 06:26:36,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 06:26:36,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:36,458 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:36,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:26:36,459 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:36,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:36,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1259970401, now seen corresponding path program 1 times [2024-10-13 06:26:36,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:36,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525181626] [2024-10-13 06:26:36,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:36,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:37,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:37,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:37,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:37,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:37,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:37,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:37,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:37,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:37,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:37,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:37,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:26:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:37,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:26:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:37,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:37,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:26:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:37,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:26:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:37,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:26:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:37,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:26:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:26:37,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:37,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525181626] [2024-10-13 06:26:37,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525181626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:37,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:37,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:26:37,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665440312] [2024-10-13 06:26:37,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:37,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:26:37,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:37,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:26:37,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:26:37,269 INFO L87 Difference]: Start difference. First operand 287 states and 420 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:26:37,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:37,661 INFO L93 Difference]: Finished difference Result 565 states and 817 transitions. [2024-10-13 06:26:37,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:26:37,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 126 [2024-10-13 06:26:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:37,669 INFO L225 Difference]: With dead ends: 565 [2024-10-13 06:26:37,670 INFO L226 Difference]: Without dead ends: 419 [2024-10-13 06:26:37,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:26:37,676 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 143 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:37,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 377 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:26:37,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-13 06:26:37,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 205. [2024-10-13 06:26:37,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 166 states have (on average 1.3493975903614457) internal successors, (224), 166 states have internal predecessors, (224), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:26:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 292 transitions. [2024-10-13 06:26:37,708 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 292 transitions. Word has length 126 [2024-10-13 06:26:37,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:37,710 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 292 transitions. [2024-10-13 06:26:37,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:26:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 292 transitions. [2024-10-13 06:26:37,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 06:26:37,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:37,713 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:37,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:26:37,713 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:37,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:37,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1694534913, now seen corresponding path program 1 times [2024-10-13 06:26:37,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:37,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478399796] [2024-10-13 06:26:37,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:37,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:39,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:39,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:39,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:39,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:39,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:39,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:39,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:39,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:39,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:39,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:39,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:26:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:39,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:26:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:39,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:39,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:26:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:39,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:26:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:39,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:26:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:39,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:26:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:39,244 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:26:39,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:39,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478399796] [2024-10-13 06:26:39,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478399796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:39,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:39,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:26:39,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853944155] [2024-10-13 06:26:39,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:39,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:26:39,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:39,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:26:39,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:26:39,248 INFO L87 Difference]: Start difference. First operand 205 states and 292 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:26:39,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:39,478 INFO L93 Difference]: Finished difference Result 359 states and 510 transitions. [2024-10-13 06:26:39,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:26:39,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 127 [2024-10-13 06:26:39,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:39,484 INFO L225 Difference]: With dead ends: 359 [2024-10-13 06:26:39,484 INFO L226 Difference]: Without dead ends: 254 [2024-10-13 06:26:39,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:26:39,486 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 52 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:39,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 434 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:26:39,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-13 06:26:39,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2024-10-13 06:26:39,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 209 states have (on average 1.3636363636363635) internal successors, (285), 210 states have internal predecessors, (285), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:26:39,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 357 transitions. [2024-10-13 06:26:39,514 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 357 transitions. Word has length 127 [2024-10-13 06:26:39,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:39,515 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 357 transitions. [2024-10-13 06:26:39,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:26:39,515 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 357 transitions. [2024-10-13 06:26:39,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 06:26:39,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:39,517 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:39,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:26:39,517 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:39,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:39,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1086791388, now seen corresponding path program 1 times [2024-10-13 06:26:39,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:39,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597168325] [2024-10-13 06:26:39,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:39,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:40,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:40,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:40,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:40,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:40,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:40,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:40,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:40,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:40,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:40,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:40,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:26:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:40,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:26:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:40,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:40,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:26:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:40,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:26:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:40,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:26:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:40,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:26:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:26:40,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:40,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597168325] [2024-10-13 06:26:40,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597168325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:40,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:40,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:26:40,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861290069] [2024-10-13 06:26:40,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:40,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:26:40,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:40,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:26:40,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:26:40,299 INFO L87 Difference]: Start difference. First operand 251 states and 357 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:26:40,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:40,537 INFO L93 Difference]: Finished difference Result 507 states and 720 transitions. [2024-10-13 06:26:40,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:26:40,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 128 [2024-10-13 06:26:40,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:40,540 INFO L225 Difference]: With dead ends: 507 [2024-10-13 06:26:40,540 INFO L226 Difference]: Without dead ends: 257 [2024-10-13 06:26:40,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-10-13 06:26:40,542 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 69 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:40,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 283 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:26:40,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-10-13 06:26:40,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 251. [2024-10-13 06:26:40,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 209 states have (on average 1.3588516746411483) internal successors, (284), 210 states have internal predecessors, (284), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:26:40,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 356 transitions. [2024-10-13 06:26:40,560 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 356 transitions. Word has length 128 [2024-10-13 06:26:40,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:40,560 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 356 transitions. [2024-10-13 06:26:40,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:26:40,561 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 356 transitions. [2024-10-13 06:26:40,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 06:26:40,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:40,563 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:40,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:26:40,563 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:40,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:40,564 INFO L85 PathProgramCache]: Analyzing trace with hash -409325284, now seen corresponding path program 1 times [2024-10-13 06:26:40,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:40,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612987361] [2024-10-13 06:26:40,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:40,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:41,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:41,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:41,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:41,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:41,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:41,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:41,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:41,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:41,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:41,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:41,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:26:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:41,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:26:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:41,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:41,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:26:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:41,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:26:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:41,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:26:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:41,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:26:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:41,320 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:26:41,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:41,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612987361] [2024-10-13 06:26:41,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612987361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:41,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:41,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:26:41,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236464757] [2024-10-13 06:26:41,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:41,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:26:41,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:41,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:26:41,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:26:41,325 INFO L87 Difference]: Start difference. First operand 251 states and 356 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:26:41,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:41,783 INFO L93 Difference]: Finished difference Result 507 states and 718 transitions. [2024-10-13 06:26:41,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:26:41,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 129 [2024-10-13 06:26:41,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:41,787 INFO L225 Difference]: With dead ends: 507 [2024-10-13 06:26:41,787 INFO L226 Difference]: Without dead ends: 356 [2024-10-13 06:26:41,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:26:41,789 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 100 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:41,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 379 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:26:41,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-13 06:26:41,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 350. [2024-10-13 06:26:41,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 288 states have (on average 1.3472222222222223) internal successors, (388), 289 states have internal predecessors, (388), 53 states have call successors, (53), 8 states have call predecessors, (53), 8 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-13 06:26:41,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 494 transitions. [2024-10-13 06:26:41,822 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 494 transitions. Word has length 129 [2024-10-13 06:26:41,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:41,822 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 494 transitions. [2024-10-13 06:26:41,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:26:41,823 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 494 transitions. [2024-10-13 06:26:41,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 06:26:41,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:41,825 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:41,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:26:41,826 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:41,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:41,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1311491078, now seen corresponding path program 1 times [2024-10-13 06:26:41,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:41,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233076167] [2024-10-13 06:26:41,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:41,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:26:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:26:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:26:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:26:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:26:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:26:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,177 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:26:42,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:42,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233076167] [2024-10-13 06:26:42,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233076167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:42,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:42,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:26:42,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702578468] [2024-10-13 06:26:42,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:42,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:26:42,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:42,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:26:42,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:26:42,181 INFO L87 Difference]: Start difference. First operand 350 states and 494 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:26:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:42,632 INFO L93 Difference]: Finished difference Result 588 states and 828 transitions. [2024-10-13 06:26:42,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:26:42,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 129 [2024-10-13 06:26:42,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:42,636 INFO L225 Difference]: With dead ends: 588 [2024-10-13 06:26:42,636 INFO L226 Difference]: Without dead ends: 312 [2024-10-13 06:26:42,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:26:42,638 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 98 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:42,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 463 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:26:42,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-13 06:26:42,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 207. [2024-10-13 06:26:42,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 167 states have (on average 1.311377245508982) internal successors, (219), 167 states have internal predecessors, (219), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:26:42,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 287 transitions. [2024-10-13 06:26:42,658 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 287 transitions. Word has length 129 [2024-10-13 06:26:42,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:42,659 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 287 transitions. [2024-10-13 06:26:42,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:26:42,659 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 287 transitions. [2024-10-13 06:26:42,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 06:26:42,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:42,661 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:42,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:26:42,661 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:42,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:42,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1903195779, now seen corresponding path program 1 times [2024-10-13 06:26:42,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:42,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470406153] [2024-10-13 06:26:42,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:42,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:26:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:26:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:26:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:26:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:26:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:26:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:42,759 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:26:42,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:42,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470406153] [2024-10-13 06:26:42,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470406153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:42,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:42,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:26:42,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243579779] [2024-10-13 06:26:42,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:42,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:26:42,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:42,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:26:42,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:26:42,764 INFO L87 Difference]: Start difference. First operand 207 states and 287 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:26:42,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:42,799 INFO L93 Difference]: Finished difference Result 415 states and 577 transitions. [2024-10-13 06:26:42,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:26:42,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2024-10-13 06:26:42,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:42,802 INFO L225 Difference]: With dead ends: 415 [2024-10-13 06:26:42,802 INFO L226 Difference]: Without dead ends: 209 [2024-10-13 06:26:42,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:26:42,803 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:42,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:26:42,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-13 06:26:42,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-10-13 06:26:42,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 169 states have (on average 1.3076923076923077) internal successors, (221), 169 states have internal predecessors, (221), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:26:42,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 289 transitions. [2024-10-13 06:26:42,822 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 289 transitions. Word has length 130 [2024-10-13 06:26:42,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:42,824 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 289 transitions. [2024-10-13 06:26:42,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:26:42,825 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 289 transitions. [2024-10-13 06:26:42,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 06:26:42,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:42,826 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:42,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 06:26:42,827 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:42,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:42,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1711713147, now seen corresponding path program 1 times [2024-10-13 06:26:42,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:42,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351271518] [2024-10-13 06:26:42,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:42,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:44,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:44,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:44,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:44,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:44,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:44,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:44,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:44,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:44,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:44,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:44,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:26:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:44,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:26:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:44,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:44,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:26:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:44,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:26:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:44,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:26:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:44,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:26:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:26:44,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:44,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351271518] [2024-10-13 06:26:44,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351271518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:44,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:44,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:26:44,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7457312] [2024-10-13 06:26:44,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:44,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:26:44,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:44,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:26:44,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:26:44,108 INFO L87 Difference]: Start difference. First operand 209 states and 289 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:26:44,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:44,490 INFO L93 Difference]: Finished difference Result 543 states and 747 transitions. [2024-10-13 06:26:44,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:26:44,491 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2024-10-13 06:26:44,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:44,494 INFO L225 Difference]: With dead ends: 543 [2024-10-13 06:26:44,494 INFO L226 Difference]: Without dead ends: 335 [2024-10-13 06:26:44,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:26:44,496 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 55 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:44,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 451 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:26:44,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-10-13 06:26:44,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 304. [2024-10-13 06:26:44,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 261 states have (on average 1.318007662835249) internal successors, (344), 262 states have internal predecessors, (344), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:26:44,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 416 transitions. [2024-10-13 06:26:44,522 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 416 transitions. Word has length 130 [2024-10-13 06:26:44,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:44,522 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 416 transitions. [2024-10-13 06:26:44,522 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:26:44,523 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 416 transitions. [2024-10-13 06:26:44,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 06:26:44,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:44,524 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:44,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 06:26:44,524 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:44,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:44,525 INFO L85 PathProgramCache]: Analyzing trace with hash -73426071, now seen corresponding path program 1 times [2024-10-13 06:26:44,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:44,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748058328] [2024-10-13 06:26:44,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:44,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:45,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:45,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:45,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:45,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:45,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:45,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:45,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:45,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:45,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:45,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:45,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:26:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:45,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:26:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:45,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:45,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:26:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:45,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:26:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:45,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:26:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:45,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:26:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:45,967 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:26:45,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:45,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748058328] [2024-10-13 06:26:45,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748058328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:45,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:45,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:26:45,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363686861] [2024-10-13 06:26:45,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:45,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:26:45,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:45,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:26:45,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:26:45,970 INFO L87 Difference]: Start difference. First operand 304 states and 416 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:26:46,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:46,483 INFO L93 Difference]: Finished difference Result 700 states and 959 transitions. [2024-10-13 06:26:46,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:26:46,484 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2024-10-13 06:26:46,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:46,488 INFO L225 Difference]: With dead ends: 700 [2024-10-13 06:26:46,488 INFO L226 Difference]: Without dead ends: 397 [2024-10-13 06:26:46,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:26:46,491 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 45 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:46,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 720 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:26:46,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-13 06:26:46,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 338. [2024-10-13 06:26:46,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 295 states have (on average 1.3152542372881355) internal successors, (388), 296 states have internal predecessors, (388), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:26:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 460 transitions. [2024-10-13 06:26:46,513 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 460 transitions. Word has length 130 [2024-10-13 06:26:46,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:46,513 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 460 transitions. [2024-10-13 06:26:46,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:26:46,514 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 460 transitions. [2024-10-13 06:26:46,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 06:26:46,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:46,515 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:46,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 06:26:46,516 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:46,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:46,516 INFO L85 PathProgramCache]: Analyzing trace with hash 627638507, now seen corresponding path program 1 times [2024-10-13 06:26:46,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:46,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33420373] [2024-10-13 06:26:46,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:46,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:47,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:47,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:47,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:47,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:47,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:47,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:47,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:47,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:47,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:47,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:47,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:26:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:47,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:26:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:47,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:47,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:26:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:47,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:26:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:47,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:26:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:47,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:26:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:47,530 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:26:47,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:47,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33420373] [2024-10-13 06:26:47,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33420373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:47,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:47,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:26:47,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058119912] [2024-10-13 06:26:47,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:47,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:26:47,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:47,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:26:47,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:26:47,532 INFO L87 Difference]: Start difference. First operand 338 states and 460 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:26:47,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:47,901 INFO L93 Difference]: Finished difference Result 741 states and 1007 transitions. [2024-10-13 06:26:47,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:26:47,902 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2024-10-13 06:26:47,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:47,904 INFO L225 Difference]: With dead ends: 741 [2024-10-13 06:26:47,905 INFO L226 Difference]: Without dead ends: 404 [2024-10-13 06:26:47,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:26:47,906 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 48 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:47,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 580 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:26:47,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-10-13 06:26:47,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 342. [2024-10-13 06:26:47,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 299 states have (on average 1.3110367892976589) internal successors, (392), 300 states have internal predecessors, (392), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:26:47,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 464 transitions. [2024-10-13 06:26:47,927 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 464 transitions. Word has length 130 [2024-10-13 06:26:47,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:47,927 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 464 transitions. [2024-10-13 06:26:47,927 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:26:47,928 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 464 transitions. [2024-10-13 06:26:47,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 06:26:47,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:47,929 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:47,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 06:26:47,930 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:47,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:47,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1762369813, now seen corresponding path program 1 times [2024-10-13 06:26:47,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:47,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096718867] [2024-10-13 06:26:47,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:47,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:48,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:48,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:48,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:48,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:48,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:48,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:48,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:48,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:48,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:48,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:48,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:26:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:48,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:26:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:48,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:48,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:26:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:48,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:26:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:48,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:26:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:48,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:26:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:48,868 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:26:48,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:48,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096718867] [2024-10-13 06:26:48,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096718867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:48,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:48,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:26:48,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986131522] [2024-10-13 06:26:48,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:48,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:26:48,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:48,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:26:48,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:26:48,871 INFO L87 Difference]: Start difference. First operand 342 states and 464 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:26:49,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:49,241 INFO L93 Difference]: Finished difference Result 722 states and 976 transitions. [2024-10-13 06:26:49,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:26:49,242 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2024-10-13 06:26:49,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:49,244 INFO L225 Difference]: With dead ends: 722 [2024-10-13 06:26:49,244 INFO L226 Difference]: Without dead ends: 381 [2024-10-13 06:26:49,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:26:49,246 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 49 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:49,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 489 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:26:49,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-10-13 06:26:49,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 313. [2024-10-13 06:26:49,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 272 states have (on average 1.2941176470588236) internal successors, (352), 272 states have internal predecessors, (352), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:26:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 420 transitions. [2024-10-13 06:26:49,268 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 420 transitions. Word has length 130 [2024-10-13 06:26:49,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:49,269 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 420 transitions. [2024-10-13 06:26:49,269 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:26:49,269 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 420 transitions. [2024-10-13 06:26:49,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 06:26:49,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:49,271 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:49,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 06:26:49,272 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:49,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:49,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1061305235, now seen corresponding path program 1 times [2024-10-13 06:26:49,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:49,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749667516] [2024-10-13 06:26:49,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:49,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:50,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:50,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:50,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:50,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:50,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:50,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:50,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:50,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:50,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:50,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:50,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:26:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:50,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:26:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:50,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:50,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:26:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:50,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:26:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:50,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:26:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:50,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:26:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:50,274 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:26:50,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:50,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749667516] [2024-10-13 06:26:50,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749667516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:50,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:50,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:26:50,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772234487] [2024-10-13 06:26:50,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:50,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:26:50,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:50,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:26:50,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:26:50,276 INFO L87 Difference]: Start difference. First operand 313 states and 420 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:26:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:50,796 INFO L93 Difference]: Finished difference Result 656 states and 882 transitions. [2024-10-13 06:26:50,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:26:50,797 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2024-10-13 06:26:50,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:50,800 INFO L225 Difference]: With dead ends: 656 [2024-10-13 06:26:50,800 INFO L226 Difference]: Without dead ends: 344 [2024-10-13 06:26:50,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:26:50,801 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 43 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:50,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 885 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:26:50,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-13 06:26:50,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 307. [2024-10-13 06:26:50,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 266 states have (on average 1.2932330827067668) internal successors, (344), 266 states have internal predecessors, (344), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:26:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 412 transitions. [2024-10-13 06:26:50,822 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 412 transitions. Word has length 130 [2024-10-13 06:26:50,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:50,823 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 412 transitions. [2024-10-13 06:26:50,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:26:50,824 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 412 transitions. [2024-10-13 06:26:50,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 06:26:50,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:50,825 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:50,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 06:26:50,826 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:50,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:50,826 INFO L85 PathProgramCache]: Analyzing trace with hash 198970913, now seen corresponding path program 1 times [2024-10-13 06:26:50,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:50,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193633294] [2024-10-13 06:26:50,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:50,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:51,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:51,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:51,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:51,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:51,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:51,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:51,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:51,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:51,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:51,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:51,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:26:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:51,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:26:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:51,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:51,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:26:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:51,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:26:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:51,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:26:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:51,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:26:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:51,714 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:26:51,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:51,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193633294] [2024-10-13 06:26:51,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193633294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:51,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:51,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:26:51,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161788401] [2024-10-13 06:26:51,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:51,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:26:51,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:51,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:26:51,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:26:51,717 INFO L87 Difference]: Start difference. First operand 307 states and 412 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:26:52,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:52,343 INFO L93 Difference]: Finished difference Result 795 states and 1063 transitions. [2024-10-13 06:26:52,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:26:52,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2024-10-13 06:26:52,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:52,347 INFO L225 Difference]: With dead ends: 795 [2024-10-13 06:26:52,348 INFO L226 Difference]: Without dead ends: 489 [2024-10-13 06:26:52,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:26:52,351 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 147 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:52,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 672 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:26:52,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-10-13 06:26:52,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 327. [2024-10-13 06:26:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 286 states have (on average 1.2867132867132867) internal successors, (368), 286 states have internal predecessors, (368), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:26:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 436 transitions. [2024-10-13 06:26:52,372 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 436 transitions. Word has length 130 [2024-10-13 06:26:52,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:52,372 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 436 transitions. [2024-10-13 06:26:52,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:26:52,372 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 436 transitions. [2024-10-13 06:26:52,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 06:26:52,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:52,375 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:52,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 06:26:52,375 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:52,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:52,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1389376989, now seen corresponding path program 1 times [2024-10-13 06:26:52,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:52,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967230830] [2024-10-13 06:26:52,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:52,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:52,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:52,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:52,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:52,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:52,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:52,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:52,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:52,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:52,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:52,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:52,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:26:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:52,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:26:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:52,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:52,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:26:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:52,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:26:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:52,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:26:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:52,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:26:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:26:52,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:52,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967230830] [2024-10-13 06:26:52,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967230830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:52,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:52,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:26:52,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029659698] [2024-10-13 06:26:52,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:52,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:26:52,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:52,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:26:52,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:26:52,891 INFO L87 Difference]: Start difference. First operand 327 states and 436 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:26:53,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:53,251 INFO L93 Difference]: Finished difference Result 761 states and 1013 transitions. [2024-10-13 06:26:53,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:26:53,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2024-10-13 06:26:53,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:53,255 INFO L225 Difference]: With dead ends: 761 [2024-10-13 06:26:53,255 INFO L226 Difference]: Without dead ends: 435 [2024-10-13 06:26:53,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:26:53,256 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 69 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:53,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 372 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:26:53,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-10-13 06:26:53,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 343. [2024-10-13 06:26:53,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 302 states have (on average 1.2748344370860927) internal successors, (385), 302 states have internal predecessors, (385), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:26:53,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 453 transitions. [2024-10-13 06:26:53,277 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 453 transitions. Word has length 130 [2024-10-13 06:26:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:53,277 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 453 transitions. [2024-10-13 06:26:53,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:26:53,278 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 453 transitions. [2024-10-13 06:26:53,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 06:26:53,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:53,279 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:53,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 06:26:53,280 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:53,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:53,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1782403999, now seen corresponding path program 1 times [2024-10-13 06:26:53,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:53,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214234257] [2024-10-13 06:26:53,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:53,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:53,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:53,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:53,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:53,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:53,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:53,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:53,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:53,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:53,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:53,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:53,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:26:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:53,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:26:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:53,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:53,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:26:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:53,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:26:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:53,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:26:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:53,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:26:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:53,723 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:26:53,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:53,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214234257] [2024-10-13 06:26:53,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214234257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:53,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:53,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:26:53,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018772999] [2024-10-13 06:26:53,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:53,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:26:53,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:53,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:26:53,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:26:53,726 INFO L87 Difference]: Start difference. First operand 343 states and 453 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:26:54,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:54,088 INFO L93 Difference]: Finished difference Result 785 states and 1032 transitions. [2024-10-13 06:26:54,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:26:54,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2024-10-13 06:26:54,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:54,091 INFO L225 Difference]: With dead ends: 785 [2024-10-13 06:26:54,091 INFO L226 Difference]: Without dead ends: 443 [2024-10-13 06:26:54,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:26:54,093 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 70 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:54,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 500 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:26:54,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-10-13 06:26:54,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2024-10-13 06:26:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 372 states have (on average 1.2553763440860215) internal successors, (467), 374 states have internal predecessors, (467), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-13 06:26:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 575 transitions. [2024-10-13 06:26:54,129 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 575 transitions. Word has length 130 [2024-10-13 06:26:54,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:54,130 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 575 transitions. [2024-10-13 06:26:54,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:26:54,130 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 575 transitions. [2024-10-13 06:26:54,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 06:26:54,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:54,132 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:54,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 06:26:54,132 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:54,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:54,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1604353875, now seen corresponding path program 1 times [2024-10-13 06:26:54,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:54,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133989693] [2024-10-13 06:26:54,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:54,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:54,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:54,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:54,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:54,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:54,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:54,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:54,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:54,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:54,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:54,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:54,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:26:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:54,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:26:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:54,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:54,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:26:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:54,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:26:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:54,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:26:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:54,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:26:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:54,564 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:26:54,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:54,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133989693] [2024-10-13 06:26:54,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133989693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:54,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:54,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:26:54,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336435802] [2024-10-13 06:26:54,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:54,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:26:54,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:54,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:26:54,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:26:54,566 INFO L87 Difference]: Start difference. First operand 439 states and 575 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:26:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:54,871 INFO L93 Difference]: Finished difference Result 1020 states and 1333 transitions. [2024-10-13 06:26:54,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:26:54,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-13 06:26:54,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:54,875 INFO L225 Difference]: With dead ends: 1020 [2024-10-13 06:26:54,876 INFO L226 Difference]: Without dead ends: 582 [2024-10-13 06:26:54,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:26:54,878 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 55 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:54,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 585 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:26:54,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-10-13 06:26:54,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 578. [2024-10-13 06:26:54,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 495 states have (on average 1.2484848484848485) internal successors, (618), 499 states have internal predecessors, (618), 66 states have call successors, (66), 16 states have call predecessors, (66), 16 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 06:26:54,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 750 transitions. [2024-10-13 06:26:54,921 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 750 transitions. Word has length 134 [2024-10-13 06:26:54,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:54,921 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 750 transitions. [2024-10-13 06:26:54,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:26:54,922 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 750 transitions. [2024-10-13 06:26:54,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 06:26:54,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:54,923 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:54,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 06:26:54,924 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:54,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:54,924 INFO L85 PathProgramCache]: Analyzing trace with hash -420155260, now seen corresponding path program 1 times [2024-10-13 06:26:54,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:54,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332472411] [2024-10-13 06:26:54,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:54,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:55,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:55,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:55,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:55,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:55,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:55,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:55,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:55,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:55,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:55,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:55,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:26:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:55,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:26:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:55,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:55,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:26:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:55,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:26:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:55,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:26:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:55,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:26:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:55,975 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:26:55,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:55,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332472411] [2024-10-13 06:26:55,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332472411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:55,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:55,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:26:55,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072496102] [2024-10-13 06:26:55,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:55,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:26:55,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:55,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:26:55,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:26:55,979 INFO L87 Difference]: Start difference. First operand 578 states and 750 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:26:57,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:57,110 INFO L93 Difference]: Finished difference Result 1474 states and 1900 transitions. [2024-10-13 06:26:57,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:26:57,111 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2024-10-13 06:26:57,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:57,116 INFO L225 Difference]: With dead ends: 1474 [2024-10-13 06:26:57,116 INFO L226 Difference]: Without dead ends: 897 [2024-10-13 06:26:57,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:26:57,119 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 307 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:57,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 366 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 06:26:57,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2024-10-13 06:26:57,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 796. [2024-10-13 06:26:57,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 697 states have (on average 1.2539454806312769) internal successors, (874), 703 states have internal predecessors, (874), 78 states have call successors, (78), 20 states have call predecessors, (78), 20 states have return successors, (78), 72 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 06:26:57,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1030 transitions. [2024-10-13 06:26:57,178 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1030 transitions. Word has length 134 [2024-10-13 06:26:57,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:57,179 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1030 transitions. [2024-10-13 06:26:57,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:26:57,179 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1030 transitions. [2024-10-13 06:26:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 06:26:57,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:57,181 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:57,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 06:26:57,181 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:57,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:57,182 INFO L85 PathProgramCache]: Analyzing trace with hash 690676371, now seen corresponding path program 1 times [2024-10-13 06:26:57,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:57,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127506775] [2024-10-13 06:26:57,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:57,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:57,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:57,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:57,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:57,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:57,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:57,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:57,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:57,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:57,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:57,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:57,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:26:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:57,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:26:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:57,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:57,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:26:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:57,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:26:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:57,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:26:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:57,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:26:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:57,393 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:26:57,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:57,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127506775] [2024-10-13 06:26:57,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127506775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:57,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:57,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:26:57,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429645904] [2024-10-13 06:26:57,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:57,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:26:57,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:57,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:26:57,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:26:57,395 INFO L87 Difference]: Start difference. First operand 796 states and 1030 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:26:57,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:57,652 INFO L93 Difference]: Finished difference Result 1777 states and 2299 transitions. [2024-10-13 06:26:57,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:26:57,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-13 06:26:57,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:57,658 INFO L225 Difference]: With dead ends: 1777 [2024-10-13 06:26:57,658 INFO L226 Difference]: Without dead ends: 982 [2024-10-13 06:26:57,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:26:57,661 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 81 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:57,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 278 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:26:57,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2024-10-13 06:26:57,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 815. [2024-10-13 06:26:57,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 716 states have (on average 1.2458100558659218) internal successors, (892), 722 states have internal predecessors, (892), 78 states have call successors, (78), 20 states have call predecessors, (78), 20 states have return successors, (78), 72 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 06:26:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1048 transitions. [2024-10-13 06:26:57,725 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1048 transitions. Word has length 134 [2024-10-13 06:26:57,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:57,726 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 1048 transitions. [2024-10-13 06:26:57,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:26:57,726 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1048 transitions. [2024-10-13 06:26:57,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 06:26:57,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:57,728 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:57,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 06:26:57,729 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:57,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:57,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1874874986, now seen corresponding path program 1 times [2024-10-13 06:26:57,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:57,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043595561] [2024-10-13 06:26:57,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:57,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:58,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:58,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:58,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:58,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:58,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:58,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:58,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:58,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:58,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:58,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:58,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:26:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:58,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:26:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:58,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:58,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:26:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:58,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:26:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:58,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:26:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:58,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:26:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:58,281 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:26:58,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:58,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043595561] [2024-10-13 06:26:58,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043595561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:58,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:58,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:26:58,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22027561] [2024-10-13 06:26:58,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:58,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:26:58,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:58,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:26:58,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:26:58,284 INFO L87 Difference]: Start difference. First operand 815 states and 1048 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:26:58,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:58,710 INFO L93 Difference]: Finished difference Result 1829 states and 2348 transitions. [2024-10-13 06:26:58,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:26:58,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2024-10-13 06:26:58,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:58,716 INFO L225 Difference]: With dead ends: 1829 [2024-10-13 06:26:58,716 INFO L226 Difference]: Without dead ends: 1015 [2024-10-13 06:26:58,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:26:58,719 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 69 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:58,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 380 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:26:58,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2024-10-13 06:26:58,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 819. [2024-10-13 06:26:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 720 states have (on average 1.2444444444444445) internal successors, (896), 726 states have internal predecessors, (896), 78 states have call successors, (78), 20 states have call predecessors, (78), 20 states have return successors, (78), 72 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 06:26:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1052 transitions. [2024-10-13 06:26:58,798 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1052 transitions. Word has length 134 [2024-10-13 06:26:58,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:58,798 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1052 transitions. [2024-10-13 06:26:58,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:26:58,799 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1052 transitions. [2024-10-13 06:26:58,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 06:26:58,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:58,801 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:58,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 06:26:58,801 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:58,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:58,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1833286296, now seen corresponding path program 1 times [2024-10-13 06:26:58,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:58,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498761439] [2024-10-13 06:26:58,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:58,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:59,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:59,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:59,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:59,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:59,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:59,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:59,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:59,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:59,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:59,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:59,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:26:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:59,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:26:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:59,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:59,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:26:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:59,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:26:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:59,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:26:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:59,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:26:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-13 06:26:59,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:59,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498761439] [2024-10-13 06:26:59,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498761439] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:26:59,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908304358] [2024-10-13 06:26:59,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:59,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:26:59,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:26:59,368 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:26:59,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 06:26:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:59,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 06:26:59,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:26:59,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-13 06:26:59,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-13 06:26:59,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-13 06:26:59,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-13 06:26:59,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-13 06:26:59,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:59,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 42 [2024-10-13 06:26:59,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:59,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 12 [2024-10-13 06:26:59,916 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 216 proven. 36 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-10-13 06:26:59,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:27:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-13 06:27:00,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908304358] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 06:27:00,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 06:27:00,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 14 [2024-10-13 06:27:00,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406905513] [2024-10-13 06:27:00,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 06:27:00,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 06:27:00,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:27:00,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 06:27:00,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:27:00,209 INFO L87 Difference]: Start difference. First operand 819 states and 1052 transitions. Second operand has 14 states, 11 states have (on average 7.636363636363637) internal successors, (84), 14 states have internal predecessors, (84), 6 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (43), 3 states have call predecessors, (43), 6 states have call successors, (43) [2024-10-13 06:27:00,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:27:00,930 INFO L93 Difference]: Finished difference Result 1783 states and 2268 transitions. [2024-10-13 06:27:00,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 06:27:00,931 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 7.636363636363637) internal successors, (84), 14 states have internal predecessors, (84), 6 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (43), 3 states have call predecessors, (43), 6 states have call successors, (43) Word has length 134 [2024-10-13 06:27:00,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:27:00,937 INFO L225 Difference]: With dead ends: 1783 [2024-10-13 06:27:00,938 INFO L226 Difference]: Without dead ends: 965 [2024-10-13 06:27:00,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2024-10-13 06:27:00,941 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 171 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:27:00,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 189 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:27:00,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2024-10-13 06:27:01,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 831. [2024-10-13 06:27:01,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 724 states have (on average 1.2320441988950277) internal successors, (892), 730 states have internal predecessors, (892), 78 states have call successors, (78), 28 states have call predecessors, (78), 28 states have return successors, (78), 72 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 06:27:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1048 transitions. [2024-10-13 06:27:01,044 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1048 transitions. Word has length 134 [2024-10-13 06:27:01,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:27:01,045 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1048 transitions. [2024-10-13 06:27:01,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 7.636363636363637) internal successors, (84), 14 states have internal predecessors, (84), 6 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (43), 3 states have call predecessors, (43), 6 states have call successors, (43) [2024-10-13 06:27:01,045 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1048 transitions. [2024-10-13 06:27:01,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 06:27:01,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:27:01,047 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:27:01,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 06:27:01,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-13 06:27:01,249 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:27:01,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:27:01,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2101018788, now seen corresponding path program 1 times [2024-10-13 06:27:01,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:27:01,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871574459] [2024-10-13 06:27:01,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:27:01,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:27:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:02,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:27:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:02,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:27:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:02,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:27:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:02,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:27:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:02,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:27:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:02,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:27:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:02,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:27:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:02,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:27:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:02,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:27:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:02,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:27:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:02,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:27:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:02,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:27:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:02,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:27:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:02,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:27:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:02,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:27:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:02,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:27:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:02,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:27:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:02,387 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:27:02,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:27:02,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871574459] [2024-10-13 06:27:02,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871574459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:27:02,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:27:02,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:27:02,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830043374] [2024-10-13 06:27:02,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:27:02,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:27:02,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:27:02,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:27:02,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:27:02,390 INFO L87 Difference]: Start difference. First operand 831 states and 1048 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:27:03,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:27:03,283 INFO L93 Difference]: Finished difference Result 1798 states and 2258 transitions. [2024-10-13 06:27:03,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:27:03,284 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2024-10-13 06:27:03,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:27:03,289 INFO L225 Difference]: With dead ends: 1798 [2024-10-13 06:27:03,289 INFO L226 Difference]: Without dead ends: 968 [2024-10-13 06:27:03,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:27:03,291 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 267 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:27:03,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 737 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 06:27:03,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2024-10-13 06:27:03,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 959. [2024-10-13 06:27:03,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 834 states have (on average 1.2266187050359711) internal successors, (1023), 843 states have internal predecessors, (1023), 90 states have call successors, (90), 34 states have call predecessors, (90), 34 states have return successors, (90), 81 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-13 06:27:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1203 transitions. [2024-10-13 06:27:03,377 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1203 transitions. Word has length 134 [2024-10-13 06:27:03,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:27:03,377 INFO L471 AbstractCegarLoop]: Abstraction has 959 states and 1203 transitions. [2024-10-13 06:27:03,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:27:03,378 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1203 transitions. [2024-10-13 06:27:03,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 06:27:03,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:27:03,379 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:27:03,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 06:27:03,380 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:27:03,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:27:03,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1291672162, now seen corresponding path program 1 times [2024-10-13 06:27:03,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:27:03,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924198602] [2024-10-13 06:27:03,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:27:03,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:27:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:04,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:27:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:04,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:27:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:04,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:27:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:04,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:27:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:04,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:27:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:04,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:27:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:04,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:27:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:04,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:27:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:04,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:27:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:04,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:27:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:04,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:27:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:04,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:27:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:04,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:27:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:04,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:27:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:04,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:27:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:04,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:27:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:04,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:27:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:04,528 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:27:04,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:27:04,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924198602] [2024-10-13 06:27:04,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924198602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:27:04,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:27:04,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:27:04,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666988537] [2024-10-13 06:27:04,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:27:04,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:27:04,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:27:04,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:27:04,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:27:04,530 INFO L87 Difference]: Start difference. First operand 959 states and 1203 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:27:05,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:27:05,252 INFO L93 Difference]: Finished difference Result 1922 states and 2412 transitions. [2024-10-13 06:27:05,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:27:05,253 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2024-10-13 06:27:05,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:27:05,258 INFO L225 Difference]: With dead ends: 1922 [2024-10-13 06:27:05,259 INFO L226 Difference]: Without dead ends: 980 [2024-10-13 06:27:05,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:27:05,261 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 47 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:27:05,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 964 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:27:05,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2024-10-13 06:27:05,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 960. [2024-10-13 06:27:05,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 835 states have (on average 1.2251497005988023) internal successors, (1023), 844 states have internal predecessors, (1023), 90 states have call successors, (90), 34 states have call predecessors, (90), 34 states have return successors, (90), 81 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-13 06:27:05,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1203 transitions. [2024-10-13 06:27:05,344 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1203 transitions. Word has length 134 [2024-10-13 06:27:05,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:27:05,344 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1203 transitions. [2024-10-13 06:27:05,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:27:05,345 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1203 transitions. [2024-10-13 06:27:05,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 06:27:05,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:27:05,346 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:27:05,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 06:27:05,347 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:27:05,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:27:05,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1771246682, now seen corresponding path program 1 times [2024-10-13 06:27:05,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:27:05,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722478477] [2024-10-13 06:27:05,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:27:05,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:27:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:05,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:27:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:05,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:27:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:05,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:27:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:05,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:27:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:05,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:27:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:05,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:27:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:05,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:27:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:05,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:27:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:05,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:27:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:05,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:27:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:05,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:27:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:05,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:27:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:05,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:27:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:05,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:27:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:05,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:27:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:05,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:27:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:05,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:27:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:27:05,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:27:05,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722478477] [2024-10-13 06:27:05,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722478477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:27:05,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:27:05,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:27:05,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471822048] [2024-10-13 06:27:05,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:27:05,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:27:05,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:27:05,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:27:05,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:27:05,863 INFO L87 Difference]: Start difference. First operand 960 states and 1203 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:27:06,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:27:06,176 INFO L93 Difference]: Finished difference Result 1912 states and 2389 transitions. [2024-10-13 06:27:06,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:27:06,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-13 06:27:06,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:27:06,182 INFO L225 Difference]: With dead ends: 1912 [2024-10-13 06:27:06,182 INFO L226 Difference]: Without dead ends: 969 [2024-10-13 06:27:06,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:27:06,188 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 48 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:27:06,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 360 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:27:06,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2024-10-13 06:27:06,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 857. [2024-10-13 06:27:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 740 states have (on average 1.218918918918919) internal successors, (902), 747 states have internal predecessors, (902), 82 states have call successors, (82), 34 states have call predecessors, (82), 34 states have return successors, (82), 75 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-13 06:27:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1066 transitions. [2024-10-13 06:27:06,286 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1066 transitions. Word has length 134 [2024-10-13 06:27:06,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:27:06,286 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1066 transitions. [2024-10-13 06:27:06,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:27:06,287 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1066 transitions. [2024-10-13 06:27:06,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 06:27:06,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:27:06,289 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:27:06,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 06:27:06,289 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:27:06,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:27:06,289 INFO L85 PathProgramCache]: Analyzing trace with hash -803490713, now seen corresponding path program 1 times [2024-10-13 06:27:06,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:27:06,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953045643] [2024-10-13 06:27:06,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:27:06,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:27:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:27:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:27:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:27:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:27:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:27:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:27:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:27:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:27:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:27:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:27:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:27:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:27:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:27:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:27:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:27:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:27:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:27:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:27:07,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:27:07,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953045643] [2024-10-13 06:27:07,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953045643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:27:07,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:27:07,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:27:07,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525167429] [2024-10-13 06:27:07,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:27:07,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:27:07,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:27:07,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:27:07,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:27:07,039 INFO L87 Difference]: Start difference. First operand 857 states and 1066 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:27:07,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:27:07,566 INFO L93 Difference]: Finished difference Result 1701 states and 2108 transitions. [2024-10-13 06:27:07,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:27:07,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-13 06:27:07,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:27:07,572 INFO L225 Difference]: With dead ends: 1701 [2024-10-13 06:27:07,572 INFO L226 Difference]: Without dead ends: 861 [2024-10-13 06:27:07,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:27:07,575 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 48 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:27:07,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 410 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:27:07,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-10-13 06:27:07,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 847. [2024-10-13 06:27:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 726 states have (on average 1.209366391184573) internal successors, (878), 733 states have internal predecessors, (878), 82 states have call successors, (82), 38 states have call predecessors, (82), 38 states have return successors, (82), 75 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-13 06:27:07,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1042 transitions. [2024-10-13 06:27:07,696 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1042 transitions. Word has length 135 [2024-10-13 06:27:07,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:27:07,696 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1042 transitions. [2024-10-13 06:27:07,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:27:07,697 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1042 transitions. [2024-10-13 06:27:07,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 06:27:07,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:27:07,699 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:27:07,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 06:27:07,699 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:27:07,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:27:07,699 INFO L85 PathProgramCache]: Analyzing trace with hash -584586431, now seen corresponding path program 1 times [2024-10-13 06:27:07,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:27:07,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713913662] [2024-10-13 06:27:07,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:27:07,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:27:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:27:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:27:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:27:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:27:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:27:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:27:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:27:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:27:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:27:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:27:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:27:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:27:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:27:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:27:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:27:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:27:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:27:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:27:07,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:27:07,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713913662] [2024-10-13 06:27:07,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713913662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:27:07,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:27:07,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:27:07,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672457569] [2024-10-13 06:27:07,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:27:07,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:27:07,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:27:07,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:27:07,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:27:07,957 INFO L87 Difference]: Start difference. First operand 847 states and 1042 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:27:08,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:27:08,259 INFO L93 Difference]: Finished difference Result 1869 states and 2288 transitions. [2024-10-13 06:27:08,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:27:08,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-10-13 06:27:08,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:27:08,265 INFO L225 Difference]: With dead ends: 1869 [2024-10-13 06:27:08,266 INFO L226 Difference]: Without dead ends: 1039 [2024-10-13 06:27:08,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:27:08,268 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 42 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:27:08,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 377 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:27:08,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2024-10-13 06:27:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 887. [2024-10-13 06:27:08,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 766 states have (on average 1.2036553524804177) internal successors, (922), 773 states have internal predecessors, (922), 82 states have call successors, (82), 38 states have call predecessors, (82), 38 states have return successors, (82), 75 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-13 06:27:08,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1086 transitions. [2024-10-13 06:27:08,354 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1086 transitions. Word has length 136 [2024-10-13 06:27:08,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:27:08,354 INFO L471 AbstractCegarLoop]: Abstraction has 887 states and 1086 transitions. [2024-10-13 06:27:08,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:27:08,355 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1086 transitions. [2024-10-13 06:27:08,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 06:27:08,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:27:08,357 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:27:08,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-13 06:27:08,357 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:27:08,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:27:08,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1016421823, now seen corresponding path program 1 times [2024-10-13 06:27:08,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:27:08,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895743116] [2024-10-13 06:27:08,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:27:08,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:27:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:08,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:27:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:08,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:27:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:08,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:27:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:08,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:27:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:08,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:27:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:08,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:27:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:08,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:27:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:08,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:27:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:08,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:27:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:08,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:27:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:08,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:27:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:08,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:27:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:08,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:27:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:08,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:27:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:08,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:27:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:08,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:27:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:08,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:27:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:27:08,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:27:08,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895743116] [2024-10-13 06:27:08,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895743116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:27:08,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:27:08,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:27:08,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857785337] [2024-10-13 06:27:08,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:27:08,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:27:08,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:27:08,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:27:08,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:27:08,985 INFO L87 Difference]: Start difference. First operand 887 states and 1086 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:27:09,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:27:09,375 INFO L93 Difference]: Finished difference Result 1736 states and 2122 transitions. [2024-10-13 06:27:09,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:27:09,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2024-10-13 06:27:09,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:27:09,382 INFO L225 Difference]: With dead ends: 1736 [2024-10-13 06:27:09,382 INFO L226 Difference]: Without dead ends: 786 [2024-10-13 06:27:09,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:27:09,385 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 66 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:27:09,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 390 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:27:09,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-10-13 06:27:09,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 784. [2024-10-13 06:27:09,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 663 states have (on average 1.1840120663650076) internal successors, (785), 670 states have internal predecessors, (785), 82 states have call successors, (82), 38 states have call predecessors, (82), 38 states have return successors, (82), 75 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-13 06:27:09,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 949 transitions. [2024-10-13 06:27:09,474 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 949 transitions. Word has length 136 [2024-10-13 06:27:09,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:27:09,474 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 949 transitions. [2024-10-13 06:27:09,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:27:09,474 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 949 transitions. [2024-10-13 06:27:09,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 06:27:09,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:27:09,476 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:27:09,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-13 06:27:09,476 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:27:09,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:27:09,477 INFO L85 PathProgramCache]: Analyzing trace with hash -642372682, now seen corresponding path program 1 times [2024-10-13 06:27:09,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:27:09,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895367763] [2024-10-13 06:27:09,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:27:09,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:27:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:10,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:27:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:10,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:27:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:10,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:27:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:10,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:27:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:10,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:27:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:10,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:27:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:10,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:27:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:10,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:27:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:10,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:27:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:10,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:27:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:10,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:27:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:10,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:27:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:10,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:27:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:10,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:27:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:10,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:27:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:10,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:27:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:10,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:27:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:10,105 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:27:10,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:27:10,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895367763] [2024-10-13 06:27:10,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895367763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:27:10,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:27:10,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:27:10,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582127198] [2024-10-13 06:27:10,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:27:10,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:27:10,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:27:10,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:27:10,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:27:10,107 INFO L87 Difference]: Start difference. First operand 784 states and 949 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:27:10,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:27:10,619 INFO L93 Difference]: Finished difference Result 1108 states and 1317 transitions. [2024-10-13 06:27:10,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:27:10,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2024-10-13 06:27:10,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:27:10,627 INFO L225 Difference]: With dead ends: 1108 [2024-10-13 06:27:10,628 INFO L226 Difference]: Without dead ends: 1106 [2024-10-13 06:27:10,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:27:10,633 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 64 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:27:10,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 710 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:27:10,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2024-10-13 06:27:10,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1102. [2024-10-13 06:27:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 921 states have (on average 1.1563517915309447) internal successors, (1065), 932 states have internal predecessors, (1065), 122 states have call successors, (122), 58 states have call predecessors, (122), 58 states have return successors, (122), 111 states have call predecessors, (122), 122 states have call successors, (122) [2024-10-13 06:27:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1309 transitions. [2024-10-13 06:27:10,793 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1309 transitions. Word has length 136 [2024-10-13 06:27:10,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:27:10,793 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1309 transitions. [2024-10-13 06:27:10,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:27:10,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1309 transitions. [2024-10-13 06:27:10,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 06:27:10,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:27:10,795 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:27:10,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-13 06:27:10,796 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:27:10,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:27:10,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1392180080, now seen corresponding path program 1 times [2024-10-13 06:27:10,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:27:10,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572570244] [2024-10-13 06:27:10,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:27:10,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:27:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:11,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:27:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:11,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:27:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:11,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:27:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:11,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:27:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:11,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:27:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:11,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:27:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:11,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:27:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:11,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:27:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:11,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:27:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:11,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:27:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:11,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:27:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:11,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:27:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:11,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:27:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:11,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:27:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:11,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:27:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:11,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:27:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:11,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:27:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:11,297 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:27:11,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:27:11,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572570244] [2024-10-13 06:27:11,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572570244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:27:11,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:27:11,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:27:11,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578504334] [2024-10-13 06:27:11,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:27:11,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:27:11,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:27:11,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:27:11,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:27:11,301 INFO L87 Difference]: Start difference. First operand 1102 states and 1309 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:27:11,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:27:11,682 INFO L93 Difference]: Finished difference Result 1923 states and 2288 transitions. [2024-10-13 06:27:11,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:27:11,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 137 [2024-10-13 06:27:11,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:27:11,688 INFO L225 Difference]: With dead ends: 1923 [2024-10-13 06:27:11,688 INFO L226 Difference]: Without dead ends: 838 [2024-10-13 06:27:11,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:27:11,692 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 70 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:27:11,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 366 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:27:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-10-13 06:27:11,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 836. [2024-10-13 06:27:11,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 695 states have (on average 1.1410071942446043) internal successors, (793), 702 states have internal predecessors, (793), 96 states have call successors, (96), 44 states have call predecessors, (96), 44 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-13 06:27:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 985 transitions. [2024-10-13 06:27:11,782 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 985 transitions. Word has length 137 [2024-10-13 06:27:11,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:27:11,783 INFO L471 AbstractCegarLoop]: Abstraction has 836 states and 985 transitions. [2024-10-13 06:27:11,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:27:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 985 transitions. [2024-10-13 06:27:11,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 06:27:11,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:27:11,785 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:27:11,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-13 06:27:11,785 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:27:11,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:27:11,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1222643622, now seen corresponding path program 1 times [2024-10-13 06:27:11,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:27:11,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350814468] [2024-10-13 06:27:11,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:27:11,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:27:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:12,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:27:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:12,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:27:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:12,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:27:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:12,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:27:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:12,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:27:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:12,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:27:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:12,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:27:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:12,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:27:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:12,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:27:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:12,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:27:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:12,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:27:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:12,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:27:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:12,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:27:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:12,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:27:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:12,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:27:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:12,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:27:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:12,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:27:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:27:12,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:27:12,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350814468] [2024-10-13 06:27:12,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350814468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:27:12,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:27:12,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:27:12,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581580488] [2024-10-13 06:27:12,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:27:12,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:27:12,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:27:12,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:27:12,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:27:12,501 INFO L87 Difference]: Start difference. First operand 836 states and 985 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:27:12,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:27:12,874 INFO L93 Difference]: Finished difference Result 1619 states and 1906 transitions. [2024-10-13 06:27:12,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:27:12,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2024-10-13 06:27:12,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:27:12,880 INFO L225 Difference]: With dead ends: 1619 [2024-10-13 06:27:12,880 INFO L226 Difference]: Without dead ends: 828 [2024-10-13 06:27:12,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:27:12,884 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 47 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:27:12,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 317 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:27:12,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2024-10-13 06:27:12,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 822. [2024-10-13 06:27:12,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 681 states have (on average 1.1277533039647578) internal successors, (768), 688 states have internal predecessors, (768), 96 states have call successors, (96), 44 states have call predecessors, (96), 44 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-13 06:27:12,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 960 transitions. [2024-10-13 06:27:12,995 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 960 transitions. Word has length 137 [2024-10-13 06:27:12,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:27:12,995 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 960 transitions. [2024-10-13 06:27:12,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:27:12,996 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 960 transitions. [2024-10-13 06:27:12,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-13 06:27:12,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:27:12,997 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:27:12,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-13 06:27:12,998 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:27:12,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:27:12,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1275761781, now seen corresponding path program 1 times [2024-10-13 06:27:12,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:27:12,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498130374] [2024-10-13 06:27:12,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:27:12,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:27:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:13,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:27:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:13,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:27:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:13,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:27:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:13,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:27:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:13,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:27:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:13,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:27:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:13,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:27:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:13,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:27:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:13,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:27:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:13,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:27:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:13,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:27:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:13,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:27:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:13,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:27:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:13,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:27:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:13,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:27:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:13,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:27:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:13,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:27:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:27:13,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:27:13,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498130374] [2024-10-13 06:27:13,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498130374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:27:13,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:27:13,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:27:13,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190260918] [2024-10-13 06:27:13,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:27:13,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:27:13,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:27:13,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:27:13,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:27:13,383 INFO L87 Difference]: Start difference. First operand 822 states and 960 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:27:13,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:27:13,693 INFO L93 Difference]: Finished difference Result 1544 states and 1804 transitions. [2024-10-13 06:27:13,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:27:13,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2024-10-13 06:27:13,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:27:13,698 INFO L225 Difference]: With dead ends: 1544 [2024-10-13 06:27:13,698 INFO L226 Difference]: Without dead ends: 767 [2024-10-13 06:27:13,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:27:13,701 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 70 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:27:13,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 372 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:27:13,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2024-10-13 06:27:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 761. [2024-10-13 06:27:13,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 620 states have (on average 1.117741935483871) internal successors, (693), 627 states have internal predecessors, (693), 96 states have call successors, (96), 44 states have call predecessors, (96), 44 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-13 06:27:13,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 885 transitions. [2024-10-13 06:27:13,799 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 885 transitions. Word has length 138 [2024-10-13 06:27:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:27:13,799 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 885 transitions. [2024-10-13 06:27:13,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:27:13,800 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 885 transitions. [2024-10-13 06:27:13,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 06:27:13,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:27:13,801 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:27:13,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-13 06:27:13,801 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:27:13,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:27:13,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1393736072, now seen corresponding path program 1 times [2024-10-13 06:27:13,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:27:13,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625157705] [2024-10-13 06:27:13,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:27:13,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:27:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat