./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-7.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 93ab9944ae60dcd2ea1c66f43a88f1592af9bef96260d06a583314616c867c3e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:33:34,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:33:34,879 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 05:33:34,887 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:33:34,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:33:34,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:33:34,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:33:34,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:33:34,919 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:33:34,920 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:33:34,920 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:33:34,920 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:33:34,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:33:34,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:33:34,924 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:33:34,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:33:34,925 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:33:34,925 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:33:34,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 05:33:34,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:33:34,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:33:34,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:33:34,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:33:34,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:33:34,931 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:33:34,931 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:33:34,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:33:34,932 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:33:34,932 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:33:34,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:33:34,933 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:33:34,933 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:33:34,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:33:34,933 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:33:34,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:33:34,934 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:33:34,934 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 05:33:34,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 05:33:34,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:33:34,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:33:34,936 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:33:34,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:33:34,937 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 -> 93ab9944ae60dcd2ea1c66f43a88f1592af9bef96260d06a583314616c867c3e [2024-11-20 05:33:35,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:33:35,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:33:35,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:33:35,253 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:33:35,253 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:33:35,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i [2024-11-20 05:33:36,884 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:33:37,162 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:33:37,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i [2024-11-20 05:33:37,183 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ce9d8c74/b38214d165604f54bd23cdbe1bc47a41/FLAG7d839f568 [2024-11-20 05:33:37,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ce9d8c74/b38214d165604f54bd23cdbe1bc47a41 [2024-11-20 05:33:37,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:33:37,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:33:37,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:33:37,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:33:37,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:33:37,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:33:37" (1/1) ... [2024-11-20 05:33:37,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3654d148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:37, skipping insertion in model container [2024-11-20 05:33:37,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:33:37" (1/1) ... [2024-11-20 05:33:37,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:33:37,442 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i[918,931] [2024-11-20 05:33:37,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:33:37,545 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:33:37,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i[918,931] [2024-11-20 05:33:37,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:33:37,628 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:33:37,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:37 WrapperNode [2024-11-20 05:33:37,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:33:37,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:33:37,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:33:37,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:33:37,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:37" (1/1) ... [2024-11-20 05:33:37,653 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:37" (1/1) ... [2024-11-20 05:33:37,699 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 299 [2024-11-20 05:33:37,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:33:37,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:33:37,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:33:37,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:33:37,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:37" (1/1) ... [2024-11-20 05:33:37,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:37" (1/1) ... [2024-11-20 05:33:37,724 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:37" (1/1) ... [2024-11-20 05:33:37,774 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 05:33:37,778 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:37" (1/1) ... [2024-11-20 05:33:37,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:37" (1/1) ... [2024-11-20 05:33:37,792 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:37" (1/1) ... [2024-11-20 05:33:37,797 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:37" (1/1) ... [2024-11-20 05:33:37,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:37" (1/1) ... [2024-11-20 05:33:37,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:37" (1/1) ... [2024-11-20 05:33:37,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:33:37,814 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:33:37,814 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:33:37,814 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:33:37,815 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:37" (1/1) ... [2024-11-20 05:33:37,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:33:37,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:33:37,895 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-20 05:33:37,897 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-20 05:33:37,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:33:37,938 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:33:37,938 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:33:37,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 05:33:37,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:33:37,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:33:38,027 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:33:38,030 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:33:38,516 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-20 05:33:38,516 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:33:38,534 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:33:38,535 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:33:38,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:33:38 BoogieIcfgContainer [2024-11-20 05:33:38,536 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:33:38,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:33:38,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:33:38,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:33:38,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:33:37" (1/3) ... [2024-11-20 05:33:38,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b51d5c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:33:38, skipping insertion in model container [2024-11-20 05:33:38,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:37" (2/3) ... [2024-11-20 05:33:38,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b51d5c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:33:38, skipping insertion in model container [2024-11-20 05:33:38,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:33:38" (3/3) ... [2024-11-20 05:33:38,545 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i [2024-11-20 05:33:38,564 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:33:38,564 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:33:38,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:33:38,629 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;@43506be2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:33:38,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:33:38,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 88 states have internal predecessors, (125), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-20 05:33:38,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-20 05:33:38,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:33:38,648 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:33:38,648 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:33:38,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:33:38,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1167509934, now seen corresponding path program 1 times [2024-11-20 05:33:38,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:33:38,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229154726] [2024-11-20 05:33:38,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:33:38,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:33:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:33:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:33:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:33:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 05:33:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:33:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 05:33:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:33:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 05:33:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:33:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:33:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:33:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 05:33:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:33:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 05:33:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:33:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:33:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:33:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:33:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:33:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:33:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 05:33:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 05:33:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-20 05:33:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 05:33:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:33:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-20 05:33:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 05:33:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 05:33:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 05:33:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-20 05:33:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 05:33:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 05:33:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 05:33:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 05:33:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 05:33:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-20 05:33:39,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:33:39,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229154726] [2024-11-20 05:33:39,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229154726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:33:39,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:33:39,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:33:39,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28392958] [2024-11-20 05:33:39,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:33:39,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:33:39,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:33:39,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:33:39,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:33:39,300 INFO L87 Difference]: Start difference. First operand has 125 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 88 states have internal predecessors, (125), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-20 05:33:39,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:33:39,336 INFO L93 Difference]: Finished difference Result 238 states and 412 transitions. [2024-11-20 05:33:39,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:33:39,340 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 230 [2024-11-20 05:33:39,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:33:39,349 INFO L225 Difference]: With dead ends: 238 [2024-11-20 05:33:39,349 INFO L226 Difference]: Without dead ends: 116 [2024-11-20 05:33:39,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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-20 05:33:39,356 INFO L432 NwaCegarLoop]: 179 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, 179 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-20 05:33:39,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:33:39,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-20 05:33:39,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-20 05:33:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-20 05:33:39,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 179 transitions. [2024-11-20 05:33:39,411 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 179 transitions. Word has length 230 [2024-11-20 05:33:39,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:33:39,412 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 179 transitions. [2024-11-20 05:33:39,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-20 05:33:39,414 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 179 transitions. [2024-11-20 05:33:39,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-20 05:33:39,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:33:39,423 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:33:39,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 05:33:39,424 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:33:39,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:33:39,426 INFO L85 PathProgramCache]: Analyzing trace with hash -516656024, now seen corresponding path program 1 times [2024-11-20 05:33:39,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:33:39,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172650469] [2024-11-20 05:33:39,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:33:39,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:33:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:33:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:33:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:33:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 05:33:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:33:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 05:33:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:33:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 05:33:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:33:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:33:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:33:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 05:33:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:33:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 05:33:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:33:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:33:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:33:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:33:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:33:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:33:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 05:33:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 05:33:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-20 05:33:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 05:33:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:33:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-20 05:33:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 05:33:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 05:33:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 05:33:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:39,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-20 05:33:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 05:33:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 05:33:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 05:33:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 05:33:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 05:33:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-20 05:33:40,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:33:40,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172650469] [2024-11-20 05:33:40,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172650469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:33:40,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:33:40,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:33:40,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447542129] [2024-11-20 05:33:40,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:33:40,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:33:40,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:33:40,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:33:40,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:33:40,058 INFO L87 Difference]: Start difference. First operand 116 states and 179 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:33:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:33:40,155 INFO L93 Difference]: Finished difference Result 342 states and 531 transitions. [2024-11-20 05:33:40,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:33:40,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 230 [2024-11-20 05:33:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:33:40,166 INFO L225 Difference]: With dead ends: 342 [2024-11-20 05:33:40,166 INFO L226 Difference]: Without dead ends: 229 [2024-11-20 05:33:40,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 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-20 05:33:40,168 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 108 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:33:40,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 352 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:33:40,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-20 05:33:40,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2024-11-20 05:33:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 154 states have (on average 1.37012987012987) internal successors, (211), 154 states have internal predecessors, (211), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-20 05:33:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 351 transitions. [2024-11-20 05:33:40,230 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 351 transitions. Word has length 230 [2024-11-20 05:33:40,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:33:40,233 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 351 transitions. [2024-11-20 05:33:40,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:33:40,234 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 351 transitions. [2024-11-20 05:33:40,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-20 05:33:40,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:33:40,241 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:33:40,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 05:33:40,241 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:33:40,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:33:40,242 INFO L85 PathProgramCache]: Analyzing trace with hash 905884554, now seen corresponding path program 1 times [2024-11-20 05:33:40,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:33:40,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983291091] [2024-11-20 05:33:40,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:33:40,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:33:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:33:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:33:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:33:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 05:33:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:33:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 05:33:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:33:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 05:33:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:33:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:33:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:33:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 05:33:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:33:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 05:33:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:33:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:33:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:33:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:33:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:33:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:33:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 05:33:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 05:33:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-20 05:33:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 05:33:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:33:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-20 05:33:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 05:33:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 05:33:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 05:33:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-20 05:33:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 05:33:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 05:33:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 05:33:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 05:33:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 05:33:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-20 05:33:40,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:33:40,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983291091] [2024-11-20 05:33:40,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983291091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:33:40,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:33:40,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:33:40,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419067629] [2024-11-20 05:33:40,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:33:40,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:33:40,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:33:40,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:33:40,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:33:40,622 INFO L87 Difference]: Start difference. First operand 227 states and 351 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:33:40,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:33:40,679 INFO L93 Difference]: Finished difference Result 547 states and 846 transitions. [2024-11-20 05:33:40,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:33:40,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 233 [2024-11-20 05:33:40,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:33:40,686 INFO L225 Difference]: With dead ends: 547 [2024-11-20 05:33:40,686 INFO L226 Difference]: Without dead ends: 323 [2024-11-20 05:33:40,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 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-20 05:33:40,690 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 81 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:33:40,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 343 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:33:40,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-20 05:33:40,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 297. [2024-11-20 05:33:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 188 states have (on average 1.3085106382978724) internal successors, (246), 188 states have internal predecessors, (246), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-20 05:33:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 456 transitions. [2024-11-20 05:33:40,738 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 456 transitions. Word has length 233 [2024-11-20 05:33:40,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:33:40,738 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 456 transitions. [2024-11-20 05:33:40,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:33:40,739 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 456 transitions. [2024-11-20 05:33:40,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-20 05:33:40,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:33:40,742 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:33:40,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 05:33:40,742 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:33:40,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:33:40,743 INFO L85 PathProgramCache]: Analyzing trace with hash 481572318, now seen corresponding path program 1 times [2024-11-20 05:33:40,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:33:40,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087244729] [2024-11-20 05:33:40,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:33:40,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:33:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:33:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:33:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:33:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 05:33:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:33:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 05:33:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:33:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 05:33:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:33:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:33:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:33:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 05:33:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:33:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 05:33:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:33:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:40,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:33:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:33:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:33:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:33:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:33:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 05:33:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 05:33:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-20 05:33:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 05:33:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:33:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-20 05:33:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 05:33:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 05:33:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 05:33:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-20 05:33:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 05:33:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 05:33:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 05:33:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 05:33:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 05:33:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-20 05:33:41,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:33:41,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087244729] [2024-11-20 05:33:41,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087244729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:33:41,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:33:41,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:33:41,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998554013] [2024-11-20 05:33:41,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:33:41,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:33:41,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:33:41,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:33:41,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:33:41,104 INFO L87 Difference]: Start difference. First operand 297 states and 456 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:33:41,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:33:41,176 INFO L93 Difference]: Finished difference Result 547 states and 845 transitions. [2024-11-20 05:33:41,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:33:41,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 234 [2024-11-20 05:33:41,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:33:41,183 INFO L225 Difference]: With dead ends: 547 [2024-11-20 05:33:41,183 INFO L226 Difference]: Without dead ends: 323 [2024-11-20 05:33:41,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 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-20 05:33:41,189 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 79 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:33:41,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 334 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:33:41,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-20 05:33:41,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 298. [2024-11-20 05:33:41,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 189 states have (on average 1.306878306878307) internal successors, (247), 189 states have internal predecessors, (247), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-20 05:33:41,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 457 transitions. [2024-11-20 05:33:41,235 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 457 transitions. Word has length 234 [2024-11-20 05:33:41,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:33:41,237 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 457 transitions. [2024-11-20 05:33:41,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:33:41,237 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 457 transitions. [2024-11-20 05:33:41,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-20 05:33:41,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:33:41,240 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:33:41,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 05:33:41,240 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:33:41,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:33:41,241 INFO L85 PathProgramCache]: Analyzing trace with hash 305854311, now seen corresponding path program 1 times [2024-11-20 05:33:41,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:33:41,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000076323] [2024-11-20 05:33:41,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:33:41,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:33:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:33:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:33:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:33:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 05:33:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:33:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 05:33:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:33:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 05:33:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:33:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:33:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:33:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 05:33:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:33:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 05:33:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:33:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:33:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:33:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:33:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:33:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:33:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 05:33:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 05:33:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-20 05:33:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 05:33:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:33:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-20 05:33:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 05:33:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 05:33:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 05:33:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-20 05:33:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 05:33:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 05:33:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 05:33:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 05:33:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 05:33:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-20 05:33:41,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:33:41,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000076323] [2024-11-20 05:33:41,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000076323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:33:41,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:33:41,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:33:41,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828316463] [2024-11-20 05:33:41,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:33:41,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:33:41,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:33:41,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:33:41,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:33:41,521 INFO L87 Difference]: Start difference. First operand 298 states and 457 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:33:41,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:33:41,579 INFO L93 Difference]: Finished difference Result 553 states and 854 transitions. [2024-11-20 05:33:41,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:33:41,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 235 [2024-11-20 05:33:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:33:41,583 INFO L225 Difference]: With dead ends: 553 [2024-11-20 05:33:41,583 INFO L226 Difference]: Without dead ends: 329 [2024-11-20 05:33:41,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 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-20 05:33:41,585 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 78 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:33:41,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 345 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:33:41,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-20 05:33:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 314. [2024-11-20 05:33:41,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 205 states have (on average 1.326829268292683) internal successors, (272), 205 states have internal predecessors, (272), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-20 05:33:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 482 transitions. [2024-11-20 05:33:41,615 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 482 transitions. Word has length 235 [2024-11-20 05:33:41,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:33:41,616 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 482 transitions. [2024-11-20 05:33:41,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:33:41,616 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 482 transitions. [2024-11-20 05:33:41,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-20 05:33:41,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:33:41,618 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:33:41,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 05:33:41,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:33:41,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:33:41,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1231996246, now seen corresponding path program 1 times [2024-11-20 05:33:41,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:33:41,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024511149] [2024-11-20 05:33:41,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:33:41,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:33:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:33:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:33:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:33:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 05:33:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:33:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 05:33:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:33:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 05:33:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:33:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:33:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:33:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 05:33:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:33:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 05:33:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:33:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:33:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:33:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:33:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:33:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:33:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 05:33:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 05:33:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-20 05:33:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 05:33:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:33:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-20 05:33:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 05:33:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 05:33:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 05:33:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-20 05:33:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 05:33:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 05:33:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 05:33:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 05:33:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 05:33:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-20 05:33:41,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:33:41,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024511149] [2024-11-20 05:33:41,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024511149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:33:41,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:33:41,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:33:41,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918283973] [2024-11-20 05:33:41,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:33:41,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:33:41,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:33:41,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:33:41,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:33:41,942 INFO L87 Difference]: Start difference. First operand 314 states and 482 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:33:42,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:33:42,027 INFO L93 Difference]: Finished difference Result 555 states and 856 transitions. [2024-11-20 05:33:42,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 05:33:42,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 237 [2024-11-20 05:33:42,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:33:42,031 INFO L225 Difference]: With dead ends: 555 [2024-11-20 05:33:42,034 INFO L226 Difference]: Without dead ends: 331 [2024-11-20 05:33:42,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:33:42,036 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 75 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:33:42,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 506 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:33:42,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-20 05:33:42,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 317. [2024-11-20 05:33:42,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 208 states have (on average 1.3221153846153846) internal successors, (275), 208 states have internal predecessors, (275), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-20 05:33:42,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 485 transitions. [2024-11-20 05:33:42,073 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 485 transitions. Word has length 237 [2024-11-20 05:33:42,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:33:42,074 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 485 transitions. [2024-11-20 05:33:42,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:33:42,074 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 485 transitions. [2024-11-20 05:33:42,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-20 05:33:42,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:33:42,079 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:33:42,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 05:33:42,079 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:33:42,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:33:42,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1791545696, now seen corresponding path program 1 times [2024-11-20 05:33:42,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:33:42,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124923737] [2024-11-20 05:33:42,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:33:42,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:33:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:33:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:33:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:33:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 05:33:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:33:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 05:33:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:33:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 05:33:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:33:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:33:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:33:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 05:33:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:33:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 05:33:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:33:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:33:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:33:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:33:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:33:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:33:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 05:33:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 05:33:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-20 05:33:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 05:33:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:33:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-20 05:33:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 05:33:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 05:33:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 05:33:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-20 05:33:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 05:33:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 05:33:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 05:33:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 05:33:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 05:33:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-20 05:33:42,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:33:42,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124923737] [2024-11-20 05:33:42,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124923737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:33:42,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:33:42,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 05:33:42,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152986800] [2024-11-20 05:33:42,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:33:42,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 05:33:42,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:33:42,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 05:33:42,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 05:33:42,863 INFO L87 Difference]: Start difference. First operand 317 states and 485 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:33:43,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:33:43,317 INFO L93 Difference]: Finished difference Result 601 states and 918 transitions. [2024-11-20 05:33:43,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 05:33:43,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 238 [2024-11-20 05:33:43,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:33:43,321 INFO L225 Difference]: With dead ends: 601 [2024-11-20 05:33:43,321 INFO L226 Difference]: Without dead ends: 364 [2024-11-20 05:33:43,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-20 05:33:43,322 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 171 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 05:33:43,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 494 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 05:33:43,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-20 05:33:43,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 327. [2024-11-20 05:33:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 218 states have (on average 1.31651376146789) internal successors, (287), 218 states have internal predecessors, (287), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-20 05:33:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 497 transitions. [2024-11-20 05:33:43,396 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 497 transitions. Word has length 238 [2024-11-20 05:33:43,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:33:43,396 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 497 transitions. [2024-11-20 05:33:43,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:33:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 497 transitions. [2024-11-20 05:33:43,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-20 05:33:43,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:33:43,400 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:33:43,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 05:33:43,401 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:33:43,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:33:43,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1924003940, now seen corresponding path program 1 times [2024-11-20 05:33:43,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:33:43,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609555492] [2024-11-20 05:33:43,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:33:43,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:33:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:33:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:33:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:33:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 05:33:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:33:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 05:33:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:33:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 05:33:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:33:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:33:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:33:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 05:33:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:33:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 05:33:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:33:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:33:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:33:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:33:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:33:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:33:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 05:33:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 05:33:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-20 05:33:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 05:33:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:33:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-20 05:33:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 05:33:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 05:33:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 05:33:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-20 05:33:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 05:33:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 05:33:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 05:33:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 05:33:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 05:33:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-20 05:33:43,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:33:43,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609555492] [2024-11-20 05:33:43,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609555492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:33:43,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:33:43,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:33:43,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785139738] [2024-11-20 05:33:43,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:33:43,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:33:43,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:33:43,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:33:43,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:33:43,748 INFO L87 Difference]: Start difference. First operand 327 states and 497 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:33:43,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:33:43,944 INFO L93 Difference]: Finished difference Result 761 states and 1166 transitions. [2024-11-20 05:33:43,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:33:43,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 239 [2024-11-20 05:33:43,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:33:43,950 INFO L225 Difference]: With dead ends: 761 [2024-11-20 05:33:43,950 INFO L226 Difference]: Without dead ends: 524 [2024-11-20 05:33:43,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:33:43,952 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 120 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:33:43,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 412 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:33:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-11-20 05:33:44,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 520. [2024-11-20 05:33:44,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 360 states have (on average 1.3444444444444446) internal successors, (484), 362 states have internal predecessors, (484), 153 states have call successors, (153), 6 states have call predecessors, (153), 6 states have return successors, (153), 151 states have call predecessors, (153), 153 states have call successors, (153) [2024-11-20 05:33:44,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 790 transitions. [2024-11-20 05:33:44,041 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 790 transitions. Word has length 239 [2024-11-20 05:33:44,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:33:44,042 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 790 transitions. [2024-11-20 05:33:44,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:33:44,043 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 790 transitions. [2024-11-20 05:33:44,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-20 05:33:44,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:33:44,045 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:33:44,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 05:33:44,045 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:33:44,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:33:44,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1337197926, now seen corresponding path program 1 times [2024-11-20 05:33:44,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:33:44,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016452094] [2024-11-20 05:33:44,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:33:44,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:33:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:33:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:33:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:33:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 05:33:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:33:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 05:33:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:33:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 05:33:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:33:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:33:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:33:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 05:33:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:33:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 05:33:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:33:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:33:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:33:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:33:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:33:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:33:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 05:33:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 05:33:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-20 05:33:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 05:33:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:33:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-20 05:33:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 05:33:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 05:33:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 05:33:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-20 05:33:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 05:33:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 05:33:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 05:33:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 05:33:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 05:33:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-20 05:33:44,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:33:44,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016452094] [2024-11-20 05:33:44,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016452094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:33:44,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:33:44,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 05:33:44,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615844175] [2024-11-20 05:33:44,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:33:44,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 05:33:44,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:33:44,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 05:33:44,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 05:33:44,935 INFO L87 Difference]: Start difference. First operand 520 states and 790 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:33:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:33:45,762 INFO L93 Difference]: Finished difference Result 1007 states and 1535 transitions. [2024-11-20 05:33:45,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 05:33:45,763 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 239 [2024-11-20 05:33:45,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:33:45,768 INFO L225 Difference]: With dead ends: 1007 [2024-11-20 05:33:45,769 INFO L226 Difference]: Without dead ends: 596 [2024-11-20 05:33:45,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-20 05:33:45,771 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 214 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 05:33:45,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 798 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 05:33:45,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-11-20 05:33:45,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 527. [2024-11-20 05:33:45,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 367 states have (on average 1.340599455040872) internal successors, (492), 369 states have internal predecessors, (492), 153 states have call successors, (153), 6 states have call predecessors, (153), 6 states have return successors, (153), 151 states have call predecessors, (153), 153 states have call successors, (153) [2024-11-20 05:33:45,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 798 transitions. [2024-11-20 05:33:45,857 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 798 transitions. Word has length 239 [2024-11-20 05:33:45,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:33:45,858 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 798 transitions. [2024-11-20 05:33:45,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:33:45,858 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 798 transitions. [2024-11-20 05:33:45,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-20 05:33:45,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:33:45,860 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:33:45,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 05:33:45,861 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:33:45,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:33:45,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1848382325, now seen corresponding path program 1 times [2024-11-20 05:33:45,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:33:45,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144822590] [2024-11-20 05:33:45,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:33:45,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:33:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:33:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:33:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:33:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 05:33:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:33:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 05:33:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:33:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 05:33:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:33:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:33:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:33:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 05:33:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:33:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 05:33:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:33:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:33:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:33:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:33:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:33:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:33:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 05:33:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 05:33:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-20 05:33:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 05:33:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:33:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-20 05:33:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 05:33:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 05:33:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 05:33:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-20 05:33:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 05:33:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 05:33:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 05:33:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 05:33:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 05:33:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 75 proven. 27 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-11-20 05:33:46,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:33:46,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144822590] [2024-11-20 05:33:46,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144822590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 05:33:46,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897769805] [2024-11-20 05:33:46,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:33:46,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:33:46,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:33:46,455 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-20 05:33:46,457 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-20 05:33:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:46,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 05:33:46,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:33:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 984 proven. 27 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2024-11-20 05:33:47,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:33:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 75 proven. 27 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-11-20 05:33:48,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897769805] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 05:33:48,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 05:33:48,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 15 [2024-11-20 05:33:48,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257298258] [2024-11-20 05:33:48,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 05:33:48,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 05:33:48,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:33:48,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 05:33:48,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-20 05:33:48,144 INFO L87 Difference]: Start difference. First operand 527 states and 798 transitions. Second operand has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 states have internal predecessors, (164), 6 states have call successors, (105), 3 states have call predecessors, (105), 6 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) [2024-11-20 05:33:49,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:33:49,304 INFO L93 Difference]: Finished difference Result 1367 states and 2077 transitions. [2024-11-20 05:33:49,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-20 05:33:49,305 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 states have internal predecessors, (164), 6 states have call successors, (105), 3 states have call predecessors, (105), 6 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) Word has length 240 [2024-11-20 05:33:49,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:33:49,312 INFO L225 Difference]: With dead ends: 1367 [2024-11-20 05:33:49,312 INFO L226 Difference]: Without dead ends: 950 [2024-11-20 05:33:49,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 541 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2024-11-20 05:33:49,315 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 674 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 05:33:49,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1198 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 05:33:49,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2024-11-20 05:33:49,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 563. [2024-11-20 05:33:49,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 402 states have (on average 1.345771144278607) internal successors, (541), 404 states have internal predecessors, (541), 153 states have call successors, (153), 7 states have call predecessors, (153), 7 states have return successors, (153), 151 states have call predecessors, (153), 153 states have call successors, (153) [2024-11-20 05:33:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 847 transitions. [2024-11-20 05:33:49,388 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 847 transitions. Word has length 240 [2024-11-20 05:33:49,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:33:49,389 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 847 transitions. [2024-11-20 05:33:49,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 states have internal predecessors, (164), 6 states have call successors, (105), 3 states have call predecessors, (105), 6 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) [2024-11-20 05:33:49,389 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 847 transitions. [2024-11-20 05:33:49,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-20 05:33:49,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:33:49,392 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:33:49,403 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-20 05:33:49,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-20 05:33:49,593 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:33:49,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:33:49,594 INFO L85 PathProgramCache]: Analyzing trace with hash 452271608, now seen corresponding path program 1 times [2024-11-20 05:33:49,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:33:49,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006790378] [2024-11-20 05:33:49,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:33:49,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:33:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:49,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:33:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:49,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:33:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:49,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:33:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:49,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 05:33:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:49,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:33:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:49,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 05:33:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:49,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:33:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:49,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 05:33:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:49,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:33:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:49,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:33:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:49,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:33:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:49,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 05:33:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:49,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:33:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 05:33:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:33:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:33:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:33:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:33:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:33:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:33:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 05:33:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 05:33:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-20 05:33:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 05:33:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:33:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-20 05:33:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 05:33:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 05:33:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 05:33:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-20 05:33:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 05:33:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 05:33:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 05:33:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 05:33:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 05:33:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:33:50,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-20 05:33:50,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:33:50,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006790378] [2024-11-20 05:33:50,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006790378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:33:50,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:33:50,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 05:33:50,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81651452] [2024-11-20 05:33:50,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:33:50,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 05:33:50,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:33:50,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 05:33:50,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 05:33:50,084 INFO L87 Difference]: Start difference. First operand 563 states and 847 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:33:50,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:33:50,675 INFO L93 Difference]: Finished difference Result 1039 states and 1575 transitions. [2024-11-20 05:33:50,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 05:33:50,676 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 240 [2024-11-20 05:33:50,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:33:50,680 INFO L225 Difference]: With dead ends: 1039 [2024-11-20 05:33:50,681 INFO L226 Difference]: Without dead ends: 590 [2024-11-20 05:33:50,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-20 05:33:50,683 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 126 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 05:33:50,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 779 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 05:33:50,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-11-20 05:33:50,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 563. [2024-11-20 05:33:50,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 402 states have (on average 1.3432835820895523) internal successors, (540), 404 states have internal predecessors, (540), 153 states have call successors, (153), 7 states have call predecessors, (153), 7 states have return successors, (153), 151 states have call predecessors, (153), 153 states have call successors, (153) [2024-11-20 05:33:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 846 transitions. [2024-11-20 05:33:50,749 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 846 transitions. Word has length 240 [2024-11-20 05:33:50,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:33:50,749 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 846 transitions. [2024-11-20 05:33:50,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:33:50,750 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 846 transitions. [2024-11-20 05:33:50,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-20 05:33:50,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:33:50,753 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:33:50,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 05:33:50,753 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:33:50,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:33:50,753 INFO L85 PathProgramCache]: Analyzing trace with hash 515332765, now seen corresponding path program 1 times [2024-11-20 05:33:50,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:33:50,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611295172] [2024-11-20 05:33:50,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:33:50,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:33:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:33:50,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 05:33:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:33:51,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 05:33:51,002 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 05:33:51,003 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 05:33:51,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 05:33:51,007 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:33:51,162 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 05:33:51,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:33:51 BoogieIcfgContainer [2024-11-20 05:33:51,170 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 05:33:51,170 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 05:33:51,170 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 05:33:51,170 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 05:33:51,171 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:33:38" (3/4) ... [2024-11-20 05:33:51,174 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 05:33:51,175 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 05:33:51,175 INFO L158 Benchmark]: Toolchain (without parser) took 13970.89ms. Allocated memory was 190.8MB in the beginning and 356.5MB in the end (delta: 165.7MB). Free memory was 123.3MB in the beginning and 188.4MB in the end (delta: -65.0MB). Peak memory consumption was 102.2MB. Max. memory is 16.1GB. [2024-11-20 05:33:51,176 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 79.4MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:33:51,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.50ms. Allocated memory is still 190.8MB. Free memory was 123.1MB in the beginning and 104.9MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-20 05:33:51,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.45ms. Allocated memory is still 190.8MB. Free memory was 104.7MB in the beginning and 100.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 05:33:51,176 INFO L158 Benchmark]: Boogie Preprocessor took 113.12ms. Allocated memory is still 190.8MB. Free memory was 100.5MB in the beginning and 159.1MB in the end (delta: -58.5MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-11-20 05:33:51,177 INFO L158 Benchmark]: RCFGBuilder took 721.77ms. Allocated memory is still 190.8MB. Free memory was 159.1MB in the beginning and 127.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-20 05:33:51,177 INFO L158 Benchmark]: TraceAbstraction took 12632.08ms. Allocated memory was 190.8MB in the beginning and 356.5MB in the end (delta: 165.7MB). Free memory was 126.9MB in the beginning and 188.4MB in the end (delta: -61.5MB). Peak memory consumption was 105.8MB. Max. memory is 16.1GB. [2024-11-20 05:33:51,178 INFO L158 Benchmark]: Witness Printer took 4.69ms. Allocated memory is still 356.5MB. Free memory is still 188.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:33:51,179 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.23ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 79.4MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 422.50ms. Allocated memory is still 190.8MB. Free memory was 123.1MB in the beginning and 104.9MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.45ms. Allocated memory is still 190.8MB. Free memory was 104.7MB in the beginning and 100.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.12ms. Allocated memory is still 190.8MB. Free memory was 100.5MB in the beginning and 159.1MB in the end (delta: -58.5MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * RCFGBuilder took 721.77ms. Allocated memory is still 190.8MB. Free memory was 159.1MB in the beginning and 127.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12632.08ms. Allocated memory was 190.8MB in the beginning and 356.5MB in the end (delta: 165.7MB). Free memory was 126.9MB in the beginning and 188.4MB in the end (delta: -61.5MB). Peak memory consumption was 105.8MB. Max. memory is 16.1GB. * Witness Printer took 4.69ms. Allocated memory is still 356.5MB. Free memory is still 188.4MB. 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 196, overapproximation of bitwiseOr at line 65, overapproximation of bitwiseAnd at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryArithmeticFLOAToperation at line 111. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] float var_1_2 = 200.875; [L24] float var_1_3 = 100.25; [L25] float var_1_4 = 99999999.34; [L26] unsigned short int var_1_5 = 10; [L27] unsigned short int var_1_6 = 8; [L28] unsigned long int var_1_7 = 25; [L29] unsigned char var_1_8 = 0; [L30] signed long int var_1_9 = -16; [L31] unsigned short int var_1_10 = 25; [L32] unsigned short int var_1_11 = 10000; [L33] signed short int var_1_12 = -32; [L34] signed char var_1_13 = 4; [L35] signed char var_1_14 = 25; [L36] signed short int var_1_15 = -16; [L37] signed short int var_1_16 = 100; [L38] signed short int var_1_17 = 8; [L39] float var_1_18 = 5.8; [L40] float var_1_19 = 0.19999999999999996; [L41] float var_1_20 = 1.5; [L42] float var_1_21 = 10000000.5; [L43] float var_1_22 = 4.5; [L44] float var_1_23 = 4.25; [L45] signed short int var_1_24 = -16; [L46] unsigned short int var_1_25 = 100; [L47] unsigned long int var_1_27 = 8; [L48] double var_1_32 = 1000000.625; [L49] double var_1_33 = 63.5; [L50] signed long int var_1_34 = 8; [L51] unsigned char var_1_36 = 0; [L52] unsigned char var_1_37 = 0; [L53] unsigned char var_1_38 = 1; [L54] float var_1_39 = 10000000000000.5; [L55] float var_1_40 = 99999999999.625; [L56] float var_1_41 = 4.4; [L57] float var_1_42 = 24.5; [L58] float var_1_43 = 0.0; [L59] float var_1_44 = 0.4; [L60] signed long int var_1_45 = -128; [L61] signed short int var_1_46 = 2; VAL [isInitial=0, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_2=1607/8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_3=401/4, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L200] isInitial = 1 [L201] FCALL initially() [L202] COND TRUE 1 [L203] FCALL updateLastVariables() [L204] CALL updateVariables() [L132] var_1_2 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_3=401/4, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_3=401/4, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L133] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_3=401/4, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L134] var_1_3 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L135] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L136] var_1_4 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L137] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L138] var_1_5 = __VERIFIER_nondet_ushort() [L139] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L139] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L140] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L140] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L141] var_1_6 = __VERIFIER_nondet_ushort() [L142] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_7=25, var_1_8=0, var_1_9=-16] [L142] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_7=25, var_1_8=0, var_1_9=-16] [L143] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L143] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L144] var_1_8 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_9=-16] [L145] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_9=-16] [L146] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L146] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L147] var_1_11 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L148] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=25, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L149] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L149] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L150] var_1_13 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L151] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L152] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L152] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L153] var_1_14 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L154] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L155] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L155] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L156] var_1_16 = __VERIFIER_nondet_short() [L157] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L157] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L158] CALL assume_abort_if_not(var_1_16 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L158] RET assume_abort_if_not(var_1_16 <= 16383) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L159] var_1_17 = __VERIFIER_nondet_short() [L160] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L160] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L161] CALL assume_abort_if_not(var_1_17 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L161] RET assume_abort_if_not(var_1_17 <= 16383) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L162] var_1_19 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L163] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L164] var_1_20 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L165] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L166] var_1_21 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L167] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L168] var_1_22 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L169] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L170] var_1_23 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L171] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L172] var_1_27 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L173] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L174] CALL assume_abort_if_not(var_1_27 <= 17) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L174] RET assume_abort_if_not(var_1_27 <= 17) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L175] var_1_32 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L176] RET assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L177] var_1_33 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_33 >= 0.0F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L178] RET assume_abort_if_not((var_1_33 >= 0.0F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L179] var_1_37 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L180] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L181] CALL assume_abort_if_not(var_1_37 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L181] RET assume_abort_if_not(var_1_37 <= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L182] var_1_40 = __VERIFIER_nondet_float() [L183] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L183] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L184] var_1_41 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L185] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L186] var_1_42 = __VERIFIER_nondet_float() [L187] CALL assume_abort_if_not((var_1_42 >= 0.0F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L187] RET assume_abort_if_not((var_1_42 >= 0.0F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L188] var_1_43 = __VERIFIER_nondet_float() [L189] CALL assume_abort_if_not((var_1_43 >= 4611686.018427382800e+12F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 9223372.036854765600e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L189] RET assume_abort_if_not((var_1_43 >= 4611686.018427382800e+12F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 9223372.036854765600e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L190] var_1_44 = __VERIFIER_nondet_float() [L191] CALL assume_abort_if_not((var_1_44 >= 0.0F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L191] RET assume_abort_if_not((var_1_44 >= 0.0F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L204] RET updateVariables() [L205] CALL step() [L65] EXPR var_1_1 >> var_1_27 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L65] EXPR var_1_12 ^ var_1_9 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L65] COND TRUE (var_1_1 >> var_1_27) > ((var_1_12 ^ var_1_9) + ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) [L66] var_1_25 = ((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) > (0)) ? (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) : (0))) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L72] EXPR var_1_24 | var_1_27 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L72] EXPR ((var_1_24 | var_1_27) < 0 ) ? -(var_1_24 | var_1_27) : (var_1_24 | var_1_27) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L72] EXPR var_1_24 | var_1_27 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L72] EXPR ((var_1_24 | var_1_27) < 0 ) ? -(var_1_24 | var_1_27) : (var_1_24 | var_1_27) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L72] COND FALSE !(var_1_10 >= ((((var_1_24 | var_1_27) < 0 ) ? -(var_1_24 | var_1_27) : (var_1_24 | var_1_27)))) [L75] COND TRUE var_1_10 >= var_1_27 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L76] COND TRUE var_1_32 > var_1_33 [L77] var_1_34 = ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L81] EXPR -10 & var_1_15 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L81] COND TRUE (-10 & var_1_15) <= var_1_1 [L82] COND FALSE !(var_1_33 != var_1_32) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L86] var_1_38 = var_1_37 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L87] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L87] COND TRUE var_1_27 == (var_1_12 ^ var_1_12) [L88] var_1_39 = (((((var_1_40) < (((((var_1_41) < (var_1_42)) ? (var_1_41) : (var_1_42))))) ? (var_1_40) : (((((var_1_41) < (var_1_42)) ? (var_1_41) : (var_1_42)))))) - (var_1_43 - var_1_44)) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L92] var_1_45 = var_1_27 [L93] var_1_46 = var_1_27 [L94] var_1_9 = ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))) [L95] signed long int stepLocal_1 = 56016 - var_1_11; [L96] signed long int stepLocal_0 = 10; VAL [isInitial=1, stepLocal_0=10, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L97] COND FALSE !(var_1_6 < stepLocal_0) VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L102] COND FALSE !((var_1_13 - var_1_14) > (var_1_10 + var_1_11)) [L107] var_1_12 = var_1_14 VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L109] var_1_15 = (var_1_14 - (((((var_1_16 + var_1_17)) > (4)) ? ((var_1_16 + var_1_17)) : (4)))) VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=-32766, var_1_16=16383, var_1_17=16383, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L110] COND TRUE var_1_4 > var_1_2 [L111] var_1_18 = (((((var_1_19 + var_1_20) < 0 ) ? -(var_1_19 + var_1_20) : (var_1_19 + var_1_20))) - var_1_21) VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=-32766, var_1_16=16383, var_1_17=16383, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L119] var_1_24 = 16 VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=-32766, var_1_16=16383, var_1_17=16383, var_1_1=32, var_1_24=16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L120] COND TRUE var_1_18 <= (var_1_3 - var_1_4) [L121] var_1_1 = var_1_5 VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=-32766, var_1_16=16383, var_1_17=16383, var_1_1=-2, var_1_24=16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L125] COND FALSE !(\read(var_1_8)) VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=-32766, var_1_16=16383, var_1_17=16383, var_1_1=-2, var_1_24=16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L205] RET step() [L206] CALL, EXPR property() [L196-L197] return ((((((((var_1_18 <= (var_1_3 - var_1_4)) ? (var_1_1 == ((unsigned short int) var_1_5)) : (var_1_1 == ((unsigned short int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) && (var_1_8 ? ((var_1_5 < 16) ? (var_1_7 == ((unsigned long int) (var_1_6 + var_1_24))) : 1) : 1)) && (var_1_9 == ((signed long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) && ((var_1_6 < 10) ? ((var_1_5 < (56016 - var_1_11)) ? (var_1_10 == ((unsigned short int) var_1_5)) : 1) : 1)) && (((var_1_13 - var_1_14) > (var_1_10 + var_1_11)) ? ((! var_1_8) ? (var_1_12 == ((signed short int) var_1_13)) : 1) : (var_1_12 == ((signed short int) var_1_14)))) && (var_1_15 == ((signed short int) (var_1_14 - (((((var_1_16 + var_1_17)) > (4)) ? ((var_1_16 + var_1_17)) : (4))))))) && ((var_1_4 > var_1_2) ? (var_1_18 == ((float) (((((var_1_19 + var_1_20) < 0 ) ? -(var_1_19 + var_1_20) : (var_1_19 + var_1_20))) - var_1_21))) : ((! ((var_1_17 - var_1_11) < 128)) ? (var_1_18 == ((float) ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) : (var_1_18 == ((float) ((((((((9.75f) > (var_1_19)) ? (9.75f) : (var_1_19)))) < ((((((var_1_21 - var_1_22)) > (((((var_1_20) > (var_1_23)) ? (var_1_20) : (var_1_23))))) ? ((var_1_21 - var_1_22)) : (((((var_1_20) > (var_1_23)) ? (var_1_20) : (var_1_23)))))))) ? (((((9.75f) > (var_1_19)) ? (9.75f) : (var_1_19)))) : ((((((var_1_21 - var_1_22)) > (((((var_1_20) > (var_1_23)) ? (var_1_20) : (var_1_23))))) ? ((var_1_21 - var_1_22)) : (((((var_1_20) > (var_1_23)) ? (var_1_20) : (var_1_23)))))))))))))) && (var_1_24 == ((signed short int) 16)) ; VAL [\result=0, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=-32766, var_1_16=16383, var_1_17=16383, var_1_1=-2, var_1_24=16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L206] RET, EXPR property() [L206] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=-32766, var_1_16=16383, var_1_17=16383, var_1_1=-2, var_1_24=16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L19] reach_error() VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=-32766, var_1_16=16383, var_1_17=16383, var_1_1=-2, var_1_24=16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.4s, OverallIterations: 12, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1807 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1726 mSDsluCounter, 5740 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3816 mSDsCounter, 417 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2606 IncrementalHoareTripleChecker+Invalid, 3023 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 417 mSolverCounterUnsat, 1924 mSDtfsCounter, 2606 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1358 GetRequests, 1295 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=563occurred in iteration=10, InterpolantAutomatonStates: 68, 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, 11 MinimizatonAttempts, 606 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 3077 NumberOfCodeBlocks, 3077 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3062 ConstructedInterpolants, 0 QuantifiedInterpolants, 11561 SizeOfPredicates, 2 NumberOfNonLiveVariables, 532 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 30859/30940 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-20 05:33:51,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-7.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 93ab9944ae60dcd2ea1c66f43a88f1592af9bef96260d06a583314616c867c3e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:33:53,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:33:53,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 05:33:53,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:33:53,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:33:53,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:33:53,703 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:33:53,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:33:53,704 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:33:53,704 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:33:53,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:33:53,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:33:53,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:33:53,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:33:53,707 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:33:53,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:33:53,708 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:33:53,708 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:33:53,708 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:33:53,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:33:53,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:33:53,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:33:53,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:33:53,713 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 05:33:53,713 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 05:33:53,713 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:33:53,714 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 05:33:53,714 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:33:53,714 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:33:53,714 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:33:53,714 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:33:53,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:33:53,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:33:53,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:33:53,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:33:53,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:33:53,716 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:33:53,716 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:33:53,718 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 05:33:53,718 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 05:33:53,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:33:53,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:33:53,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:33:53,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:33:53,719 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 -> 93ab9944ae60dcd2ea1c66f43a88f1592af9bef96260d06a583314616c867c3e [2024-11-20 05:33:54,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:33:54,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:33:54,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:33:54,094 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:33:54,094 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:33:54,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i [2024-11-20 05:33:55,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:33:55,989 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:33:55,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i [2024-11-20 05:33:56,011 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b7c965aa/a2d53acf46864ed69a1bb508482c3068/FLAG1e3885353 [2024-11-20 05:33:56,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b7c965aa/a2d53acf46864ed69a1bb508482c3068 [2024-11-20 05:33:56,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:33:56,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:33:56,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:33:56,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:33:56,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:33:56,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:33:56" (1/1) ... [2024-11-20 05:33:56,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b302811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:56, skipping insertion in model container [2024-11-20 05:33:56,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:33:56" (1/1) ... [2024-11-20 05:33:56,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:33:56,276 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i[918,931] [2024-11-20 05:33:56,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:33:56,386 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:33:56,400 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i[918,931] [2024-11-20 05:33:56,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:33:56,476 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:33:56,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:56 WrapperNode [2024-11-20 05:33:56,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:33:56,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:33:56,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:33:56,478 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:33:56,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:56" (1/1) ... [2024-11-20 05:33:56,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:56" (1/1) ... [2024-11-20 05:33:56,565 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 225 [2024-11-20 05:33:56,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:33:56,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:33:56,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:33:56,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:33:56,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:56" (1/1) ... [2024-11-20 05:33:56,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:56" (1/1) ... [2024-11-20 05:33:56,587 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:56" (1/1) ... [2024-11-20 05:33:56,611 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 05:33:56,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:56" (1/1) ... [2024-11-20 05:33:56,612 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:56" (1/1) ... [2024-11-20 05:33:56,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:56" (1/1) ... [2024-11-20 05:33:56,636 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:56" (1/1) ... [2024-11-20 05:33:56,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:56" (1/1) ... [2024-11-20 05:33:56,644 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:56" (1/1) ... [2024-11-20 05:33:56,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:33:56,650 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:33:56,651 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:33:56,652 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:33:56,654 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:56" (1/1) ... [2024-11-20 05:33:56,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:33:56,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:33:56,690 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-20 05:33:56,697 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-20 05:33:56,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:33:56,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 05:33:56,734 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:33:56,734 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:33:56,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:33:56,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:33:56,837 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:33:56,842 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:34:00,702 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-20 05:34:00,702 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:34:00,719 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:34:00,719 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:34:00,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:34:00 BoogieIcfgContainer [2024-11-20 05:34:00,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:34:00,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:34:00,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:34:00,725 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:34:00,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:33:56" (1/3) ... [2024-11-20 05:34:00,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b455a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:34:00, skipping insertion in model container [2024-11-20 05:34:00,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:33:56" (2/3) ... [2024-11-20 05:34:00,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b455a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:34:00, skipping insertion in model container [2024-11-20 05:34:00,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:34:00" (3/3) ... [2024-11-20 05:34:00,728 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i [2024-11-20 05:34:00,746 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:34:00,747 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:34:00,814 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:34:00,823 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;@31255909, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:34:00,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:34:00,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 63 states have internal predecessors, (84), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-20 05:34:00,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-20 05:34:00,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:34:00,852 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:34:00,852 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:34:00,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:34:00,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1685972073, now seen corresponding path program 1 times [2024-11-20 05:34:00,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:34:00,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800210682] [2024-11-20 05:34:00,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:34:00,879 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-20 05:34:00,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:34:00,883 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-20 05:34:00,898 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-20 05:34:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:34:01,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 05:34:01,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:34:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 548 proven. 0 refuted. 0 times theorem prover too weak. 1832 trivial. 0 not checked. [2024-11-20 05:34:01,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:34:01,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:34:01,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800210682] [2024-11-20 05:34:01,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800210682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:34:01,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:34:01,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:34:01,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635809920] [2024-11-20 05:34:01,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:34:01,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:34:01,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:34:01,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:34:01,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:34:01,713 INFO L87 Difference]: Start difference. First operand has 100 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 63 states have internal predecessors, (84), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) 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, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-20 05:34:01,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:34:01,760 INFO L93 Difference]: Finished difference Result 193 states and 337 transitions. [2024-11-20 05:34:01,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:34:01,764 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, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 222 [2024-11-20 05:34:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:34:01,774 INFO L225 Difference]: With dead ends: 193 [2024-11-20 05:34:01,774 INFO L226 Difference]: Without dead ends: 96 [2024-11-20 05:34:01,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 221 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-20 05:34:01,787 INFO L432 NwaCegarLoop]: 147 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, 147 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-20 05:34:01,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:34:01,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-20 05:34:01,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-20 05:34:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.305084745762712) internal successors, (77), 59 states have internal predecessors, (77), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-20 05:34:01,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 147 transitions. [2024-11-20 05:34:01,853 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 147 transitions. Word has length 222 [2024-11-20 05:34:01,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:34:01,854 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 147 transitions. [2024-11-20 05:34:01,854 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, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-20 05:34:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 147 transitions. [2024-11-20 05:34:01,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-20 05:34:01,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:34:01,862 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:34:01,881 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 (2)] Forceful destruction successful, exit code 0 [2024-11-20 05:34:02,065 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-20 05:34:02,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:34:02,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:34:02,067 INFO L85 PathProgramCache]: Analyzing trace with hash -597976961, now seen corresponding path program 1 times [2024-11-20 05:34:02,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:34:02,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861748495] [2024-11-20 05:34:02,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:34:02,068 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-20 05:34:02,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:34:02,071 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-20 05:34:02,073 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-20 05:34:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:34:02,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 05:34:02,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:34:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-20 05:34:03,767 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:34:03,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:34:03,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861748495] [2024-11-20 05:34:03,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861748495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:34:03,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:34:03,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:34:03,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385709766] [2024-11-20 05:34:03,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:34:03,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:34:03,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:34:03,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:34:03,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:34:03,777 INFO L87 Difference]: Start difference. First operand 96 states and 147 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:34:05,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:34:05,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:34:05,638 INFO L93 Difference]: Finished difference Result 273 states and 423 transitions. [2024-11-20 05:34:05,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:34:05,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 222 [2024-11-20 05:34:05,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:34:05,644 INFO L225 Difference]: With dead ends: 273 [2024-11-20 05:34:05,644 INFO L226 Difference]: Without dead ends: 180 [2024-11-20 05:34:05,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 220 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-20 05:34:05,646 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 29 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-20 05:34:05,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 285 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-20 05:34:05,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-20 05:34:05,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 165. [2024-11-20 05:34:05,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 92 states have (on average 1.2173913043478262) internal successors, (112), 92 states have internal predecessors, (112), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-20 05:34:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 252 transitions. [2024-11-20 05:34:05,697 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 252 transitions. Word has length 222 [2024-11-20 05:34:05,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:34:05,699 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 252 transitions. [2024-11-20 05:34:05,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:34:05,699 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 252 transitions. [2024-11-20 05:34:05,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-20 05:34:05,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:34:05,707 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:34:05,733 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 (3)] Ended with exit code 0 [2024-11-20 05:34:05,914 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-20 05:34:05,915 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:34:05,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:34:05,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1474270552, now seen corresponding path program 1 times [2024-11-20 05:34:05,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:34:05,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333433854] [2024-11-20 05:34:05,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:34:05,917 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-20 05:34:05,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:34:05,919 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-20 05:34:05,920 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-20 05:34:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:34:06,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 05:34:06,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:34:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-20 05:34:07,218 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:34:07,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:34:07,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333433854] [2024-11-20 05:34:07,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [333433854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:34:07,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:34:07,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:34:07,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477238431] [2024-11-20 05:34:07,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:34:07,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:34:07,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:34:07,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:34:07,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:34:07,224 INFO L87 Difference]: Start difference. First operand 165 states and 252 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:34:08,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:34:08,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:34:08,521 INFO L93 Difference]: Finished difference Result 270 states and 417 transitions. [2024-11-20 05:34:08,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:34:08,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 223 [2024-11-20 05:34:08,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:34:08,525 INFO L225 Difference]: With dead ends: 270 [2024-11-20 05:34:08,525 INFO L226 Difference]: Without dead ends: 177 [2024-11-20 05:34:08,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 221 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-20 05:34:08,527 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 21 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 05:34:08,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 286 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 05:34:08,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-20 05:34:08,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 168. [2024-11-20 05:34:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 95 states have (on average 1.231578947368421) internal successors, (117), 95 states have internal predecessors, (117), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-20 05:34:08,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 257 transitions. [2024-11-20 05:34:08,573 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 257 transitions. Word has length 223 [2024-11-20 05:34:08,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:34:08,574 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 257 transitions. [2024-11-20 05:34:08,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:34:08,575 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 257 transitions. [2024-11-20 05:34:08,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-20 05:34:08,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:34:08,577 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:34:08,596 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-20 05:34:08,778 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-20 05:34:08,779 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:34:08,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:34:08,780 INFO L85 PathProgramCache]: Analyzing trace with hash 607957078, now seen corresponding path program 1 times [2024-11-20 05:34:08,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:34:08,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950154140] [2024-11-20 05:34:08,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:34:08,781 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-20 05:34:08,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:34:08,784 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-20 05:34:08,786 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-20 05:34:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:34:09,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 05:34:09,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:34:12,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-20 05:34:12,988 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:34:12,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:34:12,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950154140] [2024-11-20 05:34:12,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950154140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:34:12,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:34:12,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:34:12,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454190440] [2024-11-20 05:34:12,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:34:12,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:34:12,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:34:12,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:34:12,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:34:12,991 INFO L87 Difference]: Start difference. First operand 168 states and 257 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:34:15,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:34:15,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:34:15,680 INFO L93 Difference]: Finished difference Result 269 states and 413 transitions. [2024-11-20 05:34:15,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:34:15,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 224 [2024-11-20 05:34:15,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:34:15,690 INFO L225 Difference]: With dead ends: 269 [2024-11-20 05:34:15,690 INFO L226 Difference]: Without dead ends: 172 [2024-11-20 05:34:15,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 222 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-20 05:34:15,692 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 14 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-20 05:34:15,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 264 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-20 05:34:15,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-20 05:34:15,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2024-11-20 05:34:15,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 95 states have internal predecessors, (116), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-20 05:34:15,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2024-11-20 05:34:15,725 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 224 [2024-11-20 05:34:15,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:34:15,726 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2024-11-20 05:34:15,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:34:15,727 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2024-11-20 05:34:15,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-20 05:34:15,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:34:15,730 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:34:15,753 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 (5)] Forceful destruction successful, exit code 0 [2024-11-20 05:34:15,931 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-20 05:34:15,931 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:34:15,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:34:15,932 INFO L85 PathProgramCache]: Analyzing trace with hash 893189650, now seen corresponding path program 1 times [2024-11-20 05:34:15,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:34:15,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433955444] [2024-11-20 05:34:15,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:34:15,933 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-20 05:34:15,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:34:15,934 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-20 05:34:15,935 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-20 05:34:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:34:16,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 05:34:16,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:34:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 984 proven. 27 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2024-11-20 05:34:17,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:34:18,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 75 proven. 27 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-11-20 05:34:18,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:34:18,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433955444] [2024-11-20 05:34:18,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433955444] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 05:34:18,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 05:34:18,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2024-11-20 05:34:18,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398528916] [2024-11-20 05:34:18,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 05:34:18,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 05:34:18,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:34:18,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 05:34:18,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-20 05:34:18,041 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 4 states have call successors, (70), 3 states have call predecessors, (70), 5 states have return successors, (70), 4 states have call predecessors, (70), 4 states have call successors, (70) [2024-11-20 05:34:21,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:34:25,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:34:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:34:26,267 INFO L93 Difference]: Finished difference Result 498 states and 752 transitions. [2024-11-20 05:34:26,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 05:34:26,269 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 4 states have call successors, (70), 3 states have call predecessors, (70), 5 states have return successors, (70), 4 states have call predecessors, (70), 4 states have call successors, (70) Word has length 225 [2024-11-20 05:34:26,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:34:26,275 INFO L225 Difference]: With dead ends: 498 [2024-11-20 05:34:26,275 INFO L226 Difference]: Without dead ends: 404 [2024-11-20 05:34:26,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2024-11-20 05:34:26,277 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 316 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:34:26,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 508 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2024-11-20 05:34:26,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-20 05:34:26,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 332. [2024-11-20 05:34:26,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 196 states have (on average 1.2551020408163265) internal successors, (246), 197 states have internal predecessors, (246), 129 states have call successors, (129), 6 states have call predecessors, (129), 6 states have return successors, (129), 128 states have call predecessors, (129), 129 states have call successors, (129) [2024-11-20 05:34:26,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 504 transitions. [2024-11-20 05:34:26,336 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 504 transitions. Word has length 225 [2024-11-20 05:34:26,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:34:26,337 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 504 transitions. [2024-11-20 05:34:26,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 4 states have call successors, (70), 3 states have call predecessors, (70), 5 states have return successors, (70), 4 states have call predecessors, (70), 4 states have call successors, (70) [2024-11-20 05:34:26,337 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 504 transitions. [2024-11-20 05:34:26,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-20 05:34:26,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:34:26,340 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:34:26,363 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-20 05:34:26,541 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-20 05:34:26,541 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:34:26,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:34:26,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1665525384, now seen corresponding path program 1 times [2024-11-20 05:34:26,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:34:26,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837861471] [2024-11-20 05:34:26,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:34:26,543 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-20 05:34:26,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:34:26,544 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-20 05:34:26,545 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-20 05:34:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:34:26,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 05:34:26,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:34:27,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-20 05:34:27,046 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:34:27,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:34:27,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837861471] [2024-11-20 05:34:27,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837861471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:34:27,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:34:27,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:34:27,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334029018] [2024-11-20 05:34:27,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:34:27,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:34:27,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:34:27,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:34:27,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:34:27,049 INFO L87 Difference]: Start difference. First operand 332 states and 504 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:34:28,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:34:28,244 INFO L93 Difference]: Finished difference Result 792 states and 1205 transitions. [2024-11-20 05:34:28,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:34:28,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 226 [2024-11-20 05:34:28,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:34:28,256 INFO L225 Difference]: With dead ends: 792 [2024-11-20 05:34:28,256 INFO L226 Difference]: Without dead ends: 539 [2024-11-20 05:34:28,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 224 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-20 05:34:28,258 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 107 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:34:28,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 281 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 05:34:28,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-20 05:34:28,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 528. [2024-11-20 05:34:28,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 314 states have (on average 1.2611464968152866) internal successors, (396), 318 states have internal predecessors, (396), 203 states have call successors, (203), 10 states have call predecessors, (203), 10 states have return successors, (203), 199 states have call predecessors, (203), 203 states have call successors, (203) [2024-11-20 05:34:28,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 802 transitions. [2024-11-20 05:34:28,319 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 802 transitions. Word has length 226 [2024-11-20 05:34:28,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:34:28,319 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 802 transitions. [2024-11-20 05:34:28,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-20 05:34:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 802 transitions. [2024-11-20 05:34:28,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-20 05:34:28,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:34:28,323 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:34:28,349 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-20 05:34:28,527 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-20 05:34:28,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:34:28,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:34:28,528 INFO L85 PathProgramCache]: Analyzing trace with hash -385661706, now seen corresponding path program 1 times [2024-11-20 05:34:28,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:34:28,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428380517] [2024-11-20 05:34:28,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:34:28,529 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-20 05:34:28,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:34:28,530 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-20 05:34:28,532 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-20 05:34:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:34:29,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-20 05:34:29,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:34:55,266 WARN L286 SmtUtils]: Spent 12.63s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)