./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.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 963153236bfee4fba7310de151468b7ab2713ef3b9442c5a0ed9bd52a1f2d263 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:11:47,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:11:47,392 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:11:47,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:11:47,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:11:47,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:11:47,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:11:47,425 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:11:47,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:11:47,427 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:11:47,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:11:47,428 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:11:47,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:11:47,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:11:47,428 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:11:47,429 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:11:47,429 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:11:47,431 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:11:47,431 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:11:47,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:11:47,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:11:47,432 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:11:47,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:11:47,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:11:47,433 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:11:47,433 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:11:47,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:11:47,433 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:11:47,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:11:47,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:11:47,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:11:47,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:11:47,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:11:47,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:11:47,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:11:47,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:11:47,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:11:47,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:11:47,436 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:11:47,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:11:47,436 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:11:47,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:11:47,436 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 -> 963153236bfee4fba7310de151468b7ab2713ef3b9442c5a0ed9bd52a1f2d263 [2024-11-09 02:11:47,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:11:47,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:11:47,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:11:47,712 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:11:47,713 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:11:47,714 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i [2024-11-09 02:11:49,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:11:49,397 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:11:49,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i [2024-11-09 02:11:49,406 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee5599618/06d3ffbc313d4b9d9a81633dd3e99d11/FLAG5779236cb [2024-11-09 02:11:49,780 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee5599618/06d3ffbc313d4b9d9a81633dd3e99d11 [2024-11-09 02:11:49,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:11:49,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:11:49,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:11:49,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:11:49,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:11:49,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:11:49" (1/1) ... [2024-11-09 02:11:49,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c5404bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:11:49, skipping insertion in model container [2024-11-09 02:11:49,796 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:11:49" (1/1) ... [2024-11-09 02:11:49,824 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:11:49,974 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i[916,929] [2024-11-09 02:11:50,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:11:50,070 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:11:50,082 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i[916,929] [2024-11-09 02:11:50,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:11:50,130 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:11:50,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:11:50 WrapperNode [2024-11-09 02:11:50,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:11:50,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:11:50,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:11:50,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:11:50,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:11:50" (1/1) ... [2024-11-09 02:11:50,152 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:11:50" (1/1) ... [2024-11-09 02:11:50,180 INFO L138 Inliner]: procedures = 30, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 641 [2024-11-09 02:11:50,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:11:50,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:11:50,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:11:50,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:11:50,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:11:50" (1/1) ... [2024-11-09 02:11:50,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:11:50" (1/1) ... [2024-11-09 02:11:50,212 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:11:50" (1/1) ... [2024-11-09 02:11:50,225 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:11:50,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:11:50" (1/1) ... [2024-11-09 02:11:50,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:11:50" (1/1) ... [2024-11-09 02:11:50,272 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:11:50" (1/1) ... [2024-11-09 02:11:50,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:11:50" (1/1) ... [2024-11-09 02:11:50,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:11:50" (1/1) ... [2024-11-09 02:11:50,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:11:50" (1/1) ... [2024-11-09 02:11:50,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:11:50,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:11:50,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:11:50,298 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:11:50,299 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:11:50" (1/1) ... [2024-11-09 02:11:50,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:11:50,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:11:50,331 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:11:50,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:11:50,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:11:50,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:11:50,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:11:50,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:11:50,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:11:50,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:11:50,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:11:50,380 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:11:50,380 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:11:50,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:11:50,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:11:50,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:11:50,481 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:11:50,482 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:11:50,987 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2024-11-09 02:11:50,987 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:11:51,001 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:11:51,002 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:11:51,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:11:51 BoogieIcfgContainer [2024-11-09 02:11:51,003 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:11:51,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:11:51,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:11:51,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:11:51,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:11:49" (1/3) ... [2024-11-09 02:11:51,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73681c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:11:51, skipping insertion in model container [2024-11-09 02:11:51,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:11:50" (2/3) ... [2024-11-09 02:11:51,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73681c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:11:51, skipping insertion in model container [2024-11-09 02:11:51,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:11:51" (3/3) ... [2024-11-09 02:11:51,009 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-3.i [2024-11-09 02:11:51,021 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:11:51,022 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:11:51,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:11:51,106 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;@48af4057, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:11:51,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:11:51,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 02:11:51,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 02:11:51,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:11:51,134 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:11:51,134 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:11:51,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:11:51,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1212346061, now seen corresponding path program 1 times [2024-11-09 02:11:51,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:11:51,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989362204] [2024-11-09 02:11:51,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:11:51,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:11:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:51,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:11:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:51,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:11:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:51,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:11:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:51,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:11:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:51,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:11:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:51,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:11:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:51,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:11:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:51,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:11:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:51,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:11:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:51,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:11:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:51,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:11:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:51,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:11:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:51,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:11:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:51,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:11:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:51,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:11:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:51,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:11:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:51,889 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:11:51,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:11:51,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989362204] [2024-11-09 02:11:51,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989362204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:11:51,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:11:51,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:11:51,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063706440] [2024-11-09 02:11:51,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:11:51,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:11:51,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:11:51,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:11:51,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:11:51,915 INFO L87 Difference]: Start difference. First operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:11:51,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:11:51,963 INFO L93 Difference]: Finished difference Result 293 states and 457 transitions. [2024-11-09 02:11:51,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:11:51,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-09 02:11:51,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:11:51,973 INFO L225 Difference]: With dead ends: 293 [2024-11-09 02:11:51,974 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 02:11:51,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:11:51,979 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:11:51,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:11:51,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 02:11:52,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-09 02:11:52,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 129 states have (on average 1.434108527131783) internal successors, (185), 129 states have internal predecessors, (185), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 02:11:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 217 transitions. [2024-11-09 02:11:52,020 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 217 transitions. Word has length 133 [2024-11-09 02:11:52,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:11:52,022 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 217 transitions. [2024-11-09 02:11:52,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:11:52,023 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 217 transitions. [2024-11-09 02:11:52,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 02:11:52,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:11:52,025 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:11:52,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:11:52,026 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:11:52,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:11:52,026 INFO L85 PathProgramCache]: Analyzing trace with hash -500527483, now seen corresponding path program 1 times [2024-11-09 02:11:52,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:11:52,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578823820] [2024-11-09 02:11:52,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:11:52,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:11:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:52,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:11:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:52,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:11:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:52,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:11:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:52,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:11:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:52,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:11:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:52,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:11:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:52,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:11:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:52,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:11:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:52,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:11:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:52,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:11:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:52,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:11:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:52,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:11:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:52,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:11:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:52,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:11:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:52,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:11:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:52,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:11:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:52,200 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:11:52,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:11:52,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578823820] [2024-11-09 02:11:52,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578823820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:11:52,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:11:52,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:11:52,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836972071] [2024-11-09 02:11:52,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:11:52,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:11:52,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:11:52,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:11:52,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:11:52,203 INFO L87 Difference]: Start difference. First operand 147 states and 217 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:11:52,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:11:52,234 INFO L93 Difference]: Finished difference Result 368 states and 546 transitions. [2024-11-09 02:11:52,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:11:52,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-09 02:11:52,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:11:52,236 INFO L225 Difference]: With dead ends: 368 [2024-11-09 02:11:52,236 INFO L226 Difference]: Without dead ends: 224 [2024-11-09 02:11:52,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:11:52,238 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 114 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:11:52,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 412 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:11:52,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-09 02:11:52,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 179. [2024-11-09 02:11:52,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 161 states have (on average 1.453416149068323) internal successors, (234), 161 states have internal predecessors, (234), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 02:11:52,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 266 transitions. [2024-11-09 02:11:52,250 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 266 transitions. Word has length 135 [2024-11-09 02:11:52,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:11:52,251 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 266 transitions. [2024-11-09 02:11:52,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:11:52,251 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 266 transitions. [2024-11-09 02:11:52,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 02:11:52,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:11:52,254 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:11:52,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:11:52,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:11:52,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:11:52,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1678409010, now seen corresponding path program 1 times [2024-11-09 02:11:52,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:11:52,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456575861] [2024-11-09 02:11:52,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:11:52,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:11:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:53,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:11:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:53,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:11:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:53,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:11:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:53,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:11:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:53,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:11:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:53,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:11:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:53,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:11:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:53,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:11:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:53,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:11:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:53,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:11:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:53,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:11:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:53,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:11:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:53,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:11:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:53,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:11:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:53,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:11:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:53,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:11:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:53,791 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:11:53,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:11:53,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456575861] [2024-11-09 02:11:53,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456575861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:11:53,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:11:53,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:11:53,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097722852] [2024-11-09 02:11:53,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:11:53,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:11:53,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:11:53,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:11:53,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:11:53,796 INFO L87 Difference]: Start difference. First operand 179 states and 266 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:11:54,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:11:54,047 INFO L93 Difference]: Finished difference Result 436 states and 650 transitions. [2024-11-09 02:11:54,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:11:54,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 135 [2024-11-09 02:11:54,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:11:54,052 INFO L225 Difference]: With dead ends: 436 [2024-11-09 02:11:54,054 INFO L226 Difference]: Without dead ends: 260 [2024-11-09 02:11:54,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:11:54,056 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 97 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:11:54,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 504 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:11:54,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-09 02:11:54,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 248. [2024-11-09 02:11:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 213 states have (on average 1.4178403755868545) internal successors, (302), 213 states have internal predecessors, (302), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 02:11:54,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 366 transitions. [2024-11-09 02:11:54,080 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 366 transitions. Word has length 135 [2024-11-09 02:11:54,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:11:54,080 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 366 transitions. [2024-11-09 02:11:54,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:11:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 366 transitions. [2024-11-09 02:11:54,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 02:11:54,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:11:54,083 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:11:54,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:11:54,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:11:54,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:11:54,084 INFO L85 PathProgramCache]: Analyzing trace with hash 741335402, now seen corresponding path program 1 times [2024-11-09 02:11:54,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:11:54,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133002646] [2024-11-09 02:11:54,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:11:54,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:11:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:55,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:11:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:55,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:11:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:55,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:11:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:55,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:11:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:55,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:11:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:55,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:11:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:55,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:11:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:55,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:11:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:55,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:11:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:55,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:11:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:55,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:11:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:55,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:11:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:55,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:11:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:55,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:11:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:55,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:11:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:55,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:11:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:55,299 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-09 02:11:55,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:11:55,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133002646] [2024-11-09 02:11:55,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133002646] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:11:55,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827449747] [2024-11-09 02:11:55,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:11:55,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:11:55,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:11:55,302 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:11:55,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 02:11:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:11:55,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 02:11:55,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:11:57,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 02:11:57,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:11:57,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:11:57,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:11:57,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2024-11-09 02:11:57,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:11:57,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:11:57,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:11:57,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:11:57,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:11:57,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:11:57,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2024-11-09 02:11:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:11:58,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:11:58,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827449747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:11:58,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 02:11:58,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2024-11-09 02:11:58,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796776086] [2024-11-09 02:11:58,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:11:58,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 02:11:58,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:11:58,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 02:11:58,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2024-11-09 02:11:58,113 INFO L87 Difference]: Start difference. First operand 248 states and 366 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:11:58,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:11:58,863 INFO L93 Difference]: Finished difference Result 524 states and 777 transitions. [2024-11-09 02:11:58,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:11:58,864 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-09 02:11:58,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:11:58,866 INFO L225 Difference]: With dead ends: 524 [2024-11-09 02:11:58,866 INFO L226 Difference]: Without dead ends: 348 [2024-11-09 02:11:58,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2024-11-09 02:11:58,868 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 313 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 02:11:58,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1476 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 02:11:58,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-09 02:11:58,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 306. [2024-11-09 02:11:58,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 271 states have (on average 1.4354243542435425) internal successors, (389), 271 states have internal predecessors, (389), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 02:11:58,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 453 transitions. [2024-11-09 02:11:58,894 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 453 transitions. Word has length 136 [2024-11-09 02:11:58,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:11:58,895 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 453 transitions. [2024-11-09 02:11:58,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:11:58,895 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 453 transitions. [2024-11-09 02:11:58,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 02:11:58,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:11:58,897 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:11:58,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 02:11:59,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:11:59,099 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:11:59,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:11:59,100 INFO L85 PathProgramCache]: Analyzing trace with hash -608558604, now seen corresponding path program 1 times [2024-11-09 02:11:59,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:11:59,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607786275] [2024-11-09 02:11:59,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:11:59,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:11:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:00,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:12:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:00,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:12:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:00,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:12:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:00,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:12:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:00,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:12:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:00,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:12:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:00,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:12:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:00,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:12:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:00,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:12:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:00,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:12:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:00,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:12:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:00,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:12:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:00,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:12:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:00,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:12:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:00,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:12:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:00,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:12:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:12:00,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:12:00,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607786275] [2024-11-09 02:12:00,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607786275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:12:00,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:12:00,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:12:00,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020560133] [2024-11-09 02:12:00,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:12:00,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:12:00,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:12:00,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:12:00,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:12:00,563 INFO L87 Difference]: Start difference. First operand 306 states and 453 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:12:00,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:12:00,984 INFO L93 Difference]: Finished difference Result 771 states and 1150 transitions. [2024-11-09 02:12:00,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:12:00,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 137 [2024-11-09 02:12:00,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:12:00,988 INFO L225 Difference]: With dead ends: 771 [2024-11-09 02:12:00,989 INFO L226 Difference]: Without dead ends: 537 [2024-11-09 02:12:00,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:12:00,992 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 163 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:12:00,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 819 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:12:00,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-11-09 02:12:01,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 472. [2024-11-09 02:12:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 420 states have (on average 1.4404761904761905) internal successors, (605), 420 states have internal predecessors, (605), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 02:12:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 701 transitions. [2024-11-09 02:12:01,036 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 701 transitions. Word has length 137 [2024-11-09 02:12:01,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:12:01,036 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 701 transitions. [2024-11-09 02:12:01,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:12:01,037 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 701 transitions. [2024-11-09 02:12:01,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 02:12:01,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:12:01,039 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:12:01,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:12:01,039 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:12:01,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:12:01,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1514344948, now seen corresponding path program 1 times [2024-11-09 02:12:01,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:12:01,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875725476] [2024-11-09 02:12:01,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:12:01,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:12:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:12:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:12:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:12:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:12:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:12:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:12:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:12:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:12:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:12:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:12:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:12:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:12:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:12:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:12:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:12:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:12:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:12:01,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:12:01,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875725476] [2024-11-09 02:12:01,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875725476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:12:01,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:12:01,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:12:01,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965855842] [2024-11-09 02:12:01,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:12:01,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:12:01,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:12:01,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:12:01,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:12:01,241 INFO L87 Difference]: Start difference. First operand 472 states and 701 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:12:01,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:12:01,288 INFO L93 Difference]: Finished difference Result 881 states and 1311 transitions. [2024-11-09 02:12:01,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:12:01,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-09 02:12:01,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:12:01,292 INFO L225 Difference]: With dead ends: 881 [2024-11-09 02:12:01,292 INFO L226 Difference]: Without dead ends: 481 [2024-11-09 02:12:01,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:12:01,295 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:12:01,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 833 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:12:01,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-11-09 02:12:01,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 475. [2024-11-09 02:12:01,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 423 states have (on average 1.4373522458628842) internal successors, (608), 423 states have internal predecessors, (608), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 02:12:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 704 transitions. [2024-11-09 02:12:01,329 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 704 transitions. Word has length 137 [2024-11-09 02:12:01,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:12:01,330 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 704 transitions. [2024-11-09 02:12:01,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:12:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 704 transitions. [2024-11-09 02:12:01,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 02:12:01,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:12:01,332 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:12:01,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:12:01,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:12:01,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:12:01,333 INFO L85 PathProgramCache]: Analyzing trace with hash -285582379, now seen corresponding path program 1 times [2024-11-09 02:12:01,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:12:01,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219347584] [2024-11-09 02:12:01,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:12:01,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:12:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:12:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:12:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:12:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:12:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:12:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:12:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:12:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:12:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:12:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:12:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:12:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:12:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:12:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:12:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:12:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:12:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:12:01,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:12:01,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219347584] [2024-11-09 02:12:01,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219347584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:12:01,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:12:01,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:12:01,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667240595] [2024-11-09 02:12:01,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:12:01,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:12:01,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:12:01,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:12:01,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:12:01,615 INFO L87 Difference]: Start difference. First operand 475 states and 704 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:12:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:12:01,689 INFO L93 Difference]: Finished difference Result 884 states and 1313 transitions. [2024-11-09 02:12:01,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:12:01,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-09 02:12:01,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:12:01,694 INFO L225 Difference]: With dead ends: 884 [2024-11-09 02:12:01,694 INFO L226 Difference]: Without dead ends: 481 [2024-11-09 02:12:01,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:12:01,696 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:12:01,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 832 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:12:01,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-11-09 02:12:01,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2024-11-09 02:12:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 429 states have (on average 1.4312354312354312) internal successors, (614), 429 states have internal predecessors, (614), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 02:12:01,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 710 transitions. [2024-11-09 02:12:01,740 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 710 transitions. Word has length 138 [2024-11-09 02:12:01,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:12:01,743 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 710 transitions. [2024-11-09 02:12:01,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:12:01,743 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 710 transitions. [2024-11-09 02:12:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 02:12:01,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:12:01,745 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:12:01,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:12:01,746 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:12:01,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:12:01,746 INFO L85 PathProgramCache]: Analyzing trace with hash 903635364, now seen corresponding path program 1 times [2024-11-09 02:12:01,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:12:01,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92897670] [2024-11-09 02:12:01,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:12:01,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:12:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:02,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:12:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:02,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:12:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:02,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:12:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:02,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:12:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:02,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:12:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:02,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:12:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:02,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:12:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:02,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:12:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:02,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:12:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:02,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:12:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:02,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:12:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:02,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:12:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:02,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:12:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:02,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:12:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:02,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:12:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:02,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:12:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:02,582 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:12:02,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:12:02,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92897670] [2024-11-09 02:12:02,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92897670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:12:02,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:12:02,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:12:02,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045400256] [2024-11-09 02:12:02,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:12:02,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:12:02,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:12:02,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:12:02,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:12:02,585 INFO L87 Difference]: Start difference. First operand 481 states and 710 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:12:03,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:12:03,083 INFO L93 Difference]: Finished difference Result 930 states and 1372 transitions. [2024-11-09 02:12:03,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:12:03,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-09 02:12:03,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:12:03,086 INFO L225 Difference]: With dead ends: 930 [2024-11-09 02:12:03,086 INFO L226 Difference]: Without dead ends: 691 [2024-11-09 02:12:03,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:12:03,089 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 711 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:12:03,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 861 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:12:03,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-11-09 02:12:03,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 541. [2024-11-09 02:12:03,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 489 states have (on average 1.4396728016359919) internal successors, (704), 489 states have internal predecessors, (704), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 02:12:03,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 800 transitions. [2024-11-09 02:12:03,121 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 800 transitions. Word has length 138 [2024-11-09 02:12:03,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:12:03,122 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 800 transitions. [2024-11-09 02:12:03,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:12:03,122 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 800 transitions. [2024-11-09 02:12:03,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 02:12:03,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:12:03,124 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:12:03,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 02:12:03,124 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:12:03,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:12:03,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1188514192, now seen corresponding path program 1 times [2024-11-09 02:12:03,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:12:03,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422247577] [2024-11-09 02:12:03,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:12:03,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:12:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:03,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:12:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:03,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:12:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:03,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:12:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:03,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:12:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:03,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:12:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:03,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:12:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:03,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:12:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:03,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:12:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:03,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:12:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:03,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:12:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:03,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:12:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:03,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:12:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:03,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:12:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:03,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:12:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:03,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:12:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:03,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:12:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:03,792 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:12:03,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:12:03,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422247577] [2024-11-09 02:12:03,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422247577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:12:03,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:12:03,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:12:03,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112296663] [2024-11-09 02:12:03,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:12:03,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:12:03,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:12:03,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:12:03,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:12:03,794 INFO L87 Difference]: Start difference. First operand 541 states and 800 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:12:04,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:12:04,181 INFO L93 Difference]: Finished difference Result 990 states and 1461 transitions. [2024-11-09 02:12:04,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:12:04,182 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-09 02:12:04,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:12:04,186 INFO L225 Difference]: With dead ends: 990 [2024-11-09 02:12:04,186 INFO L226 Difference]: Without dead ends: 691 [2024-11-09 02:12:04,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:12:04,188 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 566 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:12:04,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 965 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:12:04,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-11-09 02:12:04,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 601. [2024-11-09 02:12:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 549 states have (on average 1.4462659380692167) internal successors, (794), 549 states have internal predecessors, (794), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 02:12:04,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 890 transitions. [2024-11-09 02:12:04,211 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 890 transitions. Word has length 138 [2024-11-09 02:12:04,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:12:04,211 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 890 transitions. [2024-11-09 02:12:04,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:12:04,211 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 890 transitions. [2024-11-09 02:12:04,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 02:12:04,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:12:04,213 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:12:04,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 02:12:04,213 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:12:04,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:12:04,213 INFO L85 PathProgramCache]: Analyzing trace with hash 735618990, now seen corresponding path program 1 times [2024-11-09 02:12:04,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:12:04,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666647454] [2024-11-09 02:12:04,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:12:04,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:12:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:06,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:12:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:06,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:12:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:06,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:12:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:06,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:12:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:06,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:12:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:06,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:12:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:06,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:12:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:06,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:12:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:06,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:12:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:06,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:12:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:06,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:12:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:06,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:12:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:06,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:12:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:06,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:12:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:06,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:12:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:06,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:12:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:06,807 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:12:06,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:12:06,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666647454] [2024-11-09 02:12:06,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666647454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:12:06,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:12:06,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 02:12:06,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257870908] [2024-11-09 02:12:06,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:12:06,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 02:12:06,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:12:06,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 02:12:06,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:12:06,809 INFO L87 Difference]: Start difference. First operand 601 states and 890 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:12:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:12:08,122 INFO L93 Difference]: Finished difference Result 1400 states and 2071 transitions. [2024-11-09 02:12:08,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 02:12:08,122 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2024-11-09 02:12:08,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:12:08,125 INFO L225 Difference]: With dead ends: 1400 [2024-11-09 02:12:08,125 INFO L226 Difference]: Without dead ends: 871 [2024-11-09 02:12:08,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2024-11-09 02:12:08,126 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 552 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 02:12:08,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 2017 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 02:12:08,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-11-09 02:12:08,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 782. [2024-11-09 02:12:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 730 states have (on average 1.4547945205479451) internal successors, (1062), 730 states have internal predecessors, (1062), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 02:12:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1158 transitions. [2024-11-09 02:12:08,157 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1158 transitions. Word has length 139 [2024-11-09 02:12:08,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:12:08,159 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 1158 transitions. [2024-11-09 02:12:08,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:12:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1158 transitions. [2024-11-09 02:12:08,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 02:12:08,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:12:08,160 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:12:08,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 02:12:08,161 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:12:08,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:12:08,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1436683568, now seen corresponding path program 1 times [2024-11-09 02:12:08,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:12:08,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035854173] [2024-11-09 02:12:08,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:12:08,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:12:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:08,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:12:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:08,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:12:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:08,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:12:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:08,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:12:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:08,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:12:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:08,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:12:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:08,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:12:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:08,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:12:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:08,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:12:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:08,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:12:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:08,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:12:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:08,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:12:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:08,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:12:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:08,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:12:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:08,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:12:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:08,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:12:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:08,899 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:12:08,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:12:08,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035854173] [2024-11-09 02:12:08,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035854173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:12:08,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:12:08,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:12:08,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305678451] [2024-11-09 02:12:08,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:12:08,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:12:08,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:12:08,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:12:08,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:12:08,902 INFO L87 Difference]: Start difference. First operand 782 states and 1158 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:12:09,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:12:09,483 INFO L93 Difference]: Finished difference Result 1622 states and 2391 transitions. [2024-11-09 02:12:09,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:12:09,483 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2024-11-09 02:12:09,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:12:09,487 INFO L225 Difference]: With dead ends: 1622 [2024-11-09 02:12:09,487 INFO L226 Difference]: Without dead ends: 912 [2024-11-09 02:12:09,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-09 02:12:09,489 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 545 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:12:09,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 663 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:12:09,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2024-11-09 02:12:09,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 908. [2024-11-09 02:12:09,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 837 states have (on average 1.4372759856630823) internal successors, (1203), 839 states have internal predecessors, (1203), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-09 02:12:09,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1331 transitions. [2024-11-09 02:12:09,541 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1331 transitions. Word has length 139 [2024-11-09 02:12:09,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:12:09,541 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1331 transitions. [2024-11-09 02:12:09,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:12:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1331 transitions. [2024-11-09 02:12:09,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 02:12:09,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:12:09,544 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:12:09,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 02:12:09,544 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:12:09,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:12:09,544 INFO L85 PathProgramCache]: Analyzing trace with hash -82029460, now seen corresponding path program 1 times [2024-11-09 02:12:09,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:12:09,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689957835] [2024-11-09 02:12:09,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:12:09,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:12:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:10,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:12:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:10,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:12:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:10,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:12:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:10,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:12:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:10,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:12:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:10,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:12:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:10,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:12:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:10,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:12:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:10,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:12:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:10,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:12:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:10,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:12:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:10,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:12:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:10,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:12:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:10,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:12:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:10,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:12:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:10,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:12:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:10,205 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:12:10,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:12:10,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689957835] [2024-11-09 02:12:10,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689957835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:12:10,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:12:10,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:12:10,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589745670] [2024-11-09 02:12:10,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:12:10,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:12:10,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:12:10,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:12:10,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:12:10,206 INFO L87 Difference]: Start difference. First operand 908 states and 1331 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:12:10,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:12:10,716 INFO L93 Difference]: Finished difference Result 1924 states and 2819 transitions. [2024-11-09 02:12:10,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:12:10,717 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2024-11-09 02:12:10,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:12:10,723 INFO L225 Difference]: With dead ends: 1924 [2024-11-09 02:12:10,723 INFO L226 Difference]: Without dead ends: 1092 [2024-11-09 02:12:10,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-09 02:12:10,725 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 290 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:12:10,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 967 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:12:10,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2024-11-09 02:12:10,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 969. [2024-11-09 02:12:10,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 898 states have (on average 1.4387527839643652) internal successors, (1292), 900 states have internal predecessors, (1292), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-09 02:12:10,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1420 transitions. [2024-11-09 02:12:10,798 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1420 transitions. Word has length 139 [2024-11-09 02:12:10,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:12:10,798 INFO L471 AbstractCegarLoop]: Abstraction has 969 states and 1420 transitions. [2024-11-09 02:12:10,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:12:10,799 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1420 transitions. [2024-11-09 02:12:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 02:12:10,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:12:10,801 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:12:10,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 02:12:10,801 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:12:10,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:12:10,802 INFO L85 PathProgramCache]: Analyzing trace with hash 619035118, now seen corresponding path program 1 times [2024-11-09 02:12:10,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:12:10,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27134742] [2024-11-09 02:12:10,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:12:10,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:12:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:12,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:12:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:12,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:12:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:12,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:12:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:12,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:12:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:12,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:12:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:12,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:12:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:12,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:12:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:12,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:12:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:12,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:12:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:12,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:12:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:12,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:12:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:12,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:12:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:12,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:12:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:12,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:12:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:12,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:12:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:12,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:12:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:12:12,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:12:12,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27134742] [2024-11-09 02:12:12,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27134742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:12:12,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:12:12,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 02:12:12,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153863673] [2024-11-09 02:12:12,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:12:12,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 02:12:12,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:12:12,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 02:12:12,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:12:12,906 INFO L87 Difference]: Start difference. First operand 969 states and 1420 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:12:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:12:14,284 INFO L93 Difference]: Finished difference Result 1950 states and 2859 transitions. [2024-11-09 02:12:14,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 02:12:14,285 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2024-11-09 02:12:14,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:12:14,289 INFO L225 Difference]: With dead ends: 1950 [2024-11-09 02:12:14,290 INFO L226 Difference]: Without dead ends: 1057 [2024-11-09 02:12:14,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2024-11-09 02:12:14,292 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 422 mSDsluCounter, 1945 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 02:12:14,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 2196 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 02:12:14,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2024-11-09 02:12:14,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 966. [2024-11-09 02:12:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 895 states have (on average 1.440223463687151) internal successors, (1289), 897 states have internal predecessors, (1289), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-09 02:12:14,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1417 transitions. [2024-11-09 02:12:14,343 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1417 transitions. Word has length 139 [2024-11-09 02:12:14,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:12:14,344 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1417 transitions. [2024-11-09 02:12:14,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:12:14,344 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1417 transitions. [2024-11-09 02:12:14,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 02:12:14,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:12:14,346 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:12:14,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 02:12:14,346 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:12:14,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:12:14,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1014010927, now seen corresponding path program 1 times [2024-11-09 02:12:14,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:12:14,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398939033] [2024-11-09 02:12:14,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:12:14,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:12:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:14,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:12:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:14,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:12:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:14,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:12:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:14,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:12:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:14,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:12:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:14,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:12:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:14,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:12:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:14,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:12:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:14,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:12:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:14,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:12:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:14,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:12:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:14,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:12:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:14,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:12:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:14,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:12:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:14,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:12:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:14,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:12:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:14,417 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:12:14,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:12:14,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398939033] [2024-11-09 02:12:14,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398939033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:12:14,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:12:14,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:12:14,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747898059] [2024-11-09 02:12:14,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:12:14,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:12:14,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:12:14,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:12:14,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:12:14,420 INFO L87 Difference]: Start difference. First operand 966 states and 1417 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:12:14,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:12:14,513 INFO L93 Difference]: Finished difference Result 2012 states and 2939 transitions. [2024-11-09 02:12:14,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:12:14,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-09 02:12:14,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:12:14,517 INFO L225 Difference]: With dead ends: 2012 [2024-11-09 02:12:14,517 INFO L226 Difference]: Without dead ends: 1122 [2024-11-09 02:12:14,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:12:14,519 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 104 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:12:14,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 510 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:12:14,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2024-11-09 02:12:14,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 917. [2024-11-09 02:12:14,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 846 states have (on average 1.41725768321513) internal successors, (1199), 848 states have internal predecessors, (1199), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-09 02:12:14,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1327 transitions. [2024-11-09 02:12:14,581 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1327 transitions. Word has length 139 [2024-11-09 02:12:14,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:12:14,581 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1327 transitions. [2024-11-09 02:12:14,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 02:12:14,582 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1327 transitions. [2024-11-09 02:12:14,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 02:12:14,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:12:14,583 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:12:14,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 02:12:14,584 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:12:14,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:12:14,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1227230246, now seen corresponding path program 1 times [2024-11-09 02:12:14,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:12:14,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908534843] [2024-11-09 02:12:14,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:12:14,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:12:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:16,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:12:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:16,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:12:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:16,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:12:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:16,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:12:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:16,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:12:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:16,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:12:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:16,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:12:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:16,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:12:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:16,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:12:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:16,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:12:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:16,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:12:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:16,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:12:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:16,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:12:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:16,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:12:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:16,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:12:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:16,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:12:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:12:16,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:12:16,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908534843] [2024-11-09 02:12:16,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908534843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:12:16,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:12:16,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 02:12:16,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900154568] [2024-11-09 02:12:16,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:12:16,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 02:12:16,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:12:16,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 02:12:16,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-09 02:12:16,441 INFO L87 Difference]: Start difference. First operand 917 states and 1327 transitions. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 02:12:17,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:12:17,808 INFO L93 Difference]: Finished difference Result 1542 states and 2230 transitions. [2024-11-09 02:12:17,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 02:12:17,808 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 140 [2024-11-09 02:12:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:12:17,811 INFO L225 Difference]: With dead ends: 1542 [2024-11-09 02:12:17,812 INFO L226 Difference]: Without dead ends: 1033 [2024-11-09 02:12:17,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2024-11-09 02:12:17,813 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 726 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 02:12:17,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1426 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 02:12:17,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2024-11-09 02:12:17,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1021. [2024-11-09 02:12:17,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 947 states have (on average 1.4181626187961984) internal successors, (1343), 950 states have internal predecessors, (1343), 66 states have call successors, (66), 7 states have call predecessors, (66), 7 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 02:12:17,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1475 transitions. [2024-11-09 02:12:17,872 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1475 transitions. Word has length 140 [2024-11-09 02:12:17,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:12:17,873 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1475 transitions. [2024-11-09 02:12:17,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 02:12:17,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1475 transitions. [2024-11-09 02:12:17,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 02:12:17,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:12:17,875 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:12:17,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 02:12:17,875 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:12:17,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:12:17,875 INFO L85 PathProgramCache]: Analyzing trace with hash -392576892, now seen corresponding path program 1 times [2024-11-09 02:12:17,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:12:17,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588213297] [2024-11-09 02:12:17,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:12:17,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:12:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:19,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:12:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:19,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:12:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:19,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:12:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:19,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:12:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:19,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:12:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:19,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:12:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:19,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:12:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:19,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:12:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:19,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:12:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:19,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:12:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:19,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:12:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:19,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:12:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:19,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:12:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:19,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:12:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:19,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:12:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:19,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:12:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:12:19,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:12:19,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588213297] [2024-11-09 02:12:19,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588213297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:12:19,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:12:19,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:12:19,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427790361] [2024-11-09 02:12:19,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:12:19,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:12:19,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:12:19,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:12:19,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:12:19,562 INFO L87 Difference]: Start difference. First operand 1021 states and 1475 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:12:20,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:12:20,155 INFO L93 Difference]: Finished difference Result 1739 states and 2508 transitions. [2024-11-09 02:12:20,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:12:20,156 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2024-11-09 02:12:20,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:12:20,163 INFO L225 Difference]: With dead ends: 1739 [2024-11-09 02:12:20,163 INFO L226 Difference]: Without dead ends: 1126 [2024-11-09 02:12:20,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:12:20,165 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 578 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:12:20,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 663 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:12:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2024-11-09 02:12:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1122. [2024-11-09 02:12:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1038 states have (on average 1.4113680154142583) internal successors, (1465), 1043 states have internal predecessors, (1465), 74 states have call successors, (74), 9 states have call predecessors, (74), 9 states have return successors, (74), 69 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-09 02:12:20,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1613 transitions. [2024-11-09 02:12:20,248 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1613 transitions. Word has length 140 [2024-11-09 02:12:20,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:12:20,249 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1613 transitions. [2024-11-09 02:12:20,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:12:20,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1613 transitions. [2024-11-09 02:12:20,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-09 02:12:20,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:12:20,251 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:12:20,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 02:12:20,252 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:12:20,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:12:20,252 INFO L85 PathProgramCache]: Analyzing trace with hash 921922377, now seen corresponding path program 1 times [2024-11-09 02:12:20,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:12:20,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589290764] [2024-11-09 02:12:20,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:12:20,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:12:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:21,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:12:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:21,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:12:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:21,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:12:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:21,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:12:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:21,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:12:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:21,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:12:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:21,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:12:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:21,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:12:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:21,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:12:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:21,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:12:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:21,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:12:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:21,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:12:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:21,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:12:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:21,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:12:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:21,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:12:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:21,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:12:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:21,154 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-09 02:12:21,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:12:21,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589290764] [2024-11-09 02:12:21,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589290764] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:12:21,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018891832] [2024-11-09 02:12:21,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:12:21,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:12:21,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:12:21,159 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:12:21,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 02:12:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:21,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-09 02:12:21,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:12:21,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2024-11-09 02:12:21,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 104 treesize of output 76 [2024-11-09 02:12:22,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 02:12:22,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 02:12:23,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 02:12:23,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 02:12:23,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 02:12:23,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 02:12:24,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 02:12:24,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 02:12:24,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 02:12:25,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 41 [2024-11-09 02:12:25,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:12:25,468 INFO L349 Elim1Store]: treesize reduction 74, result has 51.3 percent of original size [2024-11-09 02:12:25,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 38 treesize of output 102