./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-64.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_fillercodesize_ps-cn-25_file-64.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 25397797dfc35333634a0be2aab10e78ef32d1e201aaa39bb0855cdf971464ab --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:27:44,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:27:44,090 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:27:44,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:27:44,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:27:44,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:27:44,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:27:44,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:27:44,117 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:27:44,118 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:27:44,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:27:44,118 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:27:44,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:27:44,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:27:44,119 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:27:44,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:27:44,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:27:44,120 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:27:44,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:27:44,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:27:44,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:27:44,121 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:27:44,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:27:44,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:27:44,122 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:27:44,122 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:27:44,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:27:44,123 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:27:44,123 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:27:44,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:27:44,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:27:44,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:27:44,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:27:44,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:27:44,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:27:44,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:27:44,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:27:44,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:27:44,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:27:44,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:27:44,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:27:44,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:27:44,126 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 -> 25397797dfc35333634a0be2aab10e78ef32d1e201aaa39bb0855cdf971464ab [2024-11-10 04:27:44,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:27:44,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:27:44,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:27:44,359 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:27:44,360 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:27:44,360 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-64.i [2024-11-10 04:27:45,566 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:27:45,743 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:27:45,743 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-64.i [2024-11-10 04:27:45,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51823709c/3a5206a4f51349788af347650a6eb0c9/FLAG6883f2725 [2024-11-10 04:27:45,765 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51823709c/3a5206a4f51349788af347650a6eb0c9 [2024-11-10 04:27:45,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:27:45,769 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:27:45,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:27:45,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:27:45,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:27:45,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:27:45" (1/1) ... [2024-11-10 04:27:45,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6508356f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:45, skipping insertion in model container [2024-11-10 04:27:45,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:27:45" (1/1) ... [2024-11-10 04:27:45,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:27:45,938 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_fillercodesize_ps-cn-25_file-64.i[915,928] [2024-11-10 04:27:45,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:27:46,001 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:27:46,009 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_fillercodesize_ps-cn-25_file-64.i[915,928] [2024-11-10 04:27:46,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:27:46,046 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:27:46,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:46 WrapperNode [2024-11-10 04:27:46,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:27:46,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:27:46,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:27:46,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:27:46,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:46" (1/1) ... [2024-11-10 04:27:46,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:46" (1/1) ... [2024-11-10 04:27:46,132 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250 [2024-11-10 04:27:46,135 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:27:46,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:27:46,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:27:46,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:27:46,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:46" (1/1) ... [2024-11-10 04:27:46,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:46" (1/1) ... [2024-11-10 04:27:46,156 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:46" (1/1) ... [2024-11-10 04:27:46,174 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 04:27:46,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:46" (1/1) ... [2024-11-10 04:27:46,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:46" (1/1) ... [2024-11-10 04:27:46,181 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:46" (1/1) ... [2024-11-10 04:27:46,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:46" (1/1) ... [2024-11-10 04:27:46,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:46" (1/1) ... [2024-11-10 04:27:46,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:46" (1/1) ... [2024-11-10 04:27:46,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:27:46,187 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:27:46,187 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:27:46,188 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:27:46,188 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:46" (1/1) ... [2024-11-10 04:27:46,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:27:46,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:27:46,217 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 04:27:46,218 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 04:27:46,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:27:46,255 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:27:46,255 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:27:46,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:27:46,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:27:46,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:27:46,332 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:27:46,333 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:27:46,581 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L179: havoc property_#t~bitwise27#1;havoc property_#t~short28#1; [2024-11-10 04:27:46,618 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 04:27:46,618 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:27:46,637 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:27:46,637 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:27:46,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:27:46 BoogieIcfgContainer [2024-11-10 04:27:46,638 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:27:46,639 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:27:46,640 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:27:46,642 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:27:46,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:27:45" (1/3) ... [2024-11-10 04:27:46,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a79920b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:27:46, skipping insertion in model container [2024-11-10 04:27:46,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:46" (2/3) ... [2024-11-10 04:27:46,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a79920b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:27:46, skipping insertion in model container [2024-11-10 04:27:46,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:27:46" (3/3) ... [2024-11-10 04:27:46,644 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-64.i [2024-11-10 04:27:46,659 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:27:46,659 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:27:46,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:27:46,710 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;@48d44a79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:27:46,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:27:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 67 states have internal predecessors, (89), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 04:27:46,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-10 04:27:46,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:27:46,729 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:46,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:27:46,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:27:46,734 INFO L85 PathProgramCache]: Analyzing trace with hash -705013927, now seen corresponding path program 1 times [2024-11-10 04:27:46,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:27:46,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447928697] [2024-11-10 04:27:46,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:27:46,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:27:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:46,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:27:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:27:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:27:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:27:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:27:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:27:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:27:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:27:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:27:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:27:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:27:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:27:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:27:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:27:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:27:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:27:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:27:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:27:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:27:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 04:27:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:27:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 04:27:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:27:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 04:27:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:27:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 04:27:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:27:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:27:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:27:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 04:27:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:27:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 04:27:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 04:27:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 04:27:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 04:27:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-10 04:27:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-10 04:27:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-10 04:27:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-10 04:27:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-11-10 04:27:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-10 04:27:47,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:27:47,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447928697] [2024-11-10 04:27:47,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447928697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:27:47,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:27:47,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:27:47,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104309687] [2024-11-10 04:27:47,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:27:47,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:27:47,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:27:47,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:27:47,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:27:47,228 INFO L87 Difference]: Start difference. First operand has 109 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 67 states have internal predecessors, (89), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-10 04:27:47,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:27:47,259 INFO L93 Difference]: Finished difference Result 210 states and 371 transitions. [2024-11-10 04:27:47,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:27:47,261 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) Word has length 249 [2024-11-10 04:27:47,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:27:47,268 INFO L225 Difference]: With dead ends: 210 [2024-11-10 04:27:47,268 INFO L226 Difference]: Without dead ends: 104 [2024-11-10 04:27:47,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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 04:27:47,274 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:27:47,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:27:47,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-10 04:27:47,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-10 04:27:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 62 states have internal predecessors, (80), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 04:27:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 160 transitions. [2024-11-10 04:27:47,325 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 160 transitions. Word has length 249 [2024-11-10 04:27:47,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:27:47,325 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 160 transitions. [2024-11-10 04:27:47,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-10 04:27:47,326 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 160 transitions. [2024-11-10 04:27:47,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-10 04:27:47,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:27:47,332 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:47,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:27:47,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:27:47,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:27:47,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1707936901, now seen corresponding path program 1 times [2024-11-10 04:27:47,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:27:47,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280281010] [2024-11-10 04:27:47,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:27:47,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:27:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:27:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:27:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:27:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:27:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:27:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:27:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:27:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:27:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:27:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:27:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:27:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:27:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:27:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:27:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:27:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:27:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:27:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:27:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:27:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 04:27:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:27:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 04:27:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:27:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 04:27:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:27:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 04:27:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:27:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:27:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:27:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 04:27:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:27:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 04:27:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 04:27:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 04:27:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 04:27:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-10 04:27:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-10 04:27:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-10 04:27:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-10 04:27:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-11-10 04:27:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-10 04:27:47,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:27:47,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280281010] [2024-11-10 04:27:47,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280281010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:27:47,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:27:47,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 04:27:47,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671583897] [2024-11-10 04:27:47,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:27:47,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:27:47,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:27:47,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:27:47,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:27:47,833 INFO L87 Difference]: Start difference. First operand 104 states and 160 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-10 04:27:48,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:27:48,115 INFO L93 Difference]: Finished difference Result 392 states and 603 transitions. [2024-11-10 04:27:48,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 04:27:48,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 249 [2024-11-10 04:27:48,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:27:48,123 INFO L225 Difference]: With dead ends: 392 [2024-11-10 04:27:48,124 INFO L226 Difference]: Without dead ends: 291 [2024-11-10 04:27:48,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 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-10 04:27:48,128 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 293 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:27:48,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 731 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:27:48,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-10 04:27:48,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 108. [2024-11-10 04:27:48,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 66 states have (on average 1.303030303030303) internal successors, (86), 66 states have internal predecessors, (86), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 04:27:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 166 transitions. [2024-11-10 04:27:48,152 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 166 transitions. Word has length 249 [2024-11-10 04:27:48,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:27:48,154 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 166 transitions. [2024-11-10 04:27:48,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-10 04:27:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 166 transitions. [2024-11-10 04:27:48,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-10 04:27:48,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:27:48,161 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:48,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:27:48,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:27:48,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:27:48,162 INFO L85 PathProgramCache]: Analyzing trace with hash 779575932, now seen corresponding path program 1 times [2024-11-10 04:27:48,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:27:48,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28697246] [2024-11-10 04:27:48,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:27:48,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:27:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:27:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:27:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:27:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:27:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:27:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:27:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:27:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:27:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:27:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:27:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:27:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:27:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:27:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:27:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:27:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:27:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:27:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:27:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:27:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 04:27:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:27:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 04:27:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:27:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 04:27:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:27:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 04:27:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:27:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:27:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:27:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 04:27:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:27:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 04:27:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 04:27:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 04:27:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 04:27:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-10 04:27:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-10 04:27:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-10 04:27:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-10 04:27:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-11-10 04:27:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:48,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-10 04:27:48,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:27:48,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28697246] [2024-11-10 04:27:48,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28697246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:27:48,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:27:48,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 04:27:48,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567813784] [2024-11-10 04:27:48,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:27:48,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:27:48,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:27:48,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:27:48,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:27:48,469 INFO L87 Difference]: Start difference. First operand 108 states and 166 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-10 04:27:48,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:27:48,673 INFO L93 Difference]: Finished difference Result 396 states and 608 transitions. [2024-11-10 04:27:48,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 04:27:48,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 249 [2024-11-10 04:27:48,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:27:48,678 INFO L225 Difference]: With dead ends: 396 [2024-11-10 04:27:48,680 INFO L226 Difference]: Without dead ends: 291 [2024-11-10 04:27:48,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 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-10 04:27:48,682 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 283 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:27:48,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 755 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:27:48,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-10 04:27:48,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 108. [2024-11-10 04:27:48,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 66 states have (on average 1.303030303030303) internal successors, (86), 66 states have internal predecessors, (86), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 04:27:48,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 166 transitions. [2024-11-10 04:27:48,705 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 166 transitions. Word has length 249 [2024-11-10 04:27:48,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:27:48,706 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 166 transitions. [2024-11-10 04:27:48,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-10 04:27:48,707 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 166 transitions. [2024-11-10 04:27:48,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-10 04:27:48,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:27:48,709 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:48,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 04:27:48,709 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:27:48,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:27:48,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2103485530, now seen corresponding path program 1 times [2024-11-10 04:27:48,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:27:48,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405908480] [2024-11-10 04:27:48,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:27:48,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:27:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:27:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:27:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:27:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:27:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:27:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:27:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:27:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:27:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:27:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:27:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:27:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:27:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:27:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:27:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:27:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:27:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:27:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:27:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:27:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 04:27:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:27:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 04:27:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:27:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 04:27:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:27:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 04:27:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:27:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:27:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:27:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 04:27:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:27:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 04:27:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 04:27:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 04:27:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 04:27:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-10 04:27:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-10 04:27:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-10 04:27:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-10 04:27:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-11-10 04:27:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-10 04:27:50,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:27:50,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405908480] [2024-11-10 04:27:50,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405908480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:27:50,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:27:50,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 04:27:50,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766032047] [2024-11-10 04:27:50,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:27:50,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:27:50,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:27:50,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:27:50,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:27:50,966 INFO L87 Difference]: Start difference. First operand 108 states and 166 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-10 04:27:51,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:27:51,209 INFO L93 Difference]: Finished difference Result 305 states and 469 transitions. [2024-11-10 04:27:51,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 04:27:51,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 249 [2024-11-10 04:27:51,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:27:51,212 INFO L225 Difference]: With dead ends: 305 [2024-11-10 04:27:51,212 INFO L226 Difference]: Without dead ends: 200 [2024-11-10 04:27:51,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:27:51,213 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 163 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:27:51,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 881 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:27:51,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-10 04:27:51,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 104. [2024-11-10 04:27:51,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 62 states have internal predecessors, (79), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 04:27:51,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2024-11-10 04:27:51,222 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 249 [2024-11-10 04:27:51,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:27:51,222 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2024-11-10 04:27:51,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-10 04:27:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2024-11-10 04:27:51,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-10 04:27:51,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:27:51,225 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:51,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 04:27:51,226 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:27:51,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:27:51,226 INFO L85 PathProgramCache]: Analyzing trace with hash -498432003, now seen corresponding path program 1 times [2024-11-10 04:27:51,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:27:51,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122118770] [2024-11-10 04:27:51,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:27:51,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:27:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat