./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e2f6f0ec12d3f914a423a8e055d641cff2f0504ff2e7f1c08b7700bf0e17ad5e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:01:44,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:01:44,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:01:44,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:01:44,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:01:44,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:01:44,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:01:44,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:01:44,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:01:44,913 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:01:44,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:01:44,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:01:44,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:01:44,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:01:44,915 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:01:44,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:01:44,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:01:44,919 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:01:44,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:01:44,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:01:44,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:01:44,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:01:44,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:01:44,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:01:44,921 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:01:44,922 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:01:44,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:01:44,926 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:01:44,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:01:44,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:01:44,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:01:44,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:01:44,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:01:44,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:01:44,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:01:44,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:01:44,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:01:44,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:01:44,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:01:44,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:01:44,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:01:44,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:01:44,930 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 -> e2f6f0ec12d3f914a423a8e055d641cff2f0504ff2e7f1c08b7700bf0e17ad5e [2024-11-09 02:01:45,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:01:45,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:01:45,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:01:45,198 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:01:45,198 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:01:45,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i [2024-11-09 02:01:46,696 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:01:46,884 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:01:46,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i [2024-11-09 02:01:46,893 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ffacbdf7/d9d96d86b2f446a4b9e8b390b6f59ff0/FLAG320cbbc24 [2024-11-09 02:01:47,268 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ffacbdf7/d9d96d86b2f446a4b9e8b390b6f59ff0 [2024-11-09 02:01:47,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:01:47,272 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:01:47,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:01:47,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:01:47,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:01:47,282 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:01:47" (1/1) ... [2024-11-09 02:01:47,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74a23451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:47, skipping insertion in model container [2024-11-09 02:01:47,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:01:47" (1/1) ... [2024-11-09 02:01:47,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:01:47,484 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i[916,929] [2024-11-09 02:01:47,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:01:47,576 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:01:47,590 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i[916,929] [2024-11-09 02:01:47,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:01:47,662 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:01:47,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:47 WrapperNode [2024-11-09 02:01:47,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:01:47,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:01:47,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:01:47,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:01:47,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:47" (1/1) ... [2024-11-09 02:01:47,685 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:47" (1/1) ... [2024-11-09 02:01:47,728 INFO L138 Inliner]: procedures = 30, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 466 [2024-11-09 02:01:47,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:01:47,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:01:47,730 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:01:47,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:01:47,740 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:47" (1/1) ... [2024-11-09 02:01:47,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:47" (1/1) ... [2024-11-09 02:01:47,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:47" (1/1) ... [2024-11-09 02:01:47,754 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:01:47,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:47" (1/1) ... [2024-11-09 02:01:47,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:47" (1/1) ... [2024-11-09 02:01:47,786 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:47" (1/1) ... [2024-11-09 02:01:47,797 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:47" (1/1) ... [2024-11-09 02:01:47,804 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:47" (1/1) ... [2024-11-09 02:01:47,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:47" (1/1) ... [2024-11-09 02:01:47,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:01:47,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:01:47,818 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:01:47,818 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:01:47,819 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:47" (1/1) ... [2024-11-09 02:01:47,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:01:47,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:01:47,858 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:01:47,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:01:47,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:01:47,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:01:47,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:01:47,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:01:47,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:01:47,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:01:47,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:01:47,914 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:01:47,914 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:01:47,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:01:47,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:01:47,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:01:48,049 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:01:48,051 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:01:48,611 INFO L? ?]: Removed 138 outVars from TransFormulas that were not future-live. [2024-11-09 02:01:48,611 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:01:48,630 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:01:48,630 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:01:48,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:01:48 BoogieIcfgContainer [2024-11-09 02:01:48,631 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:01:48,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:01:48,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:01:48,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:01:48,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:01:47" (1/3) ... [2024-11-09 02:01:48,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1337336f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:01:48, skipping insertion in model container [2024-11-09 02:01:48,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:47" (2/3) ... [2024-11-09 02:01:48,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1337336f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:01:48, skipping insertion in model container [2024-11-09 02:01:48,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:01:48" (3/3) ... [2024-11-09 02:01:48,642 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-33.i [2024-11-09 02:01:48,656 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:01:48,656 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:01:48,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:01:48,730 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;@5e0d3702, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:01:48,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:01:48,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 96 states have internal predecessors, (140), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:01:48,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 02:01:48,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:48,747 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:01:48,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:48,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:48,752 INFO L85 PathProgramCache]: Analyzing trace with hash 507444683, now seen corresponding path program 1 times [2024-11-09 02:01:48,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:01:48,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977220894] [2024-11-09 02:01:48,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:48,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:01:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:49,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:01:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:49,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:01:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:49,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:01:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:49,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:01:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:49,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:01:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:49,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:01:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:49,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:01:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:49,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:01:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:49,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:01:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:01:49,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:01:49,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977220894] [2024-11-09 02:01:49,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977220894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:01:49,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:01:49,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:01:49,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083299853] [2024-11-09 02:01:49,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:01:49,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:01:49,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:01:49,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:01:49,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:01:49,310 INFO L87 Difference]: Start difference. First operand has 107 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 96 states have internal predecessors, (140), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 02:01:49,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:49,343 INFO L93 Difference]: Finished difference Result 207 states and 319 transitions. [2024-11-09 02:01:49,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:01:49,346 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2024-11-09 02:01:49,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:49,353 INFO L225 Difference]: With dead ends: 207 [2024-11-09 02:01:49,353 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 02:01:49,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-09 02:01:49,361 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:01:49,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:01:49,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 02:01:49,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-09 02:01:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 92 states have internal predecessors, (133), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:01:49,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2024-11-09 02:01:49,399 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 98 [2024-11-09 02:01:49,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:49,399 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2024-11-09 02:01:49,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 02:01:49,401 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2024-11-09 02:01:49,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 02:01:49,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:49,408 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:01:49,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:01:49,408 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:49,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:49,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1582582707, now seen corresponding path program 1 times [2024-11-09 02:01:49,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:01:49,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726810340] [2024-11-09 02:01:49,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:49,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:01:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:49,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:01:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:49,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:01:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:49,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:01:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:49,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:01:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:49,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:01:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:49,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:01:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:49,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:01:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:49,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:01:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:49,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:01:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:49,754 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:01:49,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:01:49,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726810340] [2024-11-09 02:01:49,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726810340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:01:49,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:01:49,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:01:49,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136977446] [2024-11-09 02:01:49,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:01:49,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:01:49,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:01:49,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:01:49,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:01:49,764 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:01:49,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:49,825 INFO L93 Difference]: Finished difference Result 206 states and 303 transitions. [2024-11-09 02:01:49,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:01:49,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-09 02:01:49,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:49,830 INFO L225 Difference]: With dead ends: 206 [2024-11-09 02:01:49,830 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 02:01:49,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:01:49,832 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:01:49,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:01:49,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 02:01:49,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-09 02:01:49,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 94 states have internal predecessors, (135), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:01:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2024-11-09 02:01:49,844 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 98 [2024-11-09 02:01:49,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:49,845 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2024-11-09 02:01:49,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:01:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2024-11-09 02:01:49,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 02:01:49,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:49,850 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:01:49,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:01:49,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:49,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:49,851 INFO L85 PathProgramCache]: Analyzing trace with hash 192424655, now seen corresponding path program 1 times [2024-11-09 02:01:49,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:01:49,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136635888] [2024-11-09 02:01:49,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:49,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:01:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:50,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:01:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:50,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:01:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:50,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:01:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:50,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:01:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:50,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:01:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:50,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:01:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:50,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:01:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:50,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:01:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:50,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:01:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:01:50,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:01:50,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136635888] [2024-11-09 02:01:50,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136635888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:01:50,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:01:50,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:01:50,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107038387] [2024-11-09 02:01:50,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:01:50,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:01:50,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:01:50,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:01:50,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:01:50,142 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:01:50,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:50,174 INFO L93 Difference]: Finished difference Result 210 states and 307 transitions. [2024-11-09 02:01:50,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:01:50,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-09 02:01:50,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:50,183 INFO L225 Difference]: With dead ends: 210 [2024-11-09 02:01:50,184 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 02:01:50,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:01:50,187 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:01:50,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:01:50,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 02:01:50,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-09 02:01:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 96 states have internal predecessors, (137), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:01:50,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2024-11-09 02:01:50,201 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 98 [2024-11-09 02:01:50,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:50,202 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2024-11-09 02:01:50,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:01:50,202 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2024-11-09 02:01:50,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 02:01:50,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:50,204 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:01:50,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:01:50,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:50,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:50,204 INFO L85 PathProgramCache]: Analyzing trace with hash 194271697, now seen corresponding path program 1 times [2024-11-09 02:01:50,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:01:50,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799005358] [2024-11-09 02:01:50,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:50,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:01:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:50,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:01:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:50,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:01:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:50,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:01:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:50,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:01:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:50,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:01:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:50,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:01:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:50,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:01:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:50,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:01:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:50,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:01:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:01:50,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:01:50,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799005358] [2024-11-09 02:01:50,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799005358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:01:50,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:01:50,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:01:50,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656475210] [2024-11-09 02:01:50,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:01:50,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:01:50,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:01:50,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:01:50,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:01:50,678 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:01:51,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:51,005 INFO L93 Difference]: Finished difference Result 317 states and 462 transitions. [2024-11-09 02:01:51,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:01:51,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-09 02:01:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:51,007 INFO L225 Difference]: With dead ends: 317 [2024-11-09 02:01:51,007 INFO L226 Difference]: Without dead ends: 213 [2024-11-09 02:01:51,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:01:51,009 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 128 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:01:51,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 610 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:01:51,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-09 02:01:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 126. [2024-11-09 02:01:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 115 states have (on average 1.4434782608695653) internal successors, (166), 115 states have internal predecessors, (166), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:01:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 184 transitions. [2024-11-09 02:01:51,032 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 184 transitions. Word has length 98 [2024-11-09 02:01:51,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:51,033 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 184 transitions. [2024-11-09 02:01:51,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:01:51,034 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 184 transitions. [2024-11-09 02:01:51,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 02:01:51,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:51,035 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:01:51,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:01:51,035 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:51,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:51,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1085591981, now seen corresponding path program 1 times [2024-11-09 02:01:51,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:01:51,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525736655] [2024-11-09 02:01:51,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:51,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:01:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:51,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:01:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:51,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:01:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:51,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:01:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:51,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:01:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:51,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:01:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:51,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:01:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:51,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:01:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:51,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:01:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:51,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:01:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:01:51,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:01:51,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525736655] [2024-11-09 02:01:51,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525736655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:01:51,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:01:51,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:01:51,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65215547] [2024-11-09 02:01:51,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:01:51,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:01:51,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:01:51,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:01:51,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:01:51,476 INFO L87 Difference]: Start difference. First operand 126 states and 184 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:01:51,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:51,798 INFO L93 Difference]: Finished difference Result 293 states and 428 transitions. [2024-11-09 02:01:51,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:01:51,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-09 02:01:51,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:51,800 INFO L225 Difference]: With dead ends: 293 [2024-11-09 02:01:51,801 INFO L226 Difference]: Without dead ends: 170 [2024-11-09 02:01:51,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:01:51,804 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 134 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:01:51,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 471 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:01:51,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-09 02:01:51,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 128. [2024-11-09 02:01:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 117 states have (on average 1.435897435897436) internal successors, (168), 117 states have internal predecessors, (168), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:01:51,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 186 transitions. [2024-11-09 02:01:51,825 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 186 transitions. Word has length 98 [2024-11-09 02:01:51,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:51,826 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 186 transitions. [2024-11-09 02:01:51,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:01:51,826 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 186 transitions. [2024-11-09 02:01:51,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 02:01:51,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:51,827 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:01:51,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:01:51,827 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:51,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1611166637, now seen corresponding path program 1 times [2024-11-09 02:01:51,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:01:51,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090325715] [2024-11-09 02:01:51,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:51,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:01:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:52,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:01:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:52,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:01:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:52,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:01:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:52,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:01:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:52,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:01:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:52,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:01:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:52,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:01:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:52,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:01:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:52,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:01:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:52,355 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:01:52,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:01:52,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090325715] [2024-11-09 02:01:52,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090325715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:01:52,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:01:52,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:01:52,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905381033] [2024-11-09 02:01:52,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:01:52,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:01:52,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:01:52,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:01:52,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:01:52,359 INFO L87 Difference]: Start difference. First operand 128 states and 186 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:01:52,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:52,716 INFO L93 Difference]: Finished difference Result 299 states and 435 transitions. [2024-11-09 02:01:52,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:01:52,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-09 02:01:52,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:52,718 INFO L225 Difference]: With dead ends: 299 [2024-11-09 02:01:52,719 INFO L226 Difference]: Without dead ends: 174 [2024-11-09 02:01:52,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:01:52,720 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 129 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:01:52,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 464 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:01:52,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-09 02:01:52,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 130. [2024-11-09 02:01:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 119 states have (on average 1.4285714285714286) internal successors, (170), 119 states have internal predecessors, (170), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:01:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 188 transitions. [2024-11-09 02:01:52,734 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 188 transitions. Word has length 98 [2024-11-09 02:01:52,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:52,738 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 188 transitions. [2024-11-09 02:01:52,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:01:52,739 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 188 transitions. [2024-11-09 02:01:52,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 02:01:52,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:52,740 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:01:52,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:01:52,740 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:52,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:52,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1403936981, now seen corresponding path program 1 times [2024-11-09 02:01:52,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:01:52,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441250784] [2024-11-09 02:01:52,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:52,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:01:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:53,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:01:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:53,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:01:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:53,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:01:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:53,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:01:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:53,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:01:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:53,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:01:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:53,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:01:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:53,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:01:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:53,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:01:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:53,840 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-09 02:01:53,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:01:53,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441250784] [2024-11-09 02:01:53,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441250784] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:01:53,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115457115] [2024-11-09 02:01:53,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:53,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:01:53,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:01:53,843 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:01:53,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 02:01:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:54,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 02:01:54,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:01:54,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2024-11-09 02:01:54,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:01:54,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 14 [2024-11-09 02:01:54,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 02:01:54,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 02:01:54,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 02:01:54,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 02:01:54,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 02:01:54,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-09 02:01:54,620 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 02:01:54,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:01:54,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 02:01:54,911 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-09 02:01:54,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115457115] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:01:54,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:01:54,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 23 [2024-11-09 02:01:54,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500035248] [2024-11-09 02:01:54,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:01:54,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 02:01:54,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:01:54,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 02:01:54,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-09 02:01:54,914 INFO L87 Difference]: Start difference. First operand 130 states and 188 transitions. Second operand has 23 states, 20 states have (on average 5.9) internal successors, (118), 23 states have internal predecessors, (118), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) [2024-11-09 02:01:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:56,201 INFO L93 Difference]: Finished difference Result 399 states and 571 transitions. [2024-11-09 02:01:56,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 02:01:56,202 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 5.9) internal successors, (118), 23 states have internal predecessors, (118), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) Word has length 98 [2024-11-09 02:01:56,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:56,205 INFO L225 Difference]: With dead ends: 399 [2024-11-09 02:01:56,206 INFO L226 Difference]: Without dead ends: 272 [2024-11-09 02:01:56,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=336, Invalid=1070, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 02:01:56,209 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 425 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 02:01:56,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1219 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 02:01:56,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-09 02:01:56,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 179. [2024-11-09 02:01:56,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 156 states have (on average 1.3846153846153846) internal successors, (216), 156 states have internal predecessors, (216), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:01:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 252 transitions. [2024-11-09 02:01:56,234 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 252 transitions. Word has length 98 [2024-11-09 02:01:56,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:56,235 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 252 transitions. [2024-11-09 02:01:56,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 5.9) internal successors, (118), 23 states have internal predecessors, (118), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) [2024-11-09 02:01:56,236 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 252 transitions. [2024-11-09 02:01:56,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 02:01:56,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:56,239 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:01:56,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 02:01:56,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:01:56,440 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:56,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:56,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1504826921, now seen corresponding path program 1 times [2024-11-09 02:01:56,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:01:56,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778321360] [2024-11-09 02:01:56,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:56,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:01:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:58,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:01:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:58,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:01:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:58,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:01:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:58,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:01:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:58,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:01:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:58,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:01:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:58,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:01:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:58,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:01:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:58,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:01:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:58,183 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:01:58,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:01:58,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778321360] [2024-11-09 02:01:58,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778321360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:01:58,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:01:58,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:01:58,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181493355] [2024-11-09 02:01:58,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:01:58,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:01:58,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:01:58,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:01:58,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:01:58,190 INFO L87 Difference]: Start difference. First operand 179 states and 252 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:01:58,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:58,676 INFO L93 Difference]: Finished difference Result 526 states and 754 transitions. [2024-11-09 02:01:58,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:01:58,676 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-09 02:01:58,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:58,679 INFO L225 Difference]: With dead ends: 526 [2024-11-09 02:01:58,679 INFO L226 Difference]: Without dead ends: 399 [2024-11-09 02:01:58,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:01:58,680 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 309 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:01:58,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 661 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:01:58,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-09 02:01:58,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 306. [2024-11-09 02:01:58,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 273 states have (on average 1.4065934065934067) internal successors, (384), 273 states have internal predecessors, (384), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 02:01:58,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 438 transitions. [2024-11-09 02:01:58,700 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 438 transitions. Word has length 98 [2024-11-09 02:01:58,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:58,700 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 438 transitions. [2024-11-09 02:01:58,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:01:58,700 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 438 transitions. [2024-11-09 02:01:58,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 02:01:58,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:58,701 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:01:58,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 02:01:58,702 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:58,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:58,702 INFO L85 PathProgramCache]: Analyzing trace with hash 181503640, now seen corresponding path program 1 times [2024-11-09 02:01:58,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:01:58,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290849246] [2024-11-09 02:01:58,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:58,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:01:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:58,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:01:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:58,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:01:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:58,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:01:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:58,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:01:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:58,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:01:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:58,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:01:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:58,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:01:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:58,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:01:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:58,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:01:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:58,858 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:01:58,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:01:58,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290849246] [2024-11-09 02:01:58,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290849246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:01:58,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:01:58,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:01:58,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453785774] [2024-11-09 02:01:58,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:01:58,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:01:58,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:01:58,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:01:58,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:01:58,861 INFO L87 Difference]: Start difference. First operand 306 states and 438 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:01:59,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:59,210 INFO L93 Difference]: Finished difference Result 750 states and 1081 transitions. [2024-11-09 02:01:59,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:01:59,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2024-11-09 02:01:59,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:59,215 INFO L225 Difference]: With dead ends: 750 [2024-11-09 02:01:59,216 INFO L226 Difference]: Without dead ends: 496 [2024-11-09 02:01:59,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:01:59,217 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 117 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:01:59,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 623 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:01:59,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-09 02:01:59,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 334. [2024-11-09 02:01:59,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 301 states have (on average 1.4086378737541527) internal successors, (424), 301 states have internal predecessors, (424), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 02:01:59,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 478 transitions. [2024-11-09 02:01:59,255 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 478 transitions. Word has length 99 [2024-11-09 02:01:59,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:59,255 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 478 transitions. [2024-11-09 02:01:59,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:01:59,255 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 478 transitions. [2024-11-09 02:01:59,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 02:01:59,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:59,257 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:01:59,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 02:01:59,257 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:59,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:59,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1392968729, now seen corresponding path program 1 times [2024-11-09 02:01:59,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:01:59,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164668484] [2024-11-09 02:01:59,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:59,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:01:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:59,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:01:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:59,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:01:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:59,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:01:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:59,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:01:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:59,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:01:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:59,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:01:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:59,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:01:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:59,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:01:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:59,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:01:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:59,453 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:01:59,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:01:59,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164668484] [2024-11-09 02:01:59,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164668484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:01:59,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:01:59,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:01:59,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310295382] [2024-11-09 02:01:59,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:01:59,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:01:59,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:01:59,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:01:59,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:01:59,455 INFO L87 Difference]: Start difference. First operand 334 states and 478 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:01:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:59,769 INFO L93 Difference]: Finished difference Result 778 states and 1119 transitions. [2024-11-09 02:01:59,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:01:59,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2024-11-09 02:01:59,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:59,772 INFO L225 Difference]: With dead ends: 778 [2024-11-09 02:01:59,772 INFO L226 Difference]: Without dead ends: 496 [2024-11-09 02:01:59,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:01:59,774 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 132 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:01:59,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 499 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:01:59,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-09 02:01:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 334. [2024-11-09 02:01:59,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 301 states have (on average 1.3953488372093024) internal successors, (420), 301 states have internal predecessors, (420), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 02:01:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 474 transitions. [2024-11-09 02:01:59,794 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 474 transitions. Word has length 99 [2024-11-09 02:01:59,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:59,794 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 474 transitions. [2024-11-09 02:01:59,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:01:59,795 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 474 transitions. [2024-11-09 02:01:59,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 02:01:59,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:59,796 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:01:59,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 02:01:59,796 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:59,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:59,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1261794002, now seen corresponding path program 1 times [2024-11-09 02:01:59,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:01:59,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848875063] [2024-11-09 02:01:59,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:59,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:01:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:00,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:02:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:00,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:02:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:00,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:02:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:00,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:02:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:00,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:02:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:00,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:02:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:00,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:02:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:00,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:02:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:00,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:02:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:00,426 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:02:00,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:02:00,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848875063] [2024-11-09 02:02:00,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848875063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:00,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:00,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:02:00,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364379239] [2024-11-09 02:02:00,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:00,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:02:00,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:02:00,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:02:00,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:02:00,428 INFO L87 Difference]: Start difference. First operand 334 states and 474 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:00,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:00,689 INFO L93 Difference]: Finished difference Result 717 states and 1026 transitions. [2024-11-09 02:02:00,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:02:00,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2024-11-09 02:02:00,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:00,693 INFO L225 Difference]: With dead ends: 717 [2024-11-09 02:02:00,693 INFO L226 Difference]: Without dead ends: 435 [2024-11-09 02:02:00,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:02:00,694 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 71 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:00,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 420 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:02:00,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-09 02:02:00,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 401. [2024-11-09 02:02:00,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 368 states have (on average 1.4048913043478262) internal successors, (517), 368 states have internal predecessors, (517), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 02:02:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 571 transitions. [2024-11-09 02:02:00,726 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 571 transitions. Word has length 100 [2024-11-09 02:02:00,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:00,726 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 571 transitions. [2024-11-09 02:02:00,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:00,727 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 571 transitions. [2024-11-09 02:02:00,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 02:02:00,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:00,728 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:00,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 02:02:00,728 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:00,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:00,729 INFO L85 PathProgramCache]: Analyzing trace with hash 250676752, now seen corresponding path program 1 times [2024-11-09 02:02:00,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:02:00,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008432212] [2024-11-09 02:02:00,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:00,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:02:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:00,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:02:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:00,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:02:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:00,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:02:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:00,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:02:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:00,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:02:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:00,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:02:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:00,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:02:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:00,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:02:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:00,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:02:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:00,882 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:02:00,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:02:00,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008432212] [2024-11-09 02:02:00,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008432212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:00,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:00,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:02:00,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123972683] [2024-11-09 02:02:00,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:00,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:02:00,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:02:00,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:02:00,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:02:00,884 INFO L87 Difference]: Start difference. First operand 401 states and 571 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:00,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:00,918 INFO L93 Difference]: Finished difference Result 755 states and 1082 transitions. [2024-11-09 02:02:00,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:02:00,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2024-11-09 02:02:00,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:00,921 INFO L225 Difference]: With dead ends: 755 [2024-11-09 02:02:00,921 INFO L226 Difference]: Without dead ends: 406 [2024-11-09 02:02:00,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:02:00,922 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:00,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 575 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:02:00,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-11-09 02:02:00,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2024-11-09 02:02:00,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 373 states have (on average 1.3994638069705094) internal successors, (522), 373 states have internal predecessors, (522), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 02:02:00,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 576 transitions. [2024-11-09 02:02:00,937 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 576 transitions. Word has length 100 [2024-11-09 02:02:00,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:00,938 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 576 transitions. [2024-11-09 02:02:00,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 576 transitions. [2024-11-09 02:02:00,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 02:02:00,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:00,939 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:00,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 02:02:00,939 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:00,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:00,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1461008104, now seen corresponding path program 1 times [2024-11-09 02:02:00,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:02:00,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642697954] [2024-11-09 02:02:00,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:00,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:02:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:01,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:02:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:01,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:02:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:01,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:02:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:01,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:02:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:01,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:02:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:01,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:02:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:01,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:02:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:01,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:02:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:01,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:02:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:02:01,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:02:01,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642697954] [2024-11-09 02:02:01,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642697954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:01,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:01,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:02:01,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545382019] [2024-11-09 02:02:01,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:01,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:02:01,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:02:01,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:02:01,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:02:01,728 INFO L87 Difference]: Start difference. First operand 406 states and 576 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:01,904 INFO L93 Difference]: Finished difference Result 762 states and 1086 transitions. [2024-11-09 02:02:01,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:02:01,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2024-11-09 02:02:01,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:01,907 INFO L225 Difference]: With dead ends: 762 [2024-11-09 02:02:01,907 INFO L226 Difference]: Without dead ends: 408 [2024-11-09 02:02:01,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-09 02:02:01,908 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 108 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:01,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 285 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:02:01,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-09 02:02:01,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 406. [2024-11-09 02:02:01,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 373 states have (on average 1.3967828418230563) internal successors, (521), 373 states have internal predecessors, (521), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 02:02:01,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 575 transitions. [2024-11-09 02:02:01,926 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 575 transitions. Word has length 100 [2024-11-09 02:02:01,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:01,926 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 575 transitions. [2024-11-09 02:02:01,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:01,926 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 575 transitions. [2024-11-09 02:02:01,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 02:02:01,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:01,928 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:01,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 02:02:01,928 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:01,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:01,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1623301555, now seen corresponding path program 1 times [2024-11-09 02:02:01,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:02:01,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192141066] [2024-11-09 02:02:01,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:01,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:02:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:02,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:02:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:02,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:02:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:02,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:02:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:02,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:02:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:02,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:02:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:02,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:02:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:02,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:02:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:02,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:02:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:02,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:02:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:02:02,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:02:02,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192141066] [2024-11-09 02:02:02,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192141066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:02,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:02,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:02:02,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752175998] [2024-11-09 02:02:02,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:02,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:02:02,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:02:02,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:02:02,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:02:02,815 INFO L87 Difference]: Start difference. First operand 406 states and 575 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:03,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:03,587 INFO L93 Difference]: Finished difference Result 863 states and 1224 transitions. [2024-11-09 02:02:03,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 02:02:03,588 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2024-11-09 02:02:03,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:03,590 INFO L225 Difference]: With dead ends: 863 [2024-11-09 02:02:03,590 INFO L226 Difference]: Without dead ends: 499 [2024-11-09 02:02:03,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:02:03,592 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 355 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:03,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 743 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 02:02:03,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-11-09 02:02:03,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 406. [2024-11-09 02:02:03,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 373 states have (on average 1.383378016085791) internal successors, (516), 373 states have internal predecessors, (516), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 02:02:03,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 570 transitions. [2024-11-09 02:02:03,613 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 570 transitions. Word has length 101 [2024-11-09 02:02:03,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:03,614 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 570 transitions. [2024-11-09 02:02:03,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:03,615 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 570 transitions. [2024-11-09 02:02:03,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 02:02:03,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:03,616 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:03,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 02:02:03,617 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:03,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:03,617 INFO L85 PathProgramCache]: Analyzing trace with hash -84187382, now seen corresponding path program 1 times [2024-11-09 02:02:03,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:02:03,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119649074] [2024-11-09 02:02:03,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:03,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:02:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:04,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:02:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:04,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:02:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:04,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:02:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:04,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:02:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:04,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:02:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:04,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:02:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:04,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:02:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:04,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:02:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:04,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:02:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:02:04,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:02:04,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119649074] [2024-11-09 02:02:04,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119649074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:04,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:04,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:02:04,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675756274] [2024-11-09 02:02:04,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:04,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:02:04,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:02:04,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:02:04,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:02:04,039 INFO L87 Difference]: Start difference. First operand 406 states and 570 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:04,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:04,779 INFO L93 Difference]: Finished difference Result 809 states and 1153 transitions. [2024-11-09 02:02:04,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 02:02:04,780 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 102 [2024-11-09 02:02:04,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:04,782 INFO L225 Difference]: With dead ends: 809 [2024-11-09 02:02:04,782 INFO L226 Difference]: Without dead ends: 455 [2024-11-09 02:02:04,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-09 02:02:04,783 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 240 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:04,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 744 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 02:02:04,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-09 02:02:04,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 406. [2024-11-09 02:02:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 373 states have (on average 1.383378016085791) internal successors, (516), 373 states have internal predecessors, (516), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 02:02:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 570 transitions. [2024-11-09 02:02:04,801 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 570 transitions. Word has length 102 [2024-11-09 02:02:04,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:04,801 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 570 transitions. [2024-11-09 02:02:04,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 570 transitions. [2024-11-09 02:02:04,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 02:02:04,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:04,802 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:04,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 02:02:04,803 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:04,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:04,803 INFO L85 PathProgramCache]: Analyzing trace with hash 224002924, now seen corresponding path program 1 times [2024-11-09 02:02:04,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:02:04,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754307489] [2024-11-09 02:02:04,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:04,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:02:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:05,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:02:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:05,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:02:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:05,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:02:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:05,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:02:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:05,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:02:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:05,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:02:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:05,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:02:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:05,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:02:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:05,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:02:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:02:05,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:02:05,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754307489] [2024-11-09 02:02:05,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754307489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:05,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:05,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:02:05,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943097985] [2024-11-09 02:02:05,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:05,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:02:05,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:02:05,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:02:05,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:02:05,701 INFO L87 Difference]: Start difference. First operand 406 states and 570 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:05,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:06,000 INFO L93 Difference]: Finished difference Result 762 states and 1074 transitions. [2024-11-09 02:02:06,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:02:06,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 103 [2024-11-09 02:02:06,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:06,002 INFO L225 Difference]: With dead ends: 762 [2024-11-09 02:02:06,004 INFO L226 Difference]: Without dead ends: 408 [2024-11-09 02:02:06,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:02:06,006 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 96 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:06,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 355 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:02:06,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-09 02:02:06,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 406. [2024-11-09 02:02:06,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 373 states have (on average 1.3780160857908847) internal successors, (514), 373 states have internal predecessors, (514), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 02:02:06,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 568 transitions. [2024-11-09 02:02:06,027 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 568 transitions. Word has length 103 [2024-11-09 02:02:06,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:06,028 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 568 transitions. [2024-11-09 02:02:06,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:06,031 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 568 transitions. [2024-11-09 02:02:06,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 02:02:06,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:06,032 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:06,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 02:02:06,032 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:06,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:06,033 INFO L85 PathProgramCache]: Analyzing trace with hash 374293398, now seen corresponding path program 1 times [2024-11-09 02:02:06,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:02:06,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329034989] [2024-11-09 02:02:06,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:06,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:02:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:06,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:02:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:06,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:02:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:06,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:02:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:06,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:02:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:06,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:02:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:06,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:02:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:06,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:02:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:06,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:02:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:06,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:02:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:06,189 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:02:06,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:02:06,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329034989] [2024-11-09 02:02:06,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329034989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:06,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:06,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:02:06,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561306514] [2024-11-09 02:02:06,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:06,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:02:06,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:02:06,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:02:06,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:02:06,192 INFO L87 Difference]: Start difference. First operand 406 states and 568 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:06,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:06,224 INFO L93 Difference]: Finished difference Result 766 states and 1077 transitions. [2024-11-09 02:02:06,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:02:06,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2024-11-09 02:02:06,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:06,226 INFO L225 Difference]: With dead ends: 766 [2024-11-09 02:02:06,226 INFO L226 Difference]: Without dead ends: 412 [2024-11-09 02:02:06,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:02:06,228 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:06,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 575 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:02:06,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-09 02:02:06,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2024-11-09 02:02:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 379 states have (on average 1.3720316622691293) internal successors, (520), 379 states have internal predecessors, (520), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 02:02:06,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 574 transitions. [2024-11-09 02:02:06,253 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 574 transitions. Word has length 104 [2024-11-09 02:02:06,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:06,253 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 574 transitions. [2024-11-09 02:02:06,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:06,255 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 574 transitions. [2024-11-09 02:02:06,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 02:02:06,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:06,257 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:06,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 02:02:06,257 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:06,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:06,257 INFO L85 PathProgramCache]: Analyzing trace with hash -867628502, now seen corresponding path program 1 times [2024-11-09 02:02:06,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:02:06,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133862659] [2024-11-09 02:02:06,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:06,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:02:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:06,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:02:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:06,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:02:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:06,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:02:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:06,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:02:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:06,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:02:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:06,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:02:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:06,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:02:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:06,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:02:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:06,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:02:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:06,844 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:02:06,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:02:06,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133862659] [2024-11-09 02:02:06,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133862659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:06,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:06,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 02:02:06,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311673184] [2024-11-09 02:02:06,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:06,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 02:02:06,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:02:06,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 02:02:06,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-09 02:02:06,846 INFO L87 Difference]: Start difference. First operand 412 states and 574 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:07,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:07,895 INFO L93 Difference]: Finished difference Result 1177 states and 1646 transitions. [2024-11-09 02:02:07,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 02:02:07,896 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2024-11-09 02:02:07,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:07,900 INFO L225 Difference]: With dead ends: 1177 [2024-11-09 02:02:07,900 INFO L226 Difference]: Without dead ends: 817 [2024-11-09 02:02:07,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-11-09 02:02:07,903 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 493 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:07,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 1191 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 02:02:07,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2024-11-09 02:02:07,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 445. [2024-11-09 02:02:07,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 412 states have (on average 1.3786407766990292) internal successors, (568), 412 states have internal predecessors, (568), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 02:02:07,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 622 transitions. [2024-11-09 02:02:07,927 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 622 transitions. Word has length 104 [2024-11-09 02:02:07,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:07,927 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 622 transitions. [2024-11-09 02:02:07,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:07,928 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 622 transitions. [2024-11-09 02:02:07,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 02:02:07,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:07,929 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:07,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 02:02:07,929 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:07,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:07,929 INFO L85 PathProgramCache]: Analyzing trace with hash -710127411, now seen corresponding path program 1 times [2024-11-09 02:02:07,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:02:07,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005862656] [2024-11-09 02:02:07,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:07,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:02:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:08,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:02:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:08,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:02:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:08,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:02:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:08,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:02:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:08,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:02:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:08,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:02:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:08,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:02:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:08,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:02:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:08,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:02:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:02:08,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:02:08,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005862656] [2024-11-09 02:02:08,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005862656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:08,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:08,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 02:02:08,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316154740] [2024-11-09 02:02:08,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:08,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 02:02:08,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:02:08,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 02:02:08,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-09 02:02:08,274 INFO L87 Difference]: Start difference. First operand 445 states and 622 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:09,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:09,621 INFO L93 Difference]: Finished difference Result 1589 states and 2247 transitions. [2024-11-09 02:02:09,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 02:02:09,621 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2024-11-09 02:02:09,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:09,626 INFO L225 Difference]: With dead ends: 1589 [2024-11-09 02:02:09,626 INFO L226 Difference]: Without dead ends: 1196 [2024-11-09 02:02:09,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2024-11-09 02:02:09,628 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 281 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:09,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1426 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 02:02:09,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2024-11-09 02:02:09,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 893. [2024-11-09 02:02:09,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 840 states have (on average 1.401190476190476) internal successors, (1177), 840 states have internal predecessors, (1177), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 02:02:09,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1267 transitions. [2024-11-09 02:02:09,669 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1267 transitions. Word has length 104 [2024-11-09 02:02:09,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:09,669 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1267 transitions. [2024-11-09 02:02:09,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:09,670 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1267 transitions. [2024-11-09 02:02:09,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 02:02:09,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:09,671 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:09,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 02:02:09,671 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:09,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:09,671 INFO L85 PathProgramCache]: Analyzing trace with hash 810231134, now seen corresponding path program 1 times [2024-11-09 02:02:09,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:02:09,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560714587] [2024-11-09 02:02:09,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:09,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:02:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:10,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:02:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:10,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:02:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:10,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:02:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:10,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:02:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:10,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:02:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:10,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:02:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:10,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:02:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:10,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:02:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:10,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:02:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:02:10,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:02:10,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560714587] [2024-11-09 02:02:10,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560714587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:10,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:10,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 02:02:10,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409006945] [2024-11-09 02:02:10,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:10,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 02:02:10,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:02:10,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 02:02:10,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:02:10,207 INFO L87 Difference]: Start difference. First operand 893 states and 1267 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:10,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:10,994 INFO L93 Difference]: Finished difference Result 2267 states and 3233 transitions. [2024-11-09 02:02:10,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 02:02:10,995 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 105 [2024-11-09 02:02:10,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:11,002 INFO L225 Difference]: With dead ends: 2267 [2024-11-09 02:02:11,002 INFO L226 Difference]: Without dead ends: 1426 [2024-11-09 02:02:11,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-09 02:02:11,004 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 503 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:11,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 639 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 02:02:11,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2024-11-09 02:02:11,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 951. [2024-11-09 02:02:11,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 898 states have (on average 1.4164810690423162) internal successors, (1272), 898 states have internal predecessors, (1272), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 02:02:11,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1362 transitions. [2024-11-09 02:02:11,063 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1362 transitions. Word has length 105 [2024-11-09 02:02:11,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:11,064 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1362 transitions. [2024-11-09 02:02:11,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:11,064 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1362 transitions. [2024-11-09 02:02:11,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 02:02:11,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:11,065 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:11,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 02:02:11,066 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:11,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:11,066 INFO L85 PathProgramCache]: Analyzing trace with hash -583502545, now seen corresponding path program 1 times [2024-11-09 02:02:11,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:02:11,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708962422] [2024-11-09 02:02:11,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:11,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:02:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:12,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:02:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:12,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:02:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:12,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:02:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:12,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:02:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:12,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:02:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:12,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:02:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:12,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:02:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:12,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:02:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:12,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:02:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:12,227 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:02:12,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:02:12,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708962422] [2024-11-09 02:02:12,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708962422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:12,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:12,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 02:02:12,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188316472] [2024-11-09 02:02:12,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:12,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 02:02:12,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:02:12,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 02:02:12,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:02:12,229 INFO L87 Difference]: Start difference. First operand 951 states and 1362 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:13,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:13,101 INFO L93 Difference]: Finished difference Result 2021 states and 2890 transitions. [2024-11-09 02:02:13,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 02:02:13,102 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 105 [2024-11-09 02:02:13,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:13,107 INFO L225 Difference]: With dead ends: 2021 [2024-11-09 02:02:13,108 INFO L226 Difference]: Without dead ends: 1122 [2024-11-09 02:02:13,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:02:13,111 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 326 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:13,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 883 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 02:02:13,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2024-11-09 02:02:13,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 949. [2024-11-09 02:02:13,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 896 states have (on average 1.4140625) internal successors, (1267), 896 states have internal predecessors, (1267), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 02:02:13,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1357 transitions. [2024-11-09 02:02:13,153 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1357 transitions. Word has length 105 [2024-11-09 02:02:13,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:13,153 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1357 transitions. [2024-11-09 02:02:13,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:13,153 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1357 transitions. [2024-11-09 02:02:13,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 02:02:13,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:13,155 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:13,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 02:02:13,155 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:13,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:13,156 INFO L85 PathProgramCache]: Analyzing trace with hash 518930393, now seen corresponding path program 1 times [2024-11-09 02:02:13,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:02:13,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705923544] [2024-11-09 02:02:13,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:13,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:02:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:13,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:02:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:13,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:02:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:13,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:02:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:13,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:02:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:13,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:02:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:13,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:02:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:13,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:02:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:13,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:02:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:13,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:02:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:02:13,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:02:13,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705923544] [2024-11-09 02:02:13,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705923544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:13,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:13,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:02:13,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841918751] [2024-11-09 02:02:13,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:13,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:02:13,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:02:13,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:02:13,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:02:13,658 INFO L87 Difference]: Start difference. First operand 949 states and 1357 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:14,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:14,523 INFO L93 Difference]: Finished difference Result 1898 states and 2725 transitions. [2024-11-09 02:02:14,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 02:02:14,523 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 105 [2024-11-09 02:02:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:14,527 INFO L225 Difference]: With dead ends: 1898 [2024-11-09 02:02:14,527 INFO L226 Difference]: Without dead ends: 1001 [2024-11-09 02:02:14,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:02:14,529 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 132 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:14,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 782 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 02:02:14,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-11-09 02:02:14,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 416. [2024-11-09 02:02:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 383 states have (on average 1.3812010443864229) internal successors, (529), 383 states have internal predecessors, (529), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 02:02:14,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 583 transitions. [2024-11-09 02:02:14,555 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 583 transitions. Word has length 105 [2024-11-09 02:02:14,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:14,555 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 583 transitions. [2024-11-09 02:02:14,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:14,555 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 583 transitions. [2024-11-09 02:02:14,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 02:02:14,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:14,557 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:14,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 02:02:14,557 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:14,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:14,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1326025307, now seen corresponding path program 1 times [2024-11-09 02:02:14,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:02:14,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776426192] [2024-11-09 02:02:14,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:14,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:02:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:14,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:02:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:14,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:02:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:14,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:02:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:14,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:02:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:14,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:02:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:14,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:02:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:14,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:02:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:14,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:02:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:14,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:02:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:02:14,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:02:14,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776426192] [2024-11-09 02:02:14,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776426192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:14,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:14,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:02:14,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465765266] [2024-11-09 02:02:14,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:14,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:02:14,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:02:14,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:02:14,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:02:14,650 INFO L87 Difference]: Start difference. First operand 416 states and 583 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:14,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:14,674 INFO L93 Difference]: Finished difference Result 782 states and 1103 transitions. [2024-11-09 02:02:14,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:02:14,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 106 [2024-11-09 02:02:14,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:14,677 INFO L225 Difference]: With dead ends: 782 [2024-11-09 02:02:14,677 INFO L226 Difference]: Without dead ends: 418 [2024-11-09 02:02:14,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:02:14,679 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:14,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:02:14,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-09 02:02:14,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2024-11-09 02:02:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 385 states have (on average 1.3792207792207791) internal successors, (531), 385 states have internal predecessors, (531), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 02:02:14,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 585 transitions. [2024-11-09 02:02:14,701 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 585 transitions. Word has length 106 [2024-11-09 02:02:14,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:14,701 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 585 transitions. [2024-11-09 02:02:14,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:14,702 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 585 transitions. [2024-11-09 02:02:14,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 02:02:14,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:14,703 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:14,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 02:02:14,703 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:14,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:14,704 INFO L85 PathProgramCache]: Analyzing trace with hash 721618541, now seen corresponding path program 1 times [2024-11-09 02:02:14,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:02:14,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404023806] [2024-11-09 02:02:14,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:14,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:02:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:16,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:02:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:16,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:02:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:16,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:02:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:16,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:02:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:16,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:02:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:16,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:02:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:16,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:02:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:16,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:02:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:16,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:02:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:16,068 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:02:16,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:02:16,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404023806] [2024-11-09 02:02:16,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404023806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:16,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:16,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 02:02:16,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537826328] [2024-11-09 02:02:16,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:16,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 02:02:16,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:02:16,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 02:02:16,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 02:02:16,071 INFO L87 Difference]: Start difference. First operand 418 states and 585 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:16,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:16,746 INFO L93 Difference]: Finished difference Result 426 states and 592 transitions. [2024-11-09 02:02:16,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 02:02:16,747 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 106 [2024-11-09 02:02:16,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:16,749 INFO L225 Difference]: With dead ends: 426 [2024-11-09 02:02:16,749 INFO L226 Difference]: Without dead ends: 424 [2024-11-09 02:02:16,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-11-09 02:02:16,752 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 282 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:16,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 969 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 02:02:16,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-09 02:02:16,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 421. [2024-11-09 02:02:16,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 388 states have (on average 1.3762886597938144) internal successors, (534), 388 states have internal predecessors, (534), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 02:02:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 588 transitions. [2024-11-09 02:02:16,776 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 588 transitions. Word has length 106 [2024-11-09 02:02:16,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:16,777 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 588 transitions. [2024-11-09 02:02:16,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:16,777 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 588 transitions. [2024-11-09 02:02:16,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 02:02:16,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:16,778 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:16,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 02:02:16,779 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:16,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:16,779 INFO L85 PathProgramCache]: Analyzing trace with hash 723465583, now seen corresponding path program 1 times [2024-11-09 02:02:16,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:02:16,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62764317] [2024-11-09 02:02:16,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:16,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:02:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:02:16,851 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:02:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:02:16,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:02:16,949 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:02:16,951 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 02:02:16,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 02:02:16,956 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:17,026 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 02:02:17,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:02:17 BoogieIcfgContainer [2024-11-09 02:02:17,034 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 02:02:17,035 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 02:02:17,035 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 02:02:17,035 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 02:02:17,035 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:01:48" (3/4) ... [2024-11-09 02:02:17,038 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 02:02:17,039 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 02:02:17,039 INFO L158 Benchmark]: Toolchain (without parser) took 29767.36ms. Allocated memory was 176.2MB in the beginning and 673.2MB in the end (delta: 497.0MB). Free memory was 121.1MB in the beginning and 340.1MB in the end (delta: -219.0MB). Peak memory consumption was 278.7MB. Max. memory is 16.1GB. [2024-11-09 02:02:17,039 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:02:17,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.68ms. Allocated memory is still 176.2MB. Free memory was 120.3MB in the beginning and 103.5MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 02:02:17,040 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.07ms. Allocated memory is still 176.2MB. Free memory was 103.5MB in the beginning and 98.7MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:02:17,040 INFO L158 Benchmark]: Boogie Preprocessor took 86.59ms. Allocated memory is still 176.2MB. Free memory was 98.7MB in the beginning and 94.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:02:17,040 INFO L158 Benchmark]: RCFGBuilder took 814.16ms. Allocated memory is still 176.2MB. Free memory was 94.5MB in the beginning and 58.9MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-09 02:02:17,040 INFO L158 Benchmark]: TraceAbstraction took 28400.55ms. Allocated memory was 176.2MB in the beginning and 673.2MB in the end (delta: 497.0MB). Free memory was 58.1MB in the beginning and 341.1MB in the end (delta: -283.0MB). Peak memory consumption was 215.8MB. Max. memory is 16.1GB. [2024-11-09 02:02:17,040 INFO L158 Benchmark]: Witness Printer took 4.14ms. Allocated memory is still 673.2MB. Free memory was 341.1MB in the beginning and 340.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:02:17,041 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.68ms. Allocated memory is still 176.2MB. Free memory was 120.3MB in the beginning and 103.5MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.07ms. Allocated memory is still 176.2MB. Free memory was 103.5MB in the beginning and 98.7MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.59ms. Allocated memory is still 176.2MB. Free memory was 98.7MB in the beginning and 94.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 814.16ms. Allocated memory is still 176.2MB. Free memory was 94.5MB in the beginning and 58.9MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 28400.55ms. Allocated memory was 176.2MB in the beginning and 673.2MB in the end (delta: 497.0MB). Free memory was 58.1MB in the beginning and 341.1MB in the end (delta: -283.0MB). Peak memory consumption was 215.8MB. Max. memory is 16.1GB. * Witness Printer took 4.14ms. Allocated memory is still 673.2MB. Free memory was 341.1MB in the beginning and 340.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someUnaryDOUBLEoperation at line 43. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L51] signed long int last_1_WrapperStruct00_var_1_13 = -8; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_13=-8] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] EXPR WrapperStruct00.var_1_13 [L98] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L108] RET updateLastVariables() [L109] CALL updateVariables() [L81] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L82] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L82] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L82] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L83] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L84] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L86] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L87] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L88] EXPR WrapperStruct00.var_1_10 [L88] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L88] EXPR WrapperStruct00.var_1_10 [L88] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L88] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L88] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L88] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L89] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L90] EXPR WrapperStruct00.var_1_11 [L90] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L90] EXPR WrapperStruct00.var_1_11 [L90] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L90] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L90] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L90] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L91] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L92] EXPR WrapperStruct00.var_1_12 [L92] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L92] EXPR WrapperStruct00.var_1_12 [L92] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L92] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L92] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L92] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L93] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L94] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L109] RET updateVariables() [L110] CALL step() [L55] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L55] COND FALSE !(WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) [L58] EXPR WrapperStruct00.var_1_7 [L58] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_7 [L59] EXPR WrapperStruct00.var_1_7 [L59] unsigned char stepLocal_1 = WrapperStruct00.var_1_7; [L60] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L60] COND TRUE ! WrapperStruct00.var_1_14 [L61] EXPR WrapperStruct00.var_1_8 [L61] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_8 [L69] EXPR WrapperStruct00.var_1_11 [L69] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_11 [L70] EXPR WrapperStruct00.var_1_13 [L70] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L70] EXPR WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L70] EXPR WrapperStruct00.var_1_16 [L70] signed long int stepLocal_0 = (WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16; [L71] COND FALSE !(stepLocal_0 < -1) [L74] EXPR WrapperStruct00.var_1_7 [L74] EXPR WrapperStruct00.var_1_7 [L74] WrapperStruct00.var_1_1 = (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) [L76] EXPR WrapperStruct00.var_1_7 [L76] EXPR WrapperStruct00.var_1_13 [L76] EXPR WrapperStruct00.var_1_7 [L76] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L76] EXPR WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L76] EXPR WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L76] COND FALSE !(WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR WrapperStruct00.var_1_13 [L101] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)))) [L101] EXPR WrapperStruct00.var_1_1 [L101] EXPR WrapperStruct00.var_1_7 [L101] EXPR WrapperStruct00.var_1_7 [L101] EXPR (((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1) [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1) [L101] EXPR WrapperStruct00.var_1_7 [L101] EXPR WrapperStruct00.var_1_13 [L101] EXPR WrapperStruct00.var_1_7 [L101] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16)))) [L101] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))) [L101] EXPR WrapperStruct00.var_1_13 [L101] EXPR WrapperStruct00.var_1_8 [L101] EXPR (! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_11)) [L101] EXPR WrapperStruct00.var_1_15 [L101] EXPR WrapperStruct00.var_1_11 [L101] EXPR (((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_11)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_11))) && (WrapperStruct00.var_1_16 == ((signed long int) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101-L102] return ((((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_11))) && (WrapperStruct00.var_1_16 == ((signed long int) WrapperStruct00.var_1_7)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.3s, OverallIterations: 25, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4263 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4263 mSDsluCounter, 15445 SdHoareTripleChecker+Invalid, 8.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11941 mSDsCounter, 731 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10181 IncrementalHoareTripleChecker+Invalid, 10912 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 731 mSolverCounterUnsat, 3504 mSDtfsCounter, 10181 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 954 GetRequests, 759 SyntacticMatches, 1 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=951occurred in iteration=20, InterpolantAutomatonStates: 179, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 2776 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 2631 NumberOfCodeBlocks, 2631 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2597 ConstructedInterpolants, 0 QuantifiedInterpolants, 9092 SizeOfPredicates, 5 NumberOfNonLiveVariables, 394 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 26 InterpolantComputations, 23 PerfectInterpolantSequences, 3672/3744 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 02:02:17,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 e2f6f0ec12d3f914a423a8e055d641cff2f0504ff2e7f1c08b7700bf0e17ad5e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:02:19,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:02:19,330 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 02:02:19,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:02:19,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:02:19,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:02:19,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:02:19,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:02:19,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:02:19,373 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:02:19,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:02:19,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:02:19,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:02:19,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:02:19,377 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:02:19,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:02:19,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:02:19,378 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:02:19,379 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:02:19,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:02:19,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:02:19,383 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:02:19,383 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:02:19,383 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 02:02:19,384 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 02:02:19,384 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:02:19,384 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 02:02:19,384 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:02:19,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:02:19,385 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:02:19,385 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:02:19,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:02:19,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:02:19,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:02:19,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:02:19,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:02:19,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:02:19,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:02:19,389 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 02:02:19,389 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 02:02:19,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:02:19,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:02:19,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:02:19,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:02:19,391 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 -> e2f6f0ec12d3f914a423a8e055d641cff2f0504ff2e7f1c08b7700bf0e17ad5e [2024-11-09 02:02:19,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:02:19,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:02:19,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:02:19,731 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:02:19,731 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:02:19,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i [2024-11-09 02:02:21,279 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:02:21,482 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:02:21,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i [2024-11-09 02:02:21,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d10a2b7e/a4642302f9e04443bddc0605879443cd/FLAG675147a31 [2024-11-09 02:02:21,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d10a2b7e/a4642302f9e04443bddc0605879443cd [2024-11-09 02:02:21,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:02:21,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:02:21,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:02:21,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:02:21,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:02:21,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:02:21" (1/1) ... [2024-11-09 02:02:21,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@337b20e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:21, skipping insertion in model container [2024-11-09 02:02:21,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:02:21" (1/1) ... [2024-11-09 02:02:21,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:02:21,741 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i[916,929] [2024-11-09 02:02:21,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:02:21,830 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:02:21,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i[916,929] [2024-11-09 02:02:21,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:02:21,921 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:02:21,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:21 WrapperNode [2024-11-09 02:02:21,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:02:21,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:02:21,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:02:21,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:02:21,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:21" (1/1) ... [2024-11-09 02:02:21,954 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:21" (1/1) ... [2024-11-09 02:02:22,015 INFO L138 Inliner]: procedures = 37, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 407 [2024-11-09 02:02:22,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:02:22,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:02:22,016 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:02:22,016 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:02:22,029 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:21" (1/1) ... [2024-11-09 02:02:22,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:21" (1/1) ... [2024-11-09 02:02:22,035 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:21" (1/1) ... [2024-11-09 02:02:22,051 INFO L175 MemorySlicer]: Split 116 memory accesses to 2 slices as follows [2, 114]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 28 writes are split as follows [0, 28]. [2024-11-09 02:02:22,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:21" (1/1) ... [2024-11-09 02:02:22,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:21" (1/1) ... [2024-11-09 02:02:22,084 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:21" (1/1) ... [2024-11-09 02:02:22,092 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:21" (1/1) ... [2024-11-09 02:02:22,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:21" (1/1) ... [2024-11-09 02:02:22,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:21" (1/1) ... [2024-11-09 02:02:22,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:02:22,117 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:02:22,121 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:02:22,121 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:02:22,122 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:21" (1/1) ... [2024-11-09 02:02:22,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:02:22,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:02:22,154 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:02:22,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:02:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:02:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 02:02:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 02:02:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 02:02:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 02:02:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 02:02:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 02:02:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 02:02:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 02:02:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 02:02:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 02:02:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-09 02:02:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-09 02:02:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 02:02:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 02:02:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-09 02:02:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-09 02:02:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-09 02:02:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-09 02:02:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:02:22,194 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:02:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-09 02:02:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-09 02:02:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:02:22,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:02:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 02:02:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 02:02:22,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 02:02:22,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 02:02:22,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 02:02:22,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 02:02:22,316 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:02:22,317 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:02:25,137 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-11-09 02:02:25,138 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:02:25,160 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:02:25,160 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:02:25,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:02:25 BoogieIcfgContainer [2024-11-09 02:02:25,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:02:25,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:02:25,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:02:25,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:02:25,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:02:21" (1/3) ... [2024-11-09 02:02:25,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db8c207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:02:25, skipping insertion in model container [2024-11-09 02:02:25,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:21" (2/3) ... [2024-11-09 02:02:25,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db8c207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:02:25, skipping insertion in model container [2024-11-09 02:02:25,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:02:25" (3/3) ... [2024-11-09 02:02:25,168 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-33.i [2024-11-09 02:02:25,180 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:02:25,180 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:02:25,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:02:25,239 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;@1968dd63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:02:25,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:02:25,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 74 states have internal predecessors, (104), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:02:25,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 02:02:25,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:25,251 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:25,251 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:25,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:25,255 INFO L85 PathProgramCache]: Analyzing trace with hash -757554800, now seen corresponding path program 1 times [2024-11-09 02:02:25,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:02:25,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290569220] [2024-11-09 02:02:25,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:25,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:02:25,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:02:25,269 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:02:25,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 02:02:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:25,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 02:02:25,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:02:25,618 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 02:02:25,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:02:25,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:02:25,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290569220] [2024-11-09 02:02:25,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290569220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:25,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:25,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:02:25,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568501849] [2024-11-09 02:02:25,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:25,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:02:25,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:02:25,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:02:25,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:02:25,649 INFO L87 Difference]: Start difference. First operand has 85 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 74 states have internal predecessors, (104), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 02:02:25,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:25,671 INFO L93 Difference]: Finished difference Result 163 states and 247 transitions. [2024-11-09 02:02:25,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:02:25,673 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2024-11-09 02:02:25,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:25,681 INFO L225 Difference]: With dead ends: 163 [2024-11-09 02:02:25,682 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 02:02:25,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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-09 02:02:25,689 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:25,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:02:25,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 02:02:25,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-09 02:02:25,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:02:25,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-11-09 02:02:25,736 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 92 [2024-11-09 02:02:25,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:25,736 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-11-09 02:02:25,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 02:02:25,737 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-11-09 02:02:25,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 02:02:25,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:25,740 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:25,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 02:02:25,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:02:25,942 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:25,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:25,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1180114542, now seen corresponding path program 1 times [2024-11-09 02:02:25,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:02:25,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017568526] [2024-11-09 02:02:25,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:25,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:02:25,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:02:25,947 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:02:25,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 02:02:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:26,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 02:02:26,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:02:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-09 02:02:26,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:02:26,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:02:26,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017568526] [2024-11-09 02:02:26,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017568526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:26,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:26,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:02:26,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886325774] [2024-11-09 02:02:26,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:26,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:02:26,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:02:26,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:02:26,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:02:26,339 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 02:02:26,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:26,405 INFO L93 Difference]: Finished difference Result 161 states and 230 transitions. [2024-11-09 02:02:26,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:02:26,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2024-11-09 02:02:26,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:26,408 INFO L225 Difference]: With dead ends: 161 [2024-11-09 02:02:26,409 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 02:02:26,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:02:26,410 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:26,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:02:26,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 02:02:26,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-09 02:02:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:02:26,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2024-11-09 02:02:26,427 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 92 [2024-11-09 02:02:26,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:26,428 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2024-11-09 02:02:26,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 02:02:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2024-11-09 02:02:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 02:02:26,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:26,432 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:26,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 02:02:26,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:02:26,633 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:26,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:26,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2073600880, now seen corresponding path program 1 times [2024-11-09 02:02:26,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:02:26,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315398872] [2024-11-09 02:02:26,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:26,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:02:26,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:02:26,638 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:02:26,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 02:02:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:26,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 02:02:26,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:02:26,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-09 02:02:27,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2024-11-09 02:02:27,070 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:02:27,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:02:27,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:02:27,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315398872] [2024-11-09 02:02:27,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315398872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:27,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:27,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:02:27,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752760214] [2024-11-09 02:02:27,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:27,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:02:27,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:02:27,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:02:27,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:02:27,073 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:29,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 02:02:32,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 02:02:34,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:34,230 INFO L93 Difference]: Finished difference Result 245 states and 348 transitions. [2024-11-09 02:02:34,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:02:34,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-09 02:02:34,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:34,235 INFO L225 Difference]: With dead ends: 245 [2024-11-09 02:02:34,236 INFO L226 Difference]: Without dead ends: 165 [2024-11-09 02:02:34,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:02:34,239 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 96 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:34,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 450 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2024-11-09 02:02:34,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-09 02:02:34,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 91. [2024-11-09 02:02:34,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:02:34,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2024-11-09 02:02:34,251 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 92 [2024-11-09 02:02:34,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:34,252 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2024-11-09 02:02:34,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:34,252 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2024-11-09 02:02:34,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 02:02:34,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:34,254 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:34,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 02:02:34,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:02:34,455 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:34,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:34,456 INFO L85 PathProgramCache]: Analyzing trace with hash 941502738, now seen corresponding path program 1 times [2024-11-09 02:02:34,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:02:34,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436347644] [2024-11-09 02:02:34,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:34,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:02:34,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:02:34,461 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:02:34,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 02:02:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:34,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 02:02:34,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:02:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:02:34,765 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:02:34,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:02:34,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436347644] [2024-11-09 02:02:34,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436347644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:34,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:34,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:02:34,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352057138] [2024-11-09 02:02:34,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:34,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:02:34,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:02:34,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:02:34,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:02:34,769 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:34,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:34,839 INFO L93 Difference]: Finished difference Result 186 states and 263 transitions. [2024-11-09 02:02:34,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:02:34,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-09 02:02:34,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:34,841 INFO L225 Difference]: With dead ends: 186 [2024-11-09 02:02:34,841 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 02:02:34,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:02:34,843 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:34,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 519 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:02:34,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 02:02:34,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-09 02:02:34,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:02:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 134 transitions. [2024-11-09 02:02:34,853 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 134 transitions. Word has length 92 [2024-11-09 02:02:34,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:34,854 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 134 transitions. [2024-11-09 02:02:34,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 134 transitions. [2024-11-09 02:02:34,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 02:02:34,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:34,857 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:34,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 02:02:35,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:02:35,057 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:35,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:35,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1578457196, now seen corresponding path program 1 times [2024-11-09 02:02:35,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:02:35,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814789483] [2024-11-09 02:02:35,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:35,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:02:35,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:02:35,062 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:02:35,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 02:02:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:35,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 02:02:35,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:02:35,376 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:02:35,376 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:02:35,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:02:35,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814789483] [2024-11-09 02:02:35,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814789483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:35,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:35,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:02:35,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065451080] [2024-11-09 02:02:35,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:35,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:02:35,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:02:35,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:02:35,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:02:35,381 INFO L87 Difference]: Start difference. First operand 97 states and 134 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:35,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:35,471 INFO L93 Difference]: Finished difference Result 194 states and 269 transitions. [2024-11-09 02:02:35,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:02:35,472 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-09 02:02:35,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:35,473 INFO L225 Difference]: With dead ends: 194 [2024-11-09 02:02:35,474 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 02:02:35,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:02:35,476 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:35,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 616 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:02:35,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 02:02:35,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-11-09 02:02:35,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:02:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 136 transitions. [2024-11-09 02:02:35,492 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 136 transitions. Word has length 92 [2024-11-09 02:02:35,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:35,493 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 136 transitions. [2024-11-09 02:02:35,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:02:35,493 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 136 transitions. [2024-11-09 02:02:35,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 02:02:35,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:35,498 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:35,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 02:02:35,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:02:35,699 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:35,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:35,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1576610154, now seen corresponding path program 1 times [2024-11-09 02:02:35,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:02:35,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096899767] [2024-11-09 02:02:35,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:35,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:02:35,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:02:35,702 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:02:35,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 02:02:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:35,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 02:02:35,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:02:36,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-09 02:02:36,139 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 02:02:36,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:02:36,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:02:36,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096899767] [2024-11-09 02:02:36,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096899767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:36,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:36,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:02:36,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225335186] [2024-11-09 02:02:36,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:36,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:02:36,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:02:36,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:02:36,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:02:36,142 INFO L87 Difference]: Start difference. First operand 99 states and 136 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 02:02:40,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:40,085 INFO L93 Difference]: Finished difference Result 196 states and 270 transitions. [2024-11-09 02:02:40,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:02:40,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2024-11-09 02:02:40,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:40,087 INFO L225 Difference]: With dead ends: 196 [2024-11-09 02:02:40,087 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 02:02:40,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:02:40,088 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 88 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:40,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 329 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-09 02:02:40,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 02:02:40,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-11-09 02:02:40,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:02:40,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 135 transitions. [2024-11-09 02:02:40,104 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 135 transitions. Word has length 92 [2024-11-09 02:02:40,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:40,104 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 135 transitions. [2024-11-09 02:02:40,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 02:02:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 135 transitions. [2024-11-09 02:02:40,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 02:02:40,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:40,106 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:40,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 02:02:40,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:02:40,307 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:40,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:40,308 INFO L85 PathProgramCache]: Analyzing trace with hash 549285136, now seen corresponding path program 1 times [2024-11-09 02:02:40,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:02:40,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583190983] [2024-11-09 02:02:40,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:40,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:02:40,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:02:40,310 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:02:40,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 02:02:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:40,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 02:02:40,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:02:40,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-09 02:02:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-09 02:02:40,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:02:40,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:02:40,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583190983] [2024-11-09 02:02:40,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583190983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:40,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:40,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:02:40,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246280320] [2024-11-09 02:02:40,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:40,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:02:40,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:02:40,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:02:40,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:02:40,751 INFO L87 Difference]: Start difference. First operand 99 states and 135 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 02:02:43,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:43,903 INFO L93 Difference]: Finished difference Result 195 states and 267 transitions. [2024-11-09 02:02:43,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:02:43,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 94 [2024-11-09 02:02:43,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:43,904 INFO L225 Difference]: With dead ends: 195 [2024-11-09 02:02:43,904 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 02:02:43,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:02:43,905 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 81 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:43,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 325 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-09 02:02:43,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 02:02:43,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-11-09 02:02:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 86 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:02:43,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 132 transitions. [2024-11-09 02:02:43,912 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 132 transitions. Word has length 94 [2024-11-09 02:02:43,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:43,912 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 132 transitions. [2024-11-09 02:02:43,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 02:02:43,913 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 132 transitions. [2024-11-09 02:02:43,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 02:02:43,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:43,914 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:43,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 02:02:44,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:02:44,115 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:44,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:44,115 INFO L85 PathProgramCache]: Analyzing trace with hash -32472104, now seen corresponding path program 1 times [2024-11-09 02:02:44,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:02:44,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191844634] [2024-11-09 02:02:44,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:44,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:02:44,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:02:44,117 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:02:44,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 02:02:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:44,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 02:02:44,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:02:44,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 40 [2024-11-09 02:02:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 24 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 02:02:44,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:02:44,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2024-11-09 02:02:44,884 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-09 02:02:44,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:02:44,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191844634] [2024-11-09 02:02:44,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191844634] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:02:44,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 02:02:44,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-09 02:02:44,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143701006] [2024-11-09 02:02:44,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 02:02:44,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 02:02:44,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:02:44,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 02:02:44,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:02:44,886 INFO L87 Difference]: Start difference. First operand 97 states and 132 transitions. Second operand has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-09 02:02:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:50,335 INFO L93 Difference]: Finished difference Result 204 states and 276 transitions. [2024-11-09 02:02:50,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 02:02:50,335 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 96 [2024-11-09 02:02:50,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:50,336 INFO L225 Difference]: With dead ends: 204 [2024-11-09 02:02:50,337 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 02:02:50,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-09 02:02:50,339 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 89 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:50,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 495 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-09 02:02:50,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 02:02:50,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-11-09 02:02:50,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:02:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 130 transitions. [2024-11-09 02:02:50,352 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 130 transitions. Word has length 96 [2024-11-09 02:02:50,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:50,353 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 130 transitions. [2024-11-09 02:02:50,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-09 02:02:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 130 transitions. [2024-11-09 02:02:50,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 02:02:50,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:50,357 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:02:50,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 02:02:50,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:02:50,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:50,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:50,559 INFO L85 PathProgramCache]: Analyzing trace with hash 320616278, now seen corresponding path program 1 times [2024-11-09 02:02:50,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:02:50,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034856718] [2024-11-09 02:02:50,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:50,559 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:02:50,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:02:50,560 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:02:50,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 02:02:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:50,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 02:02:50,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:02:50,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:02:50,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2024-11-09 02:02:50,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-11-09 02:02:50,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-09 02:02:51,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-09 02:02:51,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-09 02:02:51,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-09 02:02:51,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-09 02:02:51,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-09 02:02:51,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:02:51,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 14 [2024-11-09 02:02:52,343 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 24 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 02:02:52,343 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:02:52,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-09 02:02:52,969 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-09 02:02:52,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:02:52,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034856718] [2024-11-09 02:02:52,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034856718] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:02:52,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 02:02:52,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2024-11-09 02:02:52,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972865384] [2024-11-09 02:02:52,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 02:02:52,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 02:02:52,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:02:52,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 02:02:52,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-11-09 02:02:52,972 INFO L87 Difference]: Start difference. First operand 97 states and 130 transitions. Second operand has 18 states, 16 states have (on average 5.9375) internal successors, (95), 17 states have internal predecessors, (95), 5 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18)