./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-pe-ci_file-96.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-pe-ci_file-96.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 b55edfcf8f1bec3a32276e499d06b3c7a9d9d8a099643ca6d0ff5cddc940e456 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:09:11,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:09:11,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 04:09:11,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:09:11,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:09:11,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:09:11,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:09:11,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:09:11,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:09:11,973 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:09:11,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:09:11,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:09:11,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:09:11,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:09:11,975 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:09:11,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:09:11,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:09:11,976 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:09:11,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 04:09:11,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:09:11,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:09:11,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:09:11,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:09:11,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:09:11,979 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:09:11,979 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:09:11,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:09:11,980 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:09:11,980 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:09:11,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:09:11,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:09:11,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:09:11,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:09:11,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:09:11,982 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:09:11,983 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:09:11,983 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 04:09:11,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 04:09:11,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:09:11,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:09:11,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:09:11,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:09:11,985 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 -> b55edfcf8f1bec3a32276e499d06b3c7a9d9d8a099643ca6d0ff5cddc940e456 [2024-11-20 04:09:12,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:09:12,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:09:12,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:09:12,287 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:09:12,288 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:09:12,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-96.i [2024-11-20 04:09:13,760 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:09:13,999 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:09:14,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-96.i [2024-11-20 04:09:14,011 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9100581c0/e47a58c19c0143e795fcc535cbbf868d/FLAG4d1da7d5c [2024-11-20 04:09:14,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9100581c0/e47a58c19c0143e795fcc535cbbf868d [2024-11-20 04:09:14,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:09:14,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:09:14,353 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:09:14,353 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:09:14,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:09:14,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:09:14" (1/1) ... [2024-11-20 04:09:14,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16d3183f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:14, skipping insertion in model container [2024-11-20 04:09:14,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:09:14" (1/1) ... [2024-11-20 04:09:14,391 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:09:14,562 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-96.i[919,932] [2024-11-20 04:09:14,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:09:14,659 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:09:14,669 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-96.i[919,932] [2024-11-20 04:09:14,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:09:14,718 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:09:14,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:14 WrapperNode [2024-11-20 04:09:14,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:09:14,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:09:14,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:09:14,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:09:14,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:14" (1/1) ... [2024-11-20 04:09:14,743 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:14" (1/1) ... [2024-11-20 04:09:14,787 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2024-11-20 04:09:14,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:09:14,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:09:14,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:09:14,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:09:14,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:14" (1/1) ... [2024-11-20 04:09:14,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:14" (1/1) ... [2024-11-20 04:09:14,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:14" (1/1) ... [2024-11-20 04:09:14,828 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 04:09:14,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:14" (1/1) ... [2024-11-20 04:09:14,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:14" (1/1) ... [2024-11-20 04:09:14,839 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:14" (1/1) ... [2024-11-20 04:09:14,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:14" (1/1) ... [2024-11-20 04:09:14,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:14" (1/1) ... [2024-11-20 04:09:14,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:14" (1/1) ... [2024-11-20 04:09:14,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:09:14,856 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:09:14,856 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:09:14,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:09:14,857 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:14" (1/1) ... [2024-11-20 04:09:14,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:09:14,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:09:14,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 04:09:14,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 04:09:14,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:09:14,938 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:09:14,938 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:09:14,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 04:09:14,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:09:14,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:09:15,028 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:09:15,029 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:09:15,406 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-20 04:09:15,406 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:09:15,424 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:09:15,424 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:09:15,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:09:15 BoogieIcfgContainer [2024-11-20 04:09:15,425 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:09:15,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:09:15,429 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:09:15,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:09:15,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:09:14" (1/3) ... [2024-11-20 04:09:15,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e662628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:09:15, skipping insertion in model container [2024-11-20 04:09:15,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:14" (2/3) ... [2024-11-20 04:09:15,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e662628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:09:15, skipping insertion in model container [2024-11-20 04:09:15,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:09:15" (3/3) ... [2024-11-20 04:09:15,437 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-96.i [2024-11-20 04:09:15,453 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:09:15,453 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:09:15,511 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:09:15,520 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;@7ca70d58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:09:15,520 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:09:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-20 04:09:15,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-20 04:09:15,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:09:15,543 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:15,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:09:15,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:09:15,549 INFO L85 PathProgramCache]: Analyzing trace with hash -913269460, now seen corresponding path program 1 times [2024-11-20 04:09:15,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:09:15,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727890082] [2024-11-20 04:09:15,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:09:15,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:09:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:15,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:09:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:15,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:09:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:15,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:09:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:15,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:09:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:15,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:09:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:15,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:09:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:15,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:09:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:15,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:09:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:15,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:09:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:15,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:09:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:15,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:09:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:15,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:09:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:15,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:09:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:15,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:09:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:15,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:09:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 04:09:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:09:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 04:09:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:09:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 04:09:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:09:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 04:09:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:09:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 04:09:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 04:09:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 04:09:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:09:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:09:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:09:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:09:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 04:09:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-20 04:09:16,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:09:16,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727890082] [2024-11-20 04:09:16,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727890082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:09:16,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:09:16,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:09:16,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067796918] [2024-11-20 04:09:16,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:09:16,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:09:16,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:09:16,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:09:16,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:09:16,143 INFO L87 Difference]: Start difference. First operand has 96 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-20 04:09:16,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:09:16,187 INFO L93 Difference]: Finished difference Result 182 states and 321 transitions. [2024-11-20 04:09:16,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:09:16,190 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 197 [2024-11-20 04:09:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:09:16,198 INFO L225 Difference]: With dead ends: 182 [2024-11-20 04:09:16,198 INFO L226 Difference]: Without dead ends: 89 [2024-11-20 04:09:16,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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 04:09:16,208 INFO L432 NwaCegarLoop]: 137 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, 137 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 04:09:16,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:09:16,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-20 04:09:16,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-20 04:09:16,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-20 04:09:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 137 transitions. [2024-11-20 04:09:16,276 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 137 transitions. Word has length 197 [2024-11-20 04:09:16,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:09:16,278 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 137 transitions. [2024-11-20 04:09:16,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-20 04:09:16,279 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 137 transitions. [2024-11-20 04:09:16,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-20 04:09:16,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:09:16,285 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:16,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 04:09:16,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:09:16,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:09:16,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2131956582, now seen corresponding path program 1 times [2024-11-20 04:09:16,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:09:16,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876942572] [2024-11-20 04:09:16,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:09:16,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:09:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:09:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:09:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:09:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:09:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:09:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:09:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:09:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:09:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:09:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:09:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:16,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:09:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:09:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:09:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:09:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:09:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 04:09:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:09:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 04:09:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:09:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 04:09:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:09:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 04:09:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:09:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 04:09:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 04:09:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 04:09:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:09:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:09:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:09:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:09:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 04:09:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-20 04:09:17,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:09:17,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876942572] [2024-11-20 04:09:17,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876942572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:09:17,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:09:17,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:09:17,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855769904] [2024-11-20 04:09:17,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:09:17,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:09:17,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:09:17,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:09:17,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:09:17,170 INFO L87 Difference]: Start difference. First operand 89 states and 137 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-20 04:09:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:09:17,436 INFO L93 Difference]: Finished difference Result 262 states and 406 transitions. [2024-11-20 04:09:17,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:09:17,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2024-11-20 04:09:17,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:09:17,444 INFO L225 Difference]: With dead ends: 262 [2024-11-20 04:09:17,444 INFO L226 Difference]: Without dead ends: 176 [2024-11-20 04:09:17,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 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 04:09:17,446 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 84 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 04:09:17,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 391 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 04:09:17,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-20 04:09:17,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 144. [2024-11-20 04:09:17,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 79 states have (on average 1.240506329113924) internal successors, (98), 79 states have internal predecessors, (98), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-20 04:09:17,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 222 transitions. [2024-11-20 04:09:17,492 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 222 transitions. Word has length 197 [2024-11-20 04:09:17,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:09:17,493 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 222 transitions. [2024-11-20 04:09:17,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-20 04:09:17,493 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 222 transitions. [2024-11-20 04:09:17,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-20 04:09:17,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:09:17,499 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:17,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 04:09:17,500 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:09:17,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:09:17,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1314308132, now seen corresponding path program 1 times [2024-11-20 04:09:17,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:09:17,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192257540] [2024-11-20 04:09:17,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:09:17,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:09:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:09:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:09:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:09:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:09:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:09:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:09:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:09:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:09:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:09:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:09:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:09:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:09:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:09:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:09:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:09:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 04:09:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:09:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 04:09:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:09:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 04:09:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:09:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 04:09:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:09:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 04:09:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 04:09:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 04:09:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:09:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:09:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:09:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:09:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 04:09:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:17,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 48 proven. 42 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-20 04:09:17,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:09:17,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192257540] [2024-11-20 04:09:17,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192257540] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:09:17,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060697029] [2024-11-20 04:09:17,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:09:17,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:09:17,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:09:17,901 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 04:09:17,903 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 04:09:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:18,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 04:09:18,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:09:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 958 proven. 42 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2024-11-20 04:09:18,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:09:18,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 48 proven. 42 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-20 04:09:18,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060697029] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:09:18,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 04:09:18,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-20 04:09:18,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764793210] [2024-11-20 04:09:18,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 04:09:18,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 04:09:18,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:09:18,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 04:09:18,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 04:09:18,583 INFO L87 Difference]: Start difference. First operand 144 states and 222 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-20 04:09:18,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:09:18,880 INFO L93 Difference]: Finished difference Result 242 states and 366 transitions. [2024-11-20 04:09:18,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 04:09:18,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 197 [2024-11-20 04:09:18,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:09:18,883 INFO L225 Difference]: With dead ends: 242 [2024-11-20 04:09:18,884 INFO L226 Difference]: Without dead ends: 156 [2024-11-20 04:09:18,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 451 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-20 04:09:18,887 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 109 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 04:09:18,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 211 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 04:09:18,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-20 04:09:18,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2024-11-20 04:09:18,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 85 states have internal predecessors, (103), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-20 04:09:18,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 227 transitions. [2024-11-20 04:09:18,933 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 227 transitions. Word has length 197 [2024-11-20 04:09:18,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:09:18,934 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 227 transitions. [2024-11-20 04:09:18,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-20 04:09:18,935 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 227 transitions. [2024-11-20 04:09:18,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-20 04:09:18,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:09:18,937 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:18,948 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 04:09:19,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:09:19,138 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:09:19,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:09:19,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1371566434, now seen corresponding path program 1 times [2024-11-20 04:09:19,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:09:19,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537536650] [2024-11-20 04:09:19,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:09:19,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:09:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:09:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:09:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:09:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:09:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:09:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:09:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:09:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:09:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:09:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:09:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:09:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:09:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:09:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:09:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:09:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 04:09:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:09:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 04:09:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:09:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 04:09:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:09:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 04:09:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:09:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 04:09:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 04:09:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 04:09:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:09:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:09:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:09:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:09:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 04:09:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-20 04:09:19,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:09:19,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537536650] [2024-11-20 04:09:19,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537536650] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:09:19,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719445979] [2024-11-20 04:09:19,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:09:19,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:09:19,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:09:19,838 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:09:19,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 04:09:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:19,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 04:09:19,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:09:20,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 930 proven. 36 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2024-11-20 04:09:20,502 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:09:20,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 54 proven. 36 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-20 04:09:20,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719445979] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:09:20,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 04:09:20,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 6] total 16 [2024-11-20 04:09:20,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118282876] [2024-11-20 04:09:20,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 04:09:20,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 04:09:20,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:09:20,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 04:09:20,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-20 04:09:20,911 INFO L87 Difference]: Start difference. First operand 152 states and 227 transitions. Second operand has 16 states, 16 states have (on average 7.875) internal successors, (126), 16 states have internal predecessors, (126), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2024-11-20 04:09:24,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:09:24,451 INFO L93 Difference]: Finished difference Result 955 states and 1419 transitions. [2024-11-20 04:09:24,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-20 04:09:24,452 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.875) internal successors, (126), 16 states have internal predecessors, (126), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) Word has length 197 [2024-11-20 04:09:24,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:09:24,462 INFO L225 Difference]: With dead ends: 955 [2024-11-20 04:09:24,463 INFO L226 Difference]: Without dead ends: 865 [2024-11-20 04:09:24,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=553, Invalid=1517, Unknown=0, NotChecked=0, Total=2070 [2024-11-20 04:09:24,466 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 637 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 3329 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1826 SdHoareTripleChecker+Invalid, 3664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 3329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-20 04:09:24,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 1826 Invalid, 3664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 3329 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-20 04:09:24,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-20 04:09:24,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 474. [2024-11-20 04:09:24,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 286 states have (on average 1.2202797202797202) internal successors, (349), 289 states have internal predecessors, (349), 170 states have call successors, (170), 17 states have call predecessors, (170), 17 states have return successors, (170), 167 states have call predecessors, (170), 170 states have call successors, (170) [2024-11-20 04:09:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 689 transitions. [2024-11-20 04:09:24,579 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 689 transitions. Word has length 197 [2024-11-20 04:09:24,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:09:24,581 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 689 transitions. [2024-11-20 04:09:24,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.875) internal successors, (126), 16 states have internal predecessors, (126), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2024-11-20 04:09:24,581 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 689 transitions. [2024-11-20 04:09:24,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-20 04:09:24,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:09:24,583 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:24,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 04:09:24,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-20 04:09:24,784 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:09:24,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:09:24,785 INFO L85 PathProgramCache]: Analyzing trace with hash 978539424, now seen corresponding path program 1 times [2024-11-20 04:09:24,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:09:24,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677807807] [2024-11-20 04:09:24,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:09:24,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:09:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:09:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:09:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:09:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:09:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:09:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:09:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:09:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:09:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:09:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:09:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:09:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:09:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:09:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:09:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:09:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 04:09:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:09:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 04:09:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:09:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 04:09:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:09:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 04:09:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:09:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 04:09:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 04:09:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 04:09:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:09:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:09:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:09:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:09:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 04:09:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-20 04:09:25,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:09:25,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677807807] [2024-11-20 04:09:25,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677807807] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:09:25,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78067735] [2024-11-20 04:09:25,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:09:25,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:09:25,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:09:25,480 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:09:25,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 04:09:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:25,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 04:09:25,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:09:26,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1216 proven. 168 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2024-11-20 04:09:26,636 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:09:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 84 proven. 93 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2024-11-20 04:09:27,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78067735] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:09:27,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 04:09:27,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 12] total 30 [2024-11-20 04:09:27,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789731571] [2024-11-20 04:09:27,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 04:09:27,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-20 04:09:27,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:09:27,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-20 04:09:27,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2024-11-20 04:09:27,194 INFO L87 Difference]: Start difference. First operand 474 states and 689 transitions. Second operand has 30 states, 29 states have (on average 4.448275862068965) internal successors, (129), 27 states have internal predecessors, (129), 11 states have call successors, (82), 5 states have call predecessors, (82), 9 states have return successors, (83), 11 states have call predecessors, (83), 11 states have call successors, (83) [2024-11-20 04:09:30,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:09:30,740 INFO L93 Difference]: Finished difference Result 1366 states and 1857 transitions. [2024-11-20 04:09:30,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-11-20 04:09:30,740 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.448275862068965) internal successors, (129), 27 states have internal predecessors, (129), 11 states have call successors, (82), 5 states have call predecessors, (82), 9 states have return successors, (83), 11 states have call predecessors, (83), 11 states have call successors, (83) Word has length 197 [2024-11-20 04:09:30,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:09:30,749 INFO L225 Difference]: With dead ends: 1366 [2024-11-20 04:09:30,749 INFO L226 Difference]: Without dead ends: 962 [2024-11-20 04:09:30,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2310, Invalid=8402, Unknown=0, NotChecked=0, Total=10712 [2024-11-20 04:09:30,754 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 1039 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 2093 mSolverCounterSat, 680 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 2773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 680 IncrementalHoareTripleChecker+Valid, 2093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 04:09:30,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 1244 Invalid, 2773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [680 Valid, 2093 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 04:09:30,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-11-20 04:09:30,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 737. [2024-11-20 04:09:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 447 states have (on average 1.1319910514541387) internal successors, (506), 452 states have internal predecessors, (506), 237 states have call successors, (237), 52 states have call predecessors, (237), 52 states have return successors, (237), 232 states have call predecessors, (237), 237 states have call successors, (237) [2024-11-20 04:09:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 980 transitions. [2024-11-20 04:09:30,897 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 980 transitions. Word has length 197 [2024-11-20 04:09:30,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:09:30,897 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 980 transitions. [2024-11-20 04:09:30,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.448275862068965) internal successors, (129), 27 states have internal predecessors, (129), 11 states have call successors, (82), 5 states have call predecessors, (82), 9 states have return successors, (83), 11 states have call predecessors, (83), 11 states have call successors, (83) [2024-11-20 04:09:30,898 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 980 transitions. [2024-11-20 04:09:30,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-20 04:09:30,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:09:30,901 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:30,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 04:09:31,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:09:31,102 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:09:31,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:09:31,103 INFO L85 PathProgramCache]: Analyzing trace with hash 391733410, now seen corresponding path program 1 times [2024-11-20 04:09:31,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:09:31,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441630531] [2024-11-20 04:09:31,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:09:31,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:09:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:09:31,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 04:09:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:09:31,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 04:09:31,346 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 04:09:31,347 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 04:09:31,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 04:09:31,355 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-20 04:09:31,496 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 04:09:31,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:09:31 BoogieIcfgContainer [2024-11-20 04:09:31,500 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 04:09:31,501 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 04:09:31,501 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 04:09:31,501 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 04:09:31,501 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:09:15" (3/4) ... [2024-11-20 04:09:31,504 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 04:09:31,505 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 04:09:31,506 INFO L158 Benchmark]: Toolchain (without parser) took 17155.42ms. Allocated memory was 172.0MB in the beginning and 327.2MB in the end (delta: 155.2MB). Free memory was 115.9MB in the beginning and 213.9MB in the end (delta: -98.0MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. [2024-11-20 04:09:31,506 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 172.0MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:09:31,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.48ms. Allocated memory is still 172.0MB. Free memory was 115.9MB in the beginning and 98.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 04:09:31,506 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.82ms. Allocated memory is still 172.0MB. Free memory was 98.7MB in the beginning and 94.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 04:09:31,506 INFO L158 Benchmark]: Boogie Preprocessor took 66.28ms. Allocated memory is still 172.0MB. Free memory was 94.5MB in the beginning and 89.0MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 04:09:31,507 INFO L158 Benchmark]: RCFGBuilder took 568.81ms. Allocated memory is still 172.0MB. Free memory was 89.0MB in the beginning and 118.1MB in the end (delta: -29.1MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2024-11-20 04:09:31,507 INFO L158 Benchmark]: TraceAbstraction took 16071.52ms. Allocated memory was 172.0MB in the beginning and 327.2MB in the end (delta: 155.2MB). Free memory was 116.9MB in the beginning and 213.9MB in the end (delta: -97.0MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. [2024-11-20 04:09:31,507 INFO L158 Benchmark]: Witness Printer took 4.66ms. Allocated memory is still 327.2MB. Free memory is still 213.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:09:31,509 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 172.0MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.48ms. Allocated memory is still 172.0MB. Free memory was 115.9MB in the beginning and 98.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.82ms. Allocated memory is still 172.0MB. Free memory was 98.7MB in the beginning and 94.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.28ms. Allocated memory is still 172.0MB. Free memory was 94.5MB in the beginning and 89.0MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 568.81ms. Allocated memory is still 172.0MB. Free memory was 89.0MB in the beginning and 118.1MB in the end (delta: -29.1MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * TraceAbstraction took 16071.52ms. Allocated memory was 172.0MB in the beginning and 327.2MB in the end (delta: 155.2MB). Free memory was 116.9MB in the beginning and 213.9MB in the end (delta: -97.0MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. * Witness Printer took 4.66ms. Allocated memory is still 327.2MB. Free memory is still 213.9MB. 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 someBinaryDOUBLEComparisonOperation at line 179, overapproximation of someBinaryFLOATComparisonOperation at line 179. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 16; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 1; [L25] signed char var_1_8 = -10; [L26] unsigned short int var_1_9 = 4; [L27] signed char var_1_10 = 8; [L28] unsigned short int var_1_12 = 64314; [L29] unsigned short int var_1_13 = 26169; [L30] signed char var_1_17 = 50; [L31] signed char var_1_18 = 16; [L32] signed char var_1_19 = 5; [L33] signed char var_1_20 = 0; [L34] signed char var_1_21 = 50; [L35] signed char var_1_22 = 16; [L36] unsigned char var_1_23 = 16; [L37] unsigned char var_1_24 = 1; [L38] unsigned char var_1_25 = 0; [L39] double var_1_27 = 0.25; [L40] double var_1_28 = 10.25; [L41] double var_1_29 = 1000.25; [L42] double var_1_30 = 9.5; [L43] float var_1_31 = 63.5; [L44] unsigned short int var_1_32 = 16; [L45] unsigned char var_1_40 = 1; [L46] unsigned char var_1_43 = 0; [L47] signed long int var_1_44 = -4; [L48] unsigned long int var_1_46 = 4; [L49] unsigned long int var_1_49 = 3576445681; [L50] double var_1_50 = 32.5; [L51] signed long int var_1_52 = -1; [L52] unsigned short int var_1_53 = 64; [L53] unsigned short int last_1_var_1_9 = 4; VAL [isInitial=0, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L183] isInitial = 1 [L184] FCALL initially() [L185] COND TRUE 1 [L186] CALL updateLastVariables() [L176] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=0, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L186] RET updateLastVariables() [L187] CALL updateVariables() [L126] var_1_4 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L127] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L128] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L128] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L129] var_1_6 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_8=-10, var_1_9=4] [L130] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_8=-10, var_1_9=4] [L131] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=-10, var_1_9=4] [L131] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=-10, var_1_9=4] [L132] var_1_8 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L133] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L134] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L134] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L135] var_1_10 = __VERIFIER_nondet_char() [L136] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L136] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L137] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L137] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L138] var_1_12 = __VERIFIER_nondet_ushort() [L139] CALL assume_abort_if_not(var_1_12 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L139] RET assume_abort_if_not(var_1_12 >= 49150) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L140] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L140] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L141] var_1_13 = __VERIFIER_nondet_ushort() [L142] CALL assume_abort_if_not(var_1_13 >= 24575) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L142] RET assume_abort_if_not(var_1_13 >= 24575) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L143] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L143] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L144] var_1_18 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_18 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L145] RET assume_abort_if_not(var_1_18 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L146] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L146] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L147] var_1_19 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_19 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L148] RET assume_abort_if_not(var_1_19 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L149] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L149] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L150] var_1_20 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L151] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L152] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L152] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L153] var_1_21 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_21 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L154] RET assume_abort_if_not(var_1_21 >= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L155] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L155] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L156] var_1_22 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L157] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L158] CALL assume_abort_if_not(var_1_22 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L158] RET assume_abort_if_not(var_1_22 <= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L159] var_1_25 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L160] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L161] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L161] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L162] var_1_28 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L163] RET assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L164] var_1_29 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L165] RET assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L166] var_1_30 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L167] RET assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L168] var_1_43 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_43 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L169] RET assume_abort_if_not(var_1_43 >= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L170] CALL assume_abort_if_not(var_1_43 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L170] RET assume_abort_if_not(var_1_43 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L171] var_1_49 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_49 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L172] RET assume_abort_if_not(var_1_49 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L173] CALL assume_abort_if_not(var_1_49 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L173] RET assume_abort_if_not(var_1_49 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L187] RET updateVariables() [L188] CALL step() [L57] COND FALSE !((- last_1_var_1_9) < (last_1_var_1_9 + -500)) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=50, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L60] var_1_17 = (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=95, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L61] COND TRUE \read(var_1_4) [L62] var_1_24 = (! var_1_25) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=95, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L66] var_1_31 = var_1_30 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=95, var_1_18=126, var_1_19=126, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L67] COND FALSE !(var_1_23 < var_1_23) [L78] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=95, var_1_18=126, var_1_19=126, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L80] signed char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_9=4, stepLocal_0=126, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=95, var_1_18=126, var_1_19=126, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=4] [L81] COND FALSE !(stepLocal_0 < (-1 - var_1_10)) [L88] var_1_9 = var_1_13 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=95, var_1_18=126, var_1_19=126, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=-40961] [L90] COND FALSE !(var_1_9 < (var_1_21 + var_1_23)) [L93] var_1_27 = var_1_28 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=95, var_1_18=126, var_1_19=126, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=4294967299, var_1_28=4294967299, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=-40961] [L95] COND FALSE !((var_1_23 <= var_1_20) || var_1_6) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=95, var_1_18=126, var_1_19=126, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=4294967299, var_1_28=4294967299, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=-40961] [L102] COND FALSE !(((((4) < 0 ) ? -(4) : (4))) >= var_1_21) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=95, var_1_18=126, var_1_19=126, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=4294967299, var_1_28=4294967299, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=-40961] [L111] COND FALSE !(var_1_21 <= var_1_23) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=95, var_1_18=126, var_1_19=126, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=4294967299, var_1_28=4294967299, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=-40961] [L114] EXPR (~ var_1_10) >> ((((var_1_22) > (var_1_22)) ? (var_1_22) : (var_1_22))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=95, var_1_18=126, var_1_19=126, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=4294967299, var_1_28=4294967299, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=-40961] [L114] COND FALSE !(((~ var_1_10) >> ((((var_1_22) > (var_1_22)) ? (var_1_22) : (var_1_22)))) >= var_1_10) [L117] var_1_50 = var_1_29 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=95, var_1_18=126, var_1_19=126, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=4294967299, var_1_28=4294967299, var_1_29=4294967301, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=4294967301, var_1_52=-1, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=-40961] [L118] COND FALSE !((~ var_1_20) > var_1_20) [L121] var_1_52 = ((((var_1_21) < (var_1_21)) ? (var_1_21) : (var_1_21))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=95, var_1_18=126, var_1_19=126, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=4294967299, var_1_28=4294967299, var_1_29=4294967301, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=4294967301, var_1_52=31, var_1_53=64, var_1_6=0, var_1_8=126, var_1_9=-40961] [L123] var_1_53 = var_1_22 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=95, var_1_18=126, var_1_19=126, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=4294967299, var_1_28=4294967299, var_1_29=4294967301, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=4294967301, var_1_52=31, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=-40961] [L188] RET step() [L189] CALL, EXPR property() [L179-L180] return (((((((var_1_23 < var_1_23) ? ((var_1_24 && var_1_24) ? (var_1_24 ? ((var_1_24 && (var_1_24 || var_1_24)) ? (var_1_1 == ((signed char) -5)) : 1) : 1) : (var_1_1 == ((signed char) var_1_8))) : (var_1_1 == ((signed char) var_1_8))) && ((var_1_1 < (-1 - var_1_10)) ? (var_1_24 ? (var_1_9 == ((unsigned short int) (var_1_10 + ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))))) : (var_1_9 == ((unsigned short int) ((var_1_12 - var_1_10) - ((var_1_13 - var_1_23) - ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))))))) : (var_1_9 == ((unsigned short int) var_1_13)))) && (var_1_17 == ((signed char) (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22)))))) && (((- last_1_var_1_9) < (last_1_var_1_9 + -500)) ? (var_1_23 == ((unsigned char) var_1_20)) : 1)) && (var_1_4 ? (var_1_24 == ((unsigned char) (! var_1_25))) : (var_1_24 == ((unsigned char) (var_1_6 && ((var_1_10 >= var_1_17) && var_1_25)))))) && ((var_1_9 < (var_1_21 + var_1_23)) ? (var_1_27 == ((double) ((var_1_28 + var_1_29) + var_1_30))) : (var_1_27 == ((double) var_1_28)))) && (var_1_31 == ((float) var_1_30)) ; VAL [\result=0, isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=95, var_1_18=126, var_1_19=126, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=4294967299, var_1_28=4294967299, var_1_29=4294967301, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=4294967301, var_1_52=31, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=-40961] [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=95, var_1_18=126, var_1_19=126, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=4294967299, var_1_28=4294967299, var_1_29=4294967301, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=4294967301, var_1_52=31, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=-40961] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=4, var_1_10=95, var_1_12=-2, var_1_13=-40961, var_1_17=95, var_1_18=126, var_1_19=126, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=4294967299, var_1_28=4294967299, var_1_29=4294967301, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=4294967301, var_1_52=31, var_1_53=0, var_1_6=0, var_1_8=126, var_1_9=-40961] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.9s, OverallIterations: 6, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1978 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1869 mSDsluCounter, 3809 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3065 mSDsCounter, 1144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5634 IncrementalHoareTripleChecker+Invalid, 6778 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1144 mSolverCounterUnsat, 744 mSDtfsCounter, 5634 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1675 GetRequests, 1516 SyntacticMatches, 2 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3967 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=737occurred in iteration=5, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 5 MinimizatonAttempts, 652 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1773 NumberOfCodeBlocks, 1773 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 2156 ConstructedInterpolants, 0 QuantifiedInterpolants, 8236 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1327 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 19881/20460 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 04:09:31,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-pe-ci_file-96.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 b55edfcf8f1bec3a32276e499d06b3c7a9d9d8a099643ca6d0ff5cddc940e456 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:09:33,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:09:34,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 04:09:34,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:09:34,066 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:09:34,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:09:34,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:09:34,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:09:34,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:09:34,107 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:09:34,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:09:34,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:09:34,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:09:34,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:09:34,111 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:09:34,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:09:34,112 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:09:34,112 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:09:34,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:09:34,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:09:34,113 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:09:34,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:09:34,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:09:34,116 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 04:09:34,116 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 04:09:34,116 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:09:34,117 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 04:09:34,117 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:09:34,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:09:34,117 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:09:34,118 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:09:34,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:09:34,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:09:34,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:09:34,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:09:34,119 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:09:34,119 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:09:34,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:09:34,119 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 04:09:34,119 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 04:09:34,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:09:34,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:09:34,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:09:34,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:09:34,121 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 -> b55edfcf8f1bec3a32276e499d06b3c7a9d9d8a099643ca6d0ff5cddc940e456 [2024-11-20 04:09:34,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:09:34,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:09:34,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:09:34,510 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:09:34,511 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:09:34,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-96.i [2024-11-20 04:09:36,097 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:09:36,348 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:09:36,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-96.i [2024-11-20 04:09:36,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ded967b/82786b796e764057945613f3a62fb2f1/FLAGc28418f47 [2024-11-20 04:09:36,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ded967b/82786b796e764057945613f3a62fb2f1 [2024-11-20 04:09:36,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:09:36,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:09:36,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:09:36,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:09:36,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:09:36,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:09:36" (1/1) ... [2024-11-20 04:09:36,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@642c5926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:36, skipping insertion in model container [2024-11-20 04:09:36,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:09:36" (1/1) ... [2024-11-20 04:09:36,738 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:09:36,942 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-96.i[919,932] [2024-11-20 04:09:37,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:09:37,055 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:09:37,070 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-96.i[919,932] [2024-11-20 04:09:37,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:09:37,151 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:09:37,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:37 WrapperNode [2024-11-20 04:09:37,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:09:37,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:09:37,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:09:37,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:09:37,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:37" (1/1) ... [2024-11-20 04:09:37,181 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:37" (1/1) ... [2024-11-20 04:09:37,224 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2024-11-20 04:09:37,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:09:37,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:09:37,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:09:37,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:09:37,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:37" (1/1) ... [2024-11-20 04:09:37,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:37" (1/1) ... [2024-11-20 04:09:37,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:37" (1/1) ... [2024-11-20 04:09:37,272 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 04:09:37,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:37" (1/1) ... [2024-11-20 04:09:37,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:37" (1/1) ... [2024-11-20 04:09:37,290 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:37" (1/1) ... [2024-11-20 04:09:37,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:37" (1/1) ... [2024-11-20 04:09:37,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:37" (1/1) ... [2024-11-20 04:09:37,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:37" (1/1) ... [2024-11-20 04:09:37,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:09:37,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:09:37,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:09:37,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:09:37,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:37" (1/1) ... [2024-11-20 04:09:37,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:09:37,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:09:37,362 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 04:09:37,371 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 04:09:37,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:09:37,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 04:09:37,416 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:09:37,416 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:09:37,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:09:37,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:09:37,553 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:09:37,556 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:09:42,260 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-20 04:09:42,261 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:09:42,279 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:09:42,279 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:09:42,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:09:42 BoogieIcfgContainer [2024-11-20 04:09:42,280 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:09:42,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:09:42,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:09:42,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:09:42,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:09:36" (1/3) ... [2024-11-20 04:09:42,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2b87b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:09:42, skipping insertion in model container [2024-11-20 04:09:42,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:09:37" (2/3) ... [2024-11-20 04:09:42,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2b87b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:09:42, skipping insertion in model container [2024-11-20 04:09:42,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:09:42" (3/3) ... [2024-11-20 04:09:42,292 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-96.i [2024-11-20 04:09:42,333 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:09:42,333 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:09:42,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:09:42,411 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;@154a0cf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:09:42,411 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:09:42,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-20 04:09:42,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-20 04:09:42,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:09:42,431 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:42,431 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:09:42,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:09:42,437 INFO L85 PathProgramCache]: Analyzing trace with hash 880340249, now seen corresponding path program 1 times [2024-11-20 04:09:42,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:09:42,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778097569] [2024-11-20 04:09:42,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:09:42,450 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 04:09:42,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:09:42,454 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 04:09:42,455 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 04:09:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:42,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 04:09:42,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:09:42,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 704 proven. 0 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2024-11-20 04:09:42,917 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:09:42,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:09:42,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778097569] [2024-11-20 04:09:42,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778097569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:09:42,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:09:42,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:09:42,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217700486] [2024-11-20 04:09:42,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:09:42,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:09:42,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:09:42,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:09:42,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:09:42,967 INFO L87 Difference]: Start difference. First operand has 90 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-20 04:09:43,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:09:43,012 INFO L93 Difference]: Finished difference Result 170 states and 301 transitions. [2024-11-20 04:09:43,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:09:43,015 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 196 [2024-11-20 04:09:43,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:09:43,026 INFO L225 Difference]: With dead ends: 170 [2024-11-20 04:09:43,026 INFO L226 Difference]: Without dead ends: 83 [2024-11-20 04:09:43,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 195 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 04:09:43,037 INFO L432 NwaCegarLoop]: 127 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, 127 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 04:09:43,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:09:43,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-20 04:09:43,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-20 04:09:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-20 04:09:43,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 127 transitions. [2024-11-20 04:09:43,106 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 127 transitions. Word has length 196 [2024-11-20 04:09:43,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:09:43,108 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 127 transitions. [2024-11-20 04:09:43,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-20 04:09:43,109 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 127 transitions. [2024-11-20 04:09:43,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-20 04:09:43,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:09:43,113 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:43,129 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 04:09:43,314 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 04:09:43,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:09:43,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:09:43,316 INFO L85 PathProgramCache]: Analyzing trace with hash 840026015, now seen corresponding path program 1 times [2024-11-20 04:09:43,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:09:43,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060178912] [2024-11-20 04:09:43,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:09:43,317 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 04:09:43,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:09:43,339 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 04:09:43,341 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 04:09:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:43,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 04:09:43,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:09:44,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-20 04:09:44,868 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:09:44,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:09:44,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060178912] [2024-11-20 04:09:44,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060178912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:09:44,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:09:44,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:09:44,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135851916] [2024-11-20 04:09:44,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:09:44,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:09:44,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:09:44,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:09:44,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:09:44,877 INFO L87 Difference]: Start difference. First operand 83 states and 127 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-20 04:09:46,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:09:49,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:09:50,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:09:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:09:50,901 INFO L93 Difference]: Finished difference Result 244 states and 376 transitions. [2024-11-20 04:09:50,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:09:50,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-11-20 04:09:50,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:09:50,928 INFO L225 Difference]: With dead ends: 244 [2024-11-20 04:09:50,928 INFO L226 Difference]: Without dead ends: 164 [2024-11-20 04:09:50,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 04:09:50,931 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 71 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:09:50,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 361 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-20 04:09:50,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-20 04:09:50,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 138. [2024-11-20 04:09:50,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 73 states have internal predecessors, (88), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-20 04:09:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 212 transitions. [2024-11-20 04:09:50,976 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 212 transitions. Word has length 196 [2024-11-20 04:09:50,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:09:50,977 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 212 transitions. [2024-11-20 04:09:50,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-20 04:09:50,977 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 212 transitions. [2024-11-20 04:09:50,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-20 04:09:50,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:09:50,994 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:51,008 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 04:09:51,194 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 04:09:51,195 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:09:51,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:09:51,196 INFO L85 PathProgramCache]: Analyzing trace with hash -848917727, now seen corresponding path program 1 times [2024-11-20 04:09:51,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:09:51,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232354115] [2024-11-20 04:09:51,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:09:51,197 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 04:09:51,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:09:51,199 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 04:09:51,200 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 04:09:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:51,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 04:09:51,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:09:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1196 proven. 144 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2024-11-20 04:09:54,267 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:09:54,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:09:54,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232354115] [2024-11-20 04:09:54,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232354115] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:09:54,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [969181306] [2024-11-20 04:09:54,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:09:54,677 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 04:09:54,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 04:09:54,682 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 04:09:54,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-20 04:09:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:09:55,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 04:09:55,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:09:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 850 proven. 60 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-11-20 04:09:56,485 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:09:56,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [969181306] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:09:56,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 04:09:56,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 13 [2024-11-20 04:09:56,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620610762] [2024-11-20 04:09:56,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 04:09:56,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 04:09:56,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:09:56,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 04:09:56,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-20 04:09:56,902 INFO L87 Difference]: Start difference. First operand 138 states and 212 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 4 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) [2024-11-20 04:10:00,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:10:02,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:10:02,334 INFO L93 Difference]: Finished difference Result 342 states and 490 transitions. [2024-11-20 04:10:02,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-20 04:10:02,337 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 4 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) Word has length 196 [2024-11-20 04:10:02,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:10:02,343 INFO L225 Difference]: With dead ends: 342 [2024-11-20 04:10:02,343 INFO L226 Difference]: Without dead ends: 262 [2024-11-20 04:10:02,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=351, Invalid=909, Unknown=0, NotChecked=0, Total=1260 [2024-11-20 04:10:02,347 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 238 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-20 04:10:02,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 390 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-20 04:10:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-20 04:10:02,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 243. [2024-11-20 04:10:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 136 states have (on average 1.1397058823529411) internal successors, (155), 137 states have internal predecessors, (155), 93 states have call successors, (93), 13 states have call predecessors, (93), 13 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-20 04:10:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 341 transitions. [2024-11-20 04:10:02,399 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 341 transitions. Word has length 196 [2024-11-20 04:10:02,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:10:02,400 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 341 transitions. [2024-11-20 04:10:02,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 4 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) [2024-11-20 04:10:02,400 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 341 transitions. [2024-11-20 04:10:02,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-20 04:10:02,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:10:02,404 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:10:02,418 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 (4)] Forceful destruction successful, exit code 0 [2024-11-20 04:10:02,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-11-20 04:10:02,804 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-20 04:10:02,805 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:10:02,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:10:02,806 INFO L85 PathProgramCache]: Analyzing trace with hash -590752289, now seen corresponding path program 1 times [2024-11-20 04:10:02,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:10:02,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525122914] [2024-11-20 04:10:02,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:10:02,807 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 04:10:02,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:10:02,808 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 04:10:02,809 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 04:10:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:10:03,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 04:10:03,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:10:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 618 proven. 72 refuted. 0 times theorem prover too weak. 1170 trivial. 0 not checked. [2024-11-20 04:10:03,696 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:10:04,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-20 04:10:04,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:10:04,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525122914] [2024-11-20 04:10:04,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525122914] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:10:04,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 04:10:04,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-20 04:10:04,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751773065] [2024-11-20 04:10:04,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 04:10:04,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 04:10:04,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:10:04,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 04:10:04,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 04:10:04,287 INFO L87 Difference]: Start difference. First operand 243 states and 341 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-11-20 04:10:07,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:10:07,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:10:07,445 INFO L93 Difference]: Finished difference Result 436 states and 602 transitions. [2024-11-20 04:10:07,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 04:10:07,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 196 [2024-11-20 04:10:07,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:10:07,473 INFO L225 Difference]: With dead ends: 436 [2024-11-20 04:10:07,473 INFO L226 Difference]: Without dead ends: 263 [2024-11-20 04:10:07,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 384 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-20 04:10:07,476 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 36 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:10:07,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 178 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-20 04:10:07,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-20 04:10:07,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 255. [2024-11-20 04:10:07,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 145 states have (on average 1.1172413793103448) internal successors, (162), 146 states have internal predecessors, (162), 93 states have call successors, (93), 16 states have call predecessors, (93), 16 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-20 04:10:07,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 348 transitions. [2024-11-20 04:10:07,521 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 348 transitions. Word has length 196 [2024-11-20 04:10:07,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:10:07,524 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 348 transitions. [2024-11-20 04:10:07,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-11-20 04:10:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 348 transitions. [2024-11-20 04:10:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-20 04:10:07,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:10:07,531 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:10:07,546 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 04:10:07,732 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 04:10:07,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:10:07,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:10:07,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1400098915, now seen corresponding path program 1 times [2024-11-20 04:10:07,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:10:07,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993662800] [2024-11-20 04:10:07,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:10:07,734 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 04:10:07,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:10:07,737 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 04:10:07,738 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 04:10:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:10:07,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 04:10:07,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:10:08,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 958 proven. 42 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2024-11-20 04:10:08,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:10:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 48 proven. 42 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-20 04:10:08,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:10:08,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993662800] [2024-11-20 04:10:08,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993662800] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:10:08,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 04:10:08,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-20 04:10:08,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018892725] [2024-11-20 04:10:08,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 04:10:08,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 04:10:08,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:10:08,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 04:10:08,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 04:10:08,773 INFO L87 Difference]: Start difference. First operand 255 states and 348 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-20 04:10:10,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:10:10,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:10:10,553 INFO L93 Difference]: Finished difference Result 456 states and 613 transitions. [2024-11-20 04:10:10,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 04:10:10,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 196 [2024-11-20 04:10:10,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:10:10,556 INFO L225 Difference]: With dead ends: 456 [2024-11-20 04:10:10,556 INFO L226 Difference]: Without dead ends: 275 [2024-11-20 04:10:10,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 384 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-20 04:10:10,558 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 79 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 04:10:10,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 180 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 04:10:10,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-20 04:10:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 267. [2024-11-20 04:10:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 154 states have (on average 1.0974025974025974) internal successors, (169), 155 states have internal predecessors, (169), 93 states have call successors, (93), 19 states have call predecessors, (93), 19 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-20 04:10:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 355 transitions. [2024-11-20 04:10:10,595 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 355 transitions. Word has length 196 [2024-11-20 04:10:10,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:10:10,596 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 355 transitions. [2024-11-20 04:10:10,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-20 04:10:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 355 transitions. [2024-11-20 04:10:10,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-20 04:10:10,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:10:10,599 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:10:10,613 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 (7)] Forceful destruction successful, exit code 0 [2024-11-20 04:10:10,799 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 04:10:10,800 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:10:10,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:10:10,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1342840613, now seen corresponding path program 1 times [2024-11-20 04:10:10,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:10:10,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81912384] [2024-11-20 04:10:10,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:10:10,801 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 04:10:10,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:10:10,803 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 04:10:10,804 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 04:10:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:10:11,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 04:10:11,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:10:12,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 944 proven. 66 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-20 04:10:12,785 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:10:13,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:10:13,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81912384] [2024-11-20 04:10:13,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81912384] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:10:13,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1964618983] [2024-11-20 04:10:13,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:10:13,179 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 04:10:13,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 04:10:13,182 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 04:10:13,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-20 04:10:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:10:13,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 04:10:13,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:10:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 930 proven. 36 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2024-11-20 04:10:14,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:10:15,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1964618983] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:10:15,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 04:10:15,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2024-11-20 04:10:15,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127775504] [2024-11-20 04:10:15,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 04:10:15,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 04:10:15,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:10:15,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 04:10:15,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-11-20 04:10:15,226 INFO L87 Difference]: Start difference. First operand 267 states and 355 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-11-20 04:10:18,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:10:21,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:10:21,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:10:21,177 INFO L93 Difference]: Finished difference Result 673 states and 882 transitions. [2024-11-20 04:10:21,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 04:10:21,181 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 196 [2024-11-20 04:10:21,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:10:21,189 INFO L225 Difference]: With dead ends: 673 [2024-11-20 04:10:21,189 INFO L226 Difference]: Without dead ends: 484 [2024-11-20 04:10:21,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 552 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2024-11-20 04:10:21,191 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 84 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-20 04:10:21,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 389 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-20 04:10:21,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-11-20 04:10:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 474. [2024-11-20 04:10:21,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 281 states have (on average 1.092526690391459) internal successors, (307), 283 states have internal predecessors, (307), 155 states have call successors, (155), 37 states have call predecessors, (155), 37 states have return successors, (155), 153 states have call predecessors, (155), 155 states have call successors, (155) [2024-11-20 04:10:21,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 617 transitions. [2024-11-20 04:10:21,253 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 617 transitions. Word has length 196 [2024-11-20 04:10:21,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:10:21,254 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 617 transitions. [2024-11-20 04:10:21,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-11-20 04:10:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 617 transitions. [2024-11-20 04:10:21,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-20 04:10:21,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:10:21,266 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:10:21,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-20 04:10:21,478 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 (8)] Forceful destruction successful, exit code 0 [2024-11-20 04:10:21,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:10:21,668 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:10:21,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:10:21,669 INFO L85 PathProgramCache]: Analyzing trace with hash -662782243, now seen corresponding path program 1 times [2024-11-20 04:10:21,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:10:21,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280022987] [2024-11-20 04:10:21,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:10:21,669 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 04:10:21,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:10:21,670 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:10:21,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-20 04:10:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:10:21,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-20 04:10:21,947 INFO L278 TraceCheckSpWp]: Computing forward predicates...