./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-33.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 a748a59f07e4b223740bdd1b062749131146e39483e646914db65f28461caf78 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:15:40,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:15:40,723 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 05:15:40,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:15:40,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:15:40,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:15:40,762 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:15:40,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:15:40,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:15:40,766 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:15:40,766 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:15:40,766 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:15:40,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:15:40,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:15:40,771 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:15:40,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:15:40,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:15:40,772 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:15:40,773 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 05:15:40,773 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:15:40,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:15:40,774 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:15:40,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:15:40,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:15:40,774 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:15:40,775 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:15:40,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:15:40,775 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:15:40,775 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:15:40,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:15:40,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:15:40,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:15:40,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:15:40,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:15:40,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:15:40,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:15:40,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 05:15:40,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 05:15:40,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:15:40,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:15:40,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:15:40,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:15:40,780 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 -> a748a59f07e4b223740bdd1b062749131146e39483e646914db65f28461caf78 [2024-11-10 05:15:41,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:15:41,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:15:41,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:15:41,149 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:15:41,150 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:15:41,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-33.i [2024-11-10 05:15:42,743 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:15:42,969 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:15:42,970 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-33.i [2024-11-10 05:15:42,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5e422fb/35fadd8e6dd84677957d457649f28e1a/FLAG4bcc61bd1 [2024-11-10 05:15:43,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5e422fb/35fadd8e6dd84677957d457649f28e1a [2024-11-10 05:15:43,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:15:43,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:15:43,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:15:43,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:15:43,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:15:43,019 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:15:43" (1/1) ... [2024-11-10 05:15:43,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ce255d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:15:43, skipping insertion in model container [2024-11-10 05:15:43,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:15:43" (1/1) ... [2024-11-10 05:15:43,055 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:15:43,209 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_fillercode_fillercodestructure_filler-pe-co_file-33.i[919,932] [2024-11-10 05:15:43,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:15:43,335 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:15:43,347 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_fillercode_fillercodestructure_filler-pe-co_file-33.i[919,932] [2024-11-10 05:15:43,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:15:43,431 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:15:43,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:15:43 WrapperNode [2024-11-10 05:15:43,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:15:43,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:15:43,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:15:43,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:15:43,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:15:43" (1/1) ... [2024-11-10 05:15:43,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:15:43" (1/1) ... [2024-11-10 05:15:43,489 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 225 [2024-11-10 05:15:43,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:15:43,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:15:43,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:15:43,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:15:43,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:15:43" (1/1) ... [2024-11-10 05:15:43,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:15:43" (1/1) ... [2024-11-10 05:15:43,506 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:15:43" (1/1) ... [2024-11-10 05:15:43,533 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 05:15:43,533 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:15:43" (1/1) ... [2024-11-10 05:15:43,533 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:15:43" (1/1) ... [2024-11-10 05:15:43,543 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:15:43" (1/1) ... [2024-11-10 05:15:43,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:15:43" (1/1) ... [2024-11-10 05:15:43,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:15:43" (1/1) ... [2024-11-10 05:15:43,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:15:43" (1/1) ... [2024-11-10 05:15:43,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:15:43,554 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:15:43,554 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:15:43,554 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:15:43,555 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:15:43" (1/1) ... [2024-11-10 05:15:43,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:15:43,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:15:43,603 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 05:15:43,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 05:15:43,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:15:43,652 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:15:43,653 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:15:43,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 05:15:43,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:15:43,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:15:43,788 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:15:43,790 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:15:44,186 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L184: havoc property_#t~ite23#1;havoc property_#t~bitwise22#1; [2024-11-10 05:15:44,233 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-10 05:15:44,234 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:15:44,260 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:15:44,260 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:15:44,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:15:44 BoogieIcfgContainer [2024-11-10 05:15:44,262 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:15:44,264 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:15:44,265 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:15:44,268 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:15:44,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:15:43" (1/3) ... [2024-11-10 05:15:44,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e5fb43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:15:44, skipping insertion in model container [2024-11-10 05:15:44,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:15:43" (2/3) ... [2024-11-10 05:15:44,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e5fb43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:15:44, skipping insertion in model container [2024-11-10 05:15:44,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:15:44" (3/3) ... [2024-11-10 05:15:44,273 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-33.i [2024-11-10 05:15:44,291 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:15:44,292 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:15:44,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:15:44,364 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;@283d1a8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:15:44,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:15:44,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 67 states have internal predecessors, (93), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 05:15:44,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 05:15:44,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:15:44,390 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:15:44,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:15:44,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:15:44,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1155650211, now seen corresponding path program 1 times [2024-11-10 05:15:44,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:15:44,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5094828] [2024-11-10 05:15:44,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:15:44,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:15:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:15:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:15:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:15:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:15:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:15:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 05:15:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:15:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:15:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:15:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 05:15:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:15:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:15:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:15:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 05:15:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:15:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:15:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:15:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:15:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:15:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:15:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:15:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:15:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:15:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:15:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 05:15:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:15:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 05:15:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 05:15:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 05:15:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 05:15:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 05:15:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 05:15:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 05:15:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 05:15:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:44,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-10 05:15:44,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:15:44,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5094828] [2024-11-10 05:15:44,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5094828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:15:44,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:15:44,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:15:44,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550543899] [2024-11-10 05:15:44,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:15:44,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:15:44,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:15:44,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:15:44,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:15:44,956 INFO L87 Difference]: Start difference. First operand has 103 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 67 states have internal predecessors, (93), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-10 05:15:45,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:15:45,006 INFO L93 Difference]: Finished difference Result 196 states and 345 transitions. [2024-11-10 05:15:45,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:15:45,010 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 215 [2024-11-10 05:15:45,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:15:45,020 INFO L225 Difference]: With dead ends: 196 [2024-11-10 05:15:45,021 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 05:15:45,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:15:45,028 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:15:45,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:15:45,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 05:15:45,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-10 05:15:45,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 05:15:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 146 transitions. [2024-11-10 05:15:45,083 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 146 transitions. Word has length 215 [2024-11-10 05:15:45,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:15:45,084 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 146 transitions. [2024-11-10 05:15:45,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-10 05:15:45,084 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 146 transitions. [2024-11-10 05:15:45,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 05:15:45,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:15:45,093 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:15:45,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 05:15:45,096 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:15:45,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:15:45,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1832054369, now seen corresponding path program 1 times [2024-11-10 05:15:45,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:15:45,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020158368] [2024-11-10 05:15:45,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:15:45,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:15:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:15:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:15:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:15:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:15:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:15:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 05:15:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:15:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:15:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:15:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 05:15:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:15:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:15:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:15:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 05:15:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:15:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:15:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:15:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:15:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:15:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:15:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:15:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:15:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:15:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:15:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 05:15:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:15:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 05:15:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 05:15:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 05:15:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 05:15:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 05:15:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 05:15:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 05:15:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 05:15:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-10 05:15:51,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:15:51,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020158368] [2024-11-10 05:15:51,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020158368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:15:51,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:15:51,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 05:15:51,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921009944] [2024-11-10 05:15:51,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:15:51,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 05:15:51,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:15:51,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 05:15:51,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 05:15:51,799 INFO L87 Difference]: Start difference. First operand 96 states and 146 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-10 05:15:55,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:15:55,388 INFO L93 Difference]: Finished difference Result 606 states and 897 transitions. [2024-11-10 05:15:55,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 05:15:55,389 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2024-11-10 05:15:55,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:15:55,399 INFO L225 Difference]: With dead ends: 606 [2024-11-10 05:15:55,402 INFO L226 Difference]: Without dead ends: 513 [2024-11-10 05:15:55,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2024-11-10 05:15:55,408 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 995 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:15:55,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 1270 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-10 05:15:55,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-10 05:15:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 397. [2024-11-10 05:15:55,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 264 states have (on average 1.3522727272727273) internal successors, (357), 265 states have internal predecessors, (357), 125 states have call successors, (125), 7 states have call predecessors, (125), 7 states have return successors, (125), 124 states have call predecessors, (125), 125 states have call successors, (125) [2024-11-10 05:15:55,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 607 transitions. [2024-11-10 05:15:55,544 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 607 transitions. Word has length 215 [2024-11-10 05:15:55,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:15:55,546 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 607 transitions. [2024-11-10 05:15:55,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-10 05:15:55,547 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 607 transitions. [2024-11-10 05:15:55,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 05:15:55,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:15:55,554 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:15:55,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 05:15:55,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:15:55,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:15:55,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1957354302, now seen corresponding path program 1 times [2024-11-10 05:15:55,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:15:55,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820897500] [2024-11-10 05:15:55,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:15:55,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:15:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:15:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:15:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:15:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:15:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:15:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 05:15:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:15:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:15:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:15:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 05:15:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:15:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:15:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:15:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 05:15:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:15:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:15:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:15:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:15:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:15:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:15:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:15:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:15:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:15:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:15:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 05:15:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:15:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 05:15:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 05:15:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 05:15:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 05:15:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 05:15:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 05:15:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 05:15:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 05:15:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:15:56,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-10 05:15:56,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:15:56,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820897500] [2024-11-10 05:15:56,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820897500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:15:56,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:15:56,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:15:56,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282769547] [2024-11-10 05:15:56,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:15:56,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:15:56,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:15:56,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:15:56,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:15:56,392 INFO L87 Difference]: Start difference. First operand 397 states and 607 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-10 05:15:56,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:15:56,735 INFO L93 Difference]: Finished difference Result 757 states and 1149 transitions. [2024-11-10 05:15:56,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:15:56,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2024-11-10 05:15:56,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:15:56,743 INFO L225 Difference]: With dead ends: 757 [2024-11-10 05:15:56,743 INFO L226 Difference]: Without dead ends: 428 [2024-11-10 05:15:56,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:15:56,746 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 90 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:15:56,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 368 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 05:15:56,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-10 05:15:56,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 397. [2024-11-10 05:15:56,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 264 states have (on average 1.3371212121212122) internal successors, (353), 265 states have internal predecessors, (353), 125 states have call successors, (125), 7 states have call predecessors, (125), 7 states have return successors, (125), 124 states have call predecessors, (125), 125 states have call successors, (125) [2024-11-10 05:15:56,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 603 transitions. [2024-11-10 05:15:56,830 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 603 transitions. Word has length 215 [2024-11-10 05:15:56,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:15:56,832 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 603 transitions. [2024-11-10 05:15:56,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-10 05:15:56,833 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 603 transitions. [2024-11-10 05:15:56,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-10 05:15:56,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:15:56,838 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:15:56,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 05:15:56,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:15:56,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:15:56,839 INFO L85 PathProgramCache]: Analyzing trace with hash 215640848, now seen corresponding path program 1 times [2024-11-10 05:15:56,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:15:56,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914220706] [2024-11-10 05:15:56,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:15:56,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:15:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat