./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-10.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_normal_file-10.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 24099d82b3ec494380587a5a92596aaf0762a1093bfe7e4cba5f9fda7da3acf4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:39:34,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:39:34,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:39:34,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:39:34,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:39:34,137 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:39:34,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:39:34,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:39:34,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:39:34,143 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:39:34,144 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:39:34,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:39:34,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:39:34,145 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:39:34,145 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:39:34,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:39:34,146 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:39:34,146 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:39:34,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:39:34,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:39:34,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:39:34,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:39:34,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:39:34,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:39:34,149 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:39:34,149 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:39:34,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:39:34,150 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:39:34,150 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:39:34,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:39:34,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:39:34,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:39:34,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:39:34,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:39:34,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:39:34,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:39:34,153 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:39:34,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:39:34,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:39:34,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:39:34,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:39:34,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:39:34,155 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 -> 24099d82b3ec494380587a5a92596aaf0762a1093bfe7e4cba5f9fda7da3acf4 [2024-11-10 03:39:34,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:39:34,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:39:34,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:39:34,469 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:39:34,470 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:39:34,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-10.i [2024-11-10 03:39:36,023 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:39:36,268 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:39:36,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-10.i [2024-11-10 03:39:36,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b16e4ce18/b7d85cb928f64ba1928a3de8c436996a/FLAGc3526f341 [2024-11-10 03:39:36,303 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b16e4ce18/b7d85cb928f64ba1928a3de8c436996a [2024-11-10 03:39:36,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:39:36,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:39:36,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:39:36,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:39:36,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:39:36,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:39:36" (1/1) ... [2024-11-10 03:39:36,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1edd2bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:36, skipping insertion in model container [2024-11-10 03:39:36,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:39:36" (1/1) ... [2024-11-10 03:39:36,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:39:36,541 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_normal_file-10.i[913,926] [2024-11-10 03:39:36,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:39:36,656 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:39:36,673 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_normal_file-10.i[913,926] [2024-11-10 03:39:36,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:39:36,748 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:39:36,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:36 WrapperNode [2024-11-10 03:39:36,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:39:36,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:39:36,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:39:36,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:39:36,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:36" (1/1) ... [2024-11-10 03:39:36,774 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:36" (1/1) ... [2024-11-10 03:39:36,818 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 165 [2024-11-10 03:39:36,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:39:36,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:39:36,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:39:36,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:39:36,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:36" (1/1) ... [2024-11-10 03:39:36,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:36" (1/1) ... [2024-11-10 03:39:36,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:36" (1/1) ... [2024-11-10 03:39:36,880 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 03:39:36,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:36" (1/1) ... [2024-11-10 03:39:36,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:36" (1/1) ... [2024-11-10 03:39:36,894 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:36" (1/1) ... [2024-11-10 03:39:36,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:36" (1/1) ... [2024-11-10 03:39:36,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:36" (1/1) ... [2024-11-10 03:39:36,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:36" (1/1) ... [2024-11-10 03:39:36,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:39:36,919 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:39:36,920 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:39:36,920 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:39:36,921 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:36" (1/1) ... [2024-11-10 03:39:36,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:39:36,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:39:36,958 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 03:39:36,960 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 03:39:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:39:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:39:36,999 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:39:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:39:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:39:36,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:39:37,074 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:39:37,076 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:39:37,471 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: havoc property_#t~bitwise16#1;havoc property_#t~ite18#1;havoc property_#t~bitwise17#1;havoc property_#t~short19#1; [2024-11-10 03:39:37,554 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-10 03:39:37,554 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:39:37,609 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:39:37,609 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:39:37,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:39:37 BoogieIcfgContainer [2024-11-10 03:39:37,610 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:39:37,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:39:37,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:39:37,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:39:37,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:39:36" (1/3) ... [2024-11-10 03:39:37,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48792589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:39:37, skipping insertion in model container [2024-11-10 03:39:37,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:36" (2/3) ... [2024-11-10 03:39:37,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48792589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:39:37, skipping insertion in model container [2024-11-10 03:39:37,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:39:37" (3/3) ... [2024-11-10 03:39:37,619 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-10.i [2024-11-10 03:39:37,633 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:39:37,634 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:39:37,698 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:39:37,706 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;@1ee1edde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:39:37,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:39:37,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 56 states have (on average 1.375) internal successors, (77), 57 states have internal predecessors, (77), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 03:39:37,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 03:39:37,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:39:37,724 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:39:37,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:39:37,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:39:37,729 INFO L85 PathProgramCache]: Analyzing trace with hash 661365092, now seen corresponding path program 1 times [2024-11-10 03:39:37,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:39:37,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846402376] [2024-11-10 03:39:37,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:39:37,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:39:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:39:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:39:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:39:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:39:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:39:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:39:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:39:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:39:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:39:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:39:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:39:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:39:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:39:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:39:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:39:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:39:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:39:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:39:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 03:39:38,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:39:38,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846402376] [2024-11-10 03:39:38,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846402376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:39:38,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:39:38,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:39:38,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054789131] [2024-11-10 03:39:38,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:39:38,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:39:38,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:39:38,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:39:38,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:39:38,254 INFO L87 Difference]: Start difference. First operand has 77 states, 56 states have (on average 1.375) internal successors, (77), 57 states have internal predecessors, (77), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 03:39:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:39:38,292 INFO L93 Difference]: Finished difference Result 146 states and 237 transitions. [2024-11-10 03:39:38,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:39:38,296 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 124 [2024-11-10 03:39:38,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:39:38,304 INFO L225 Difference]: With dead ends: 146 [2024-11-10 03:39:38,305 INFO L226 Difference]: Without dead ends: 72 [2024-11-10 03:39:38,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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 03:39:38,311 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:39:38,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:39:38,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-10 03:39:38,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-10 03:39:38,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 03:39:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2024-11-10 03:39:38,353 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 124 [2024-11-10 03:39:38,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:39:38,353 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2024-11-10 03:39:38,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 03:39:38,354 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2024-11-10 03:39:38,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 03:39:38,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:39:38,357 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:39:38,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:39:38,358 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:39:38,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:39:38,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1998007804, now seen corresponding path program 1 times [2024-11-10 03:39:38,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:39:38,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784702256] [2024-11-10 03:39:38,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:39:38,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:39:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:39:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:39:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:39:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:39:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:39:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:39:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:39:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:39:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:39:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:39:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:39:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:38,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:39:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:39,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:39:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:39,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:39:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:39,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:39:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:39,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:39:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:39,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:39:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:39,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:39:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 03:39:39,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:39:39,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784702256] [2024-11-10 03:39:39,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784702256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:39:39,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:39:39,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:39:39,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100561410] [2024-11-10 03:39:39,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:39:39,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:39:39,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:39:39,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:39:39,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:39:39,056 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:39:39,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:39:39,258 INFO L93 Difference]: Finished difference Result 212 states and 311 transitions. [2024-11-10 03:39:39,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:39:39,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2024-11-10 03:39:39,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:39:39,263 INFO L225 Difference]: With dead ends: 212 [2024-11-10 03:39:39,263 INFO L226 Difference]: Without dead ends: 143 [2024-11-10 03:39:39,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:39:39,267 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 74 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:39:39,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 280 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:39:39,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-10 03:39:39,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 107. [2024-11-10 03:39:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 68 states have (on average 1.25) internal successors, (85), 68 states have internal predecessors, (85), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 03:39:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 157 transitions. [2024-11-10 03:39:39,301 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 157 transitions. Word has length 124 [2024-11-10 03:39:39,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:39:39,302 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 157 transitions. [2024-11-10 03:39:39,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:39:39,303 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 157 transitions. [2024-11-10 03:39:39,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 03:39:39,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:39:39,305 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:39:39,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:39:39,305 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:39:39,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:39:39,306 INFO L85 PathProgramCache]: Analyzing trace with hash -307283695, now seen corresponding path program 1 times [2024-11-10 03:39:39,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:39:39,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468439879] [2024-11-10 03:39:39,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:39:39,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:39:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:59,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:39:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:59,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:39:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:59,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:39:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:59,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:39:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:59,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:39:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:59,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:39:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:59,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:39:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:59,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:39:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:59,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:39:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:59,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:39:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:59,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:39:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:59,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:39:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:59,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:39:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:59,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:39:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:59,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:39:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:59,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:39:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:59,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:39:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:59,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:39:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:59,408 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 03:39:59,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:39:59,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468439879] [2024-11-10 03:39:59,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468439879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:39:59,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:39:59,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 03:39:59,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177399537] [2024-11-10 03:39:59,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:39:59,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 03:39:59,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:39:59,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 03:39:59,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-10 03:39:59,414 INFO L87 Difference]: Start difference. First operand 107 states and 157 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 03:40:01,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:40:01,648 INFO L93 Difference]: Finished difference Result 401 states and 567 transitions. [2024-11-10 03:40:01,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 03:40:01,648 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 125 [2024-11-10 03:40:01,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:40:01,655 INFO L225 Difference]: With dead ends: 401 [2024-11-10 03:40:01,656 INFO L226 Difference]: Without dead ends: 332 [2024-11-10 03:40:01,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2024-11-10 03:40:01,658 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 627 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:40:01,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 669 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 03:40:01,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-10 03:40:01,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 195. [2024-11-10 03:40:01,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 136 states have (on average 1.286764705882353) internal successors, (175), 137 states have internal predecessors, (175), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-10 03:40:01,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 283 transitions. [2024-11-10 03:40:01,692 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 283 transitions. Word has length 125 [2024-11-10 03:40:01,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:40:01,696 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 283 transitions. [2024-11-10 03:40:01,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 03:40:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 283 transitions. [2024-11-10 03:40:01,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 03:40:01,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:40:01,698 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:40:01,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:40:01,699 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:40:01,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:40:01,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1797705232, now seen corresponding path program 1 times [2024-11-10 03:40:01,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:40:01,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136247642] [2024-11-10 03:40:01,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:40:01,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:40:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:15,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:40:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:15,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:40:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:15,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:40:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:15,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:40:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:15,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:40:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:15,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:40:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:15,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:40:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:15,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:40:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:15,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:40:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:15,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:40:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:15,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:40:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:15,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:40:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:15,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:40:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:15,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:40:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:15,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:40:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:15,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:40:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:15,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:40:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:15,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:40:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 03:40:15,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:40:15,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136247642] [2024-11-10 03:40:15,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136247642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:40:15,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:40:15,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 03:40:15,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490220144] [2024-11-10 03:40:15,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:40:15,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 03:40:15,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:40:15,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 03:40:15,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-10 03:40:15,791 INFO L87 Difference]: Start difference. First operand 195 states and 283 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 03:40:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:40:17,607 INFO L93 Difference]: Finished difference Result 497 states and 693 transitions. [2024-11-10 03:40:17,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 03:40:17,608 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 125 [2024-11-10 03:40:17,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:40:17,612 INFO L225 Difference]: With dead ends: 497 [2024-11-10 03:40:17,612 INFO L226 Difference]: Without dead ends: 428 [2024-11-10 03:40:17,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2024-11-10 03:40:17,614 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 378 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:40:17,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 690 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 03:40:17,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-10 03:40:17,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 219. [2024-11-10 03:40:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 159 states have (on average 1.3081761006289307) internal successors, (208), 159 states have internal predecessors, (208), 54 states have call successors, (54), 5 states have call predecessors, (54), 5 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-10 03:40:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 316 transitions. [2024-11-10 03:40:17,648 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 316 transitions. Word has length 125 [2024-11-10 03:40:17,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:40:17,649 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 316 transitions. [2024-11-10 03:40:17,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 03:40:17,649 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 316 transitions. [2024-11-10 03:40:17,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 03:40:17,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:40:17,654 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:40:17,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 03:40:17,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:40:17,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:40:17,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1601191727, now seen corresponding path program 1 times [2024-11-10 03:40:17,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:40:17,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543626014] [2024-11-10 03:40:17,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:40:17,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:40:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat