./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-30.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 f2cbb62030ab23e4520c519e21c33cbadba0c771a34e0ede2d3d80a8d3569561 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:17:57,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:17:57,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 05:17:57,692 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:17:57,692 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:17:57,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:17:57,769 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:17:57,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:17:57,770 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:17:57,771 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:17:57,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:17:57,771 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:17:57,772 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:17:57,773 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:17:57,774 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:17:57,774 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:17:57,774 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:17:57,775 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:17:57,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 05:17:57,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:17:57,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:17:57,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:17:57,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:17:57,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:17:57,781 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:17:57,781 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:17:57,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:17:57,781 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:17:57,781 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:17:57,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:17:57,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:17:57,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:17:57,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:17:57,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:17:57,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:17:57,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:17:57,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 05:17:57,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 05:17:57,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:17:57,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:17:57,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:17:57,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:17:57,785 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 -> f2cbb62030ab23e4520c519e21c33cbadba0c771a34e0ede2d3d80a8d3569561 [2024-11-20 05:17:58,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:17:58,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:17:58,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:17:58,046 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:17:58,047 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:17:58,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-30.i [2024-11-20 05:17:59,383 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:17:59,561 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:17:59,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-30.i [2024-11-20 05:17:59,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2cddf788/d3e2209c247a4684aee8b38917fe9b4a/FLAGa845adc02 [2024-11-20 05:17:59,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2cddf788/d3e2209c247a4684aee8b38917fe9b4a [2024-11-20 05:17:59,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:17:59,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:17:59,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:17:59,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:17:59,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:17:59,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:17:59" (1/1) ... [2024-11-20 05:17:59,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@186ea58f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:17:59, skipping insertion in model container [2024-11-20 05:17:59,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:17:59" (1/1) ... [2024-11-20 05:17:59,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:17:59,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-30.i[919,932] [2024-11-20 05:17:59,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:17:59,826 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:17:59,836 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-30.i[919,932] [2024-11-20 05:17:59,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:17:59,883 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:17:59,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:17:59 WrapperNode [2024-11-20 05:17:59,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:17:59,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:17:59,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:17:59,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:17:59,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:17:59" (1/1) ... [2024-11-20 05:17:59,898 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:17:59" (1/1) ... [2024-11-20 05:17:59,926 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 256 [2024-11-20 05:17:59,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:17:59,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:17:59,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:17:59,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:17:59,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:17:59" (1/1) ... [2024-11-20 05:17:59,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:17:59" (1/1) ... [2024-11-20 05:17:59,939 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:17:59" (1/1) ... [2024-11-20 05:17:59,950 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 05:17:59,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:17:59" (1/1) ... [2024-11-20 05:17:59,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:17:59" (1/1) ... [2024-11-20 05:17:59,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:17:59" (1/1) ... [2024-11-20 05:17:59,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:17:59" (1/1) ... [2024-11-20 05:17:59,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:17:59" (1/1) ... [2024-11-20 05:17:59,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:17:59" (1/1) ... [2024-11-20 05:17:59,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:17:59,965 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:17:59,965 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:17:59,965 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:17:59,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:17:59" (1/1) ... [2024-11-20 05:17:59,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:17:59,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:18:00,012 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 05:18:00,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 05:18:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:18:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:18:00,080 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:18:00,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 05:18:00,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:18:00,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:18:00,177 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:18:00,180 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:18:00,484 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 05:18:00,485 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:18:00,502 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:18:00,503 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:18:00,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:18:00 BoogieIcfgContainer [2024-11-20 05:18:00,503 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:18:00,506 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:18:00,506 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:18:00,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:18:00,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:17:59" (1/3) ... [2024-11-20 05:18:00,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378290a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:18:00, skipping insertion in model container [2024-11-20 05:18:00,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:17:59" (2/3) ... [2024-11-20 05:18:00,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378290a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:18:00, skipping insertion in model container [2024-11-20 05:18:00,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:18:00" (3/3) ... [2024-11-20 05:18:00,511 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-30.i [2024-11-20 05:18:00,524 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:18:00,524 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:18:00,585 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:18:00,590 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;@7dcde149, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:18:00,594 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:18:00,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 77 states have internal predecessors, (111), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-20 05:18:00,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-20 05:18:00,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:18:00,619 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:18:00,619 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:18:00,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:18:00,624 INFO L85 PathProgramCache]: Analyzing trace with hash 292949354, now seen corresponding path program 1 times [2024-11-20 05:18:00,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:18:00,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972487305] [2024-11-20 05:18:00,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:18:00,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:18:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:00,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:18:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:00,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:18:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:00,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:18:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:00,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:18:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:00,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:18:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:00,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:18:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:00,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:18:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:00,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:18:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:00,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:18:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:00,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:18:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:00,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 05:18:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 05:18:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 05:18:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 05:18:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 05:18:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 05:18:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 05:18:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 05:18:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 05:18:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 05:18:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 05:18:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 05:18:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 05:18:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 05:18:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:18:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 05:18:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 05:18:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 05:18:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 05:18:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 05:18:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 05:18:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 05:18:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-20 05:18:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-20 05:18:01,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:18:01,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972487305] [2024-11-20 05:18:01,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972487305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:18:01,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:18:01,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:18:01,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449717620] [2024-11-20 05:18:01,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:18:01,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:18:01,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:18:01,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:18:01,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:18:01,156 INFO L87 Difference]: Start difference. First operand has 112 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 77 states have internal predecessors, (111), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-20 05:18:01,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:18:01,188 INFO L93 Difference]: Finished difference Result 217 states and 381 transitions. [2024-11-20 05:18:01,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:18:01,190 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 217 [2024-11-20 05:18:01,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:18:01,203 INFO L225 Difference]: With dead ends: 217 [2024-11-20 05:18:01,203 INFO L226 Difference]: Without dead ends: 108 [2024-11-20 05:18:01,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:18:01,213 INFO L432 NwaCegarLoop]: 170 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, 170 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:18:01,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:18:01,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-20 05:18:01,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-20 05:18:01,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 73 states have internal predecessors, (104), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-20 05:18:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 170 transitions. [2024-11-20 05:18:01,335 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 170 transitions. Word has length 217 [2024-11-20 05:18:01,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:18:01,360 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 170 transitions. [2024-11-20 05:18:01,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-20 05:18:01,361 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 170 transitions. [2024-11-20 05:18:01,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-20 05:18:01,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:18:01,376 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:18:01,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 05:18:01,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:18:01,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:18:01,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1993310220, now seen corresponding path program 1 times [2024-11-20 05:18:01,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:18:01,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252554670] [2024-11-20 05:18:01,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:18:01,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:18:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:18:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:18:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:18:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:18:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:18:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:18:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:18:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:18:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:18:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:18:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 05:18:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 05:18:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 05:18:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 05:18:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 05:18:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 05:18:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 05:18:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 05:18:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 05:18:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 05:18:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 05:18:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 05:18:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 05:18:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 05:18:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:18:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 05:18:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 05:18:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 05:18:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 05:18:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 05:18:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 05:18:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 05:18:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-20 05:18:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-20 05:18:01,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:18:01,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252554670] [2024-11-20 05:18:01,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252554670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:18:01,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:18:01,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:18:01,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862016589] [2024-11-20 05:18:01,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:18:01,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:18:01,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:18:01,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:18:01,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:18:01,745 INFO L87 Difference]: Start difference. First operand 108 states and 170 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-20 05:18:01,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:18:01,785 INFO L93 Difference]: Finished difference Result 214 states and 338 transitions. [2024-11-20 05:18:01,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:18:01,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 217 [2024-11-20 05:18:01,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:18:01,791 INFO L225 Difference]: With dead ends: 214 [2024-11-20 05:18:01,791 INFO L226 Difference]: Without dead ends: 109 [2024-11-20 05:18:01,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:18:01,793 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 161 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:18:01,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 166 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:18:01,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-20 05:18:01,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-20 05:18:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 73 states have internal predecessors, (103), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-20 05:18:01,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 169 transitions. [2024-11-20 05:18:01,805 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 169 transitions. Word has length 217 [2024-11-20 05:18:01,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:18:01,806 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 169 transitions. [2024-11-20 05:18:01,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-20 05:18:01,807 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 169 transitions. [2024-11-20 05:18:01,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-20 05:18:01,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:18:01,809 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:18:01,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 05:18:01,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:18:01,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:18:01,810 INFO L85 PathProgramCache]: Analyzing trace with hash -434843923, now seen corresponding path program 1 times [2024-11-20 05:18:01,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:18:01,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215105504] [2024-11-20 05:18:01,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:18:01,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:18:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:18:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:18:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:18:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:18:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:18:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:18:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:18:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:18:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:18:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:18:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 05:18:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:01,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 05:18:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 05:18:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 05:18:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 05:18:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 05:18:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 05:18:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 05:18:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 05:18:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 05:18:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 05:18:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 05:18:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 05:18:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 05:18:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:18:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 05:18:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 05:18:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 05:18:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 05:18:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 05:18:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 05:18:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 05:18:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-20 05:18:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-20 05:18:02,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:18:02,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215105504] [2024-11-20 05:18:02,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215105504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:18:02,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:18:02,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:18:02,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69107483] [2024-11-20 05:18:02,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:18:02,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:18:02,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:18:02,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:18:02,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:18:02,064 INFO L87 Difference]: Start difference. First operand 108 states and 169 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-20 05:18:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:18:02,295 INFO L93 Difference]: Finished difference Result 276 states and 431 transitions. [2024-11-20 05:18:02,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:18:02,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 218 [2024-11-20 05:18:02,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:18:02,299 INFO L225 Difference]: With dead ends: 276 [2024-11-20 05:18:02,300 INFO L226 Difference]: Without dead ends: 171 [2024-11-20 05:18:02,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:18:02,302 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 258 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:18:02,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 357 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:18:02,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-20 05:18:02,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 108. [2024-11-20 05:18:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 73 states have internal predecessors, (102), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-20 05:18:02,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 168 transitions. [2024-11-20 05:18:02,316 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 168 transitions. Word has length 218 [2024-11-20 05:18:02,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:18:02,317 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 168 transitions. [2024-11-20 05:18:02,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-20 05:18:02,317 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 168 transitions. [2024-11-20 05:18:02,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-20 05:18:02,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:18:02,319 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:18:02,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 05:18:02,319 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:18:02,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:18:02,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1865978667, now seen corresponding path program 1 times [2024-11-20 05:18:02,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:18:02,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231683135] [2024-11-20 05:18:02,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:18:02,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:18:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:18:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:18:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:18:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:18:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:18:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:18:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:18:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:18:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:18:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:18:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 05:18:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 05:18:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 05:18:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 05:18:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 05:18:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 05:18:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 05:18:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 05:18:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 05:18:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 05:18:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 05:18:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 05:18:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 05:18:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 05:18:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:18:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 05:18:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 05:18:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 05:18:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 05:18:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 05:18:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 05:18:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 05:18:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-20 05:18:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:02,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-20 05:18:02,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:18:02,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231683135] [2024-11-20 05:18:02,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231683135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:18:02,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:18:02,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 05:18:02,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863568] [2024-11-20 05:18:02,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:18:02,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 05:18:02,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:18:02,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 05:18:02,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:18:02,585 INFO L87 Difference]: Start difference. First operand 108 states and 168 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-20 05:18:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:18:02,810 INFO L93 Difference]: Finished difference Result 347 states and 543 transitions. [2024-11-20 05:18:02,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 05:18:02,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 218 [2024-11-20 05:18:02,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:18:02,813 INFO L225 Difference]: With dead ends: 347 [2024-11-20 05:18:02,815 INFO L226 Difference]: Without dead ends: 242 [2024-11-20 05:18:02,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 05:18:02,816 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 160 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:18:02,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 604 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:18:02,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-20 05:18:02,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 213. [2024-11-20 05:18:02,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 144 states have (on average 1.3888888888888888) internal successors, (200), 144 states have internal predecessors, (200), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-20 05:18:02,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 332 transitions. [2024-11-20 05:18:02,859 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 332 transitions. Word has length 218 [2024-11-20 05:18:02,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:18:02,861 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 332 transitions. [2024-11-20 05:18:02,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-20 05:18:02,861 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 332 transitions. [2024-11-20 05:18:02,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-20 05:18:02,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:18:02,866 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:18:02,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 05:18:02,866 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:18:02,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:18:02,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1417871379, now seen corresponding path program 1 times [2024-11-20 05:18:02,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:18:02,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426758577] [2024-11-20 05:18:02,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:18:02,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:18:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:18:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:18:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:18:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:18:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:18:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:18:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:18:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:18:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:18:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:18:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 05:18:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 05:18:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 05:18:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 05:18:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 05:18:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 05:18:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 05:18:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 05:18:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 05:18:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 05:18:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 05:18:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 05:18:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 05:18:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 05:18:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:18:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 05:18:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 05:18:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 05:18:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 05:18:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 05:18:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 05:18:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 05:18:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-20 05:18:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-20 05:18:03,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:18:03,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426758577] [2024-11-20 05:18:03,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426758577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:18:03,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:18:03,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:18:03,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427155743] [2024-11-20 05:18:03,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:18:03,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:18:03,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:18:03,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:18:03,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:18:03,180 INFO L87 Difference]: Start difference. First operand 213 states and 332 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-20 05:18:03,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:18:03,339 INFO L93 Difference]: Finished difference Result 453 states and 706 transitions. [2024-11-20 05:18:03,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:18:03,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 218 [2024-11-20 05:18:03,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:18:03,344 INFO L225 Difference]: With dead ends: 453 [2024-11-20 05:18:03,345 INFO L226 Difference]: Without dead ends: 346 [2024-11-20 05:18:03,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:18:03,349 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 120 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:18:03,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 483 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:18:03,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-20 05:18:03,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 289. [2024-11-20 05:18:03,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 186 states have (on average 1.3548387096774193) internal successors, (252), 186 states have internal predecessors, (252), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-20 05:18:03,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 450 transitions. [2024-11-20 05:18:03,411 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 450 transitions. Word has length 218 [2024-11-20 05:18:03,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:18:03,412 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 450 transitions. [2024-11-20 05:18:03,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-20 05:18:03,412 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 450 transitions. [2024-11-20 05:18:03,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-20 05:18:03,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:18:03,414 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:18:03,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 05:18:03,415 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:18:03,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:18:03,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1394918424, now seen corresponding path program 1 times [2024-11-20 05:18:03,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:18:03,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478977537] [2024-11-20 05:18:03,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:18:03,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:18:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:18:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:18:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:18:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:18:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:18:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:18:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:18:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:18:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:18:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:18:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 05:18:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 05:18:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 05:18:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 05:18:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 05:18:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 05:18:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 05:18:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 05:18:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 05:18:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 05:18:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 05:18:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 05:18:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 05:18:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 05:18:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:18:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 05:18:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 05:18:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 05:18:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 05:18:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 05:18:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 05:18:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 05:18:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-20 05:18:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-20 05:18:03,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:18:03,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478977537] [2024-11-20 05:18:03,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478977537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 05:18:03,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625550765] [2024-11-20 05:18:03,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:18:03,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:18:03,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:18:03,777 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 05:18:03,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 05:18:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:03,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 05:18:03,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:18:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 66 proven. 186 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-20 05:18:04,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:18:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-20 05:18:04,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625550765] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 05:18:04,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 05:18:04,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-11-20 05:18:04,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245185630] [2024-11-20 05:18:04,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 05:18:04,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 05:18:04,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:18:04,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 05:18:04,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-20 05:18:04,666 INFO L87 Difference]: Start difference. First operand 289 states and 450 transitions. Second operand has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 3 states have call successors, (65), 3 states have call predecessors, (65), 5 states have return successors, (66), 2 states have call predecessors, (66), 3 states have call successors, (66) [2024-11-20 05:18:05,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:18:05,085 INFO L93 Difference]: Finished difference Result 557 states and 846 transitions. [2024-11-20 05:18:05,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 05:18:05,085 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 3 states have call successors, (65), 3 states have call predecessors, (65), 5 states have return successors, (66), 2 states have call predecessors, (66), 3 states have call successors, (66) Word has length 219 [2024-11-20 05:18:05,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:18:05,088 INFO L225 Difference]: With dead ends: 557 [2024-11-20 05:18:05,088 INFO L226 Difference]: Without dead ends: 347 [2024-11-20 05:18:05,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 498 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2024-11-20 05:18:05,090 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 513 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 05:18:05,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 595 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 05:18:05,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-20 05:18:05,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 313. [2024-11-20 05:18:05,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 204 states have (on average 1.303921568627451) internal successors, (266), 204 states have internal predecessors, (266), 99 states have call successors, (99), 9 states have call predecessors, (99), 9 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-20 05:18:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 464 transitions. [2024-11-20 05:18:05,131 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 464 transitions. Word has length 219 [2024-11-20 05:18:05,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:18:05,131 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 464 transitions. [2024-11-20 05:18:05,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 3 states have call successors, (65), 3 states have call predecessors, (65), 5 states have return successors, (66), 2 states have call predecessors, (66), 3 states have call successors, (66) [2024-11-20 05:18:05,132 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 464 transitions. [2024-11-20 05:18:05,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-20 05:18:05,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:18:05,134 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:18:05,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 05:18:05,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-20 05:18:05,335 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:18:05,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:18:05,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1707143405, now seen corresponding path program 1 times [2024-11-20 05:18:05,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:18:05,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684879797] [2024-11-20 05:18:05,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:18:05,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:18:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:18:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:18:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:18:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:18:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:18:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:18:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:18:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:18:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:18:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:18:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 05:18:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 05:18:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 05:18:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 05:18:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 05:18:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 05:18:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 05:18:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 05:18:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 05:18:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 05:18:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 05:18:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 05:18:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 05:18:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 05:18:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:18:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 05:18:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 05:18:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 05:18:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-20 05:18:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 05:18:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 05:18:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 05:18:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-20 05:18:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-20 05:18:05,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:18:05,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684879797] [2024-11-20 05:18:05,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684879797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:18:05,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:18:05,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:18:05,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322226167] [2024-11-20 05:18:05,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:18:05,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:18:05,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:18:05,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:18:05,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:18:05,520 INFO L87 Difference]: Start difference. First operand 313 states and 464 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-20 05:18:05,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:18:05,596 INFO L93 Difference]: Finished difference Result 539 states and 801 transitions. [2024-11-20 05:18:05,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:18:05,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 220 [2024-11-20 05:18:05,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:18:05,599 INFO L225 Difference]: With dead ends: 539 [2024-11-20 05:18:05,599 INFO L226 Difference]: Without dead ends: 313 [2024-11-20 05:18:05,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:18:05,602 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:18:05,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 305 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:18:05,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-20 05:18:05,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2024-11-20 05:18:05,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 204 states have (on average 1.2941176470588236) internal successors, (264), 204 states have internal predecessors, (264), 99 states have call successors, (99), 9 states have call predecessors, (99), 9 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-20 05:18:05,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 462 transitions. [2024-11-20 05:18:05,642 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 462 transitions. Word has length 220 [2024-11-20 05:18:05,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:18:05,643 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 462 transitions. [2024-11-20 05:18:05,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-20 05:18:05,643 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 462 transitions. [2024-11-20 05:18:05,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-20 05:18:05,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:18:05,645 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:18:05,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 05:18:05,645 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:18:05,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:18:05,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1492643933, now seen corresponding path program 1 times [2024-11-20 05:18:05,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:18:05,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429233814] [2024-11-20 05:18:05,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:18:05,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:18:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:18:05,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 05:18:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:18:05,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 05:18:05,809 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 05:18:05,809 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 05:18:05,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 05:18:05,814 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:18:05,918 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 05:18:05,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:18:05 BoogieIcfgContainer [2024-11-20 05:18:05,920 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 05:18:05,920 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 05:18:05,920 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 05:18:05,921 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 05:18:05,921 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:18:00" (3/4) ... [2024-11-20 05:18:05,923 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 05:18:05,924 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 05:18:05,925 INFO L158 Benchmark]: Toolchain (without parser) took 6335.07ms. Allocated memory was 148.9MB in the beginning and 385.9MB in the end (delta: 237.0MB). Free memory was 79.8MB in the beginning and 215.9MB in the end (delta: -136.0MB). Peak memory consumption was 103.0MB. Max. memory is 16.1GB. [2024-11-20 05:18:05,925 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 148.9MB. Free memory is still 112.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:18:05,925 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.37ms. Allocated memory is still 148.9MB. Free memory was 79.5MB in the beginning and 62.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 05:18:05,925 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.92ms. Allocated memory is still 148.9MB. Free memory was 62.2MB in the beginning and 59.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 05:18:05,926 INFO L158 Benchmark]: Boogie Preprocessor took 36.63ms. Allocated memory is still 148.9MB. Free memory was 59.1MB in the beginning and 56.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 05:18:05,926 INFO L158 Benchmark]: RCFGBuilder took 538.97ms. Allocated memory was 148.9MB in the beginning and 297.8MB in the end (delta: 148.9MB). Free memory was 56.0MB in the beginning and 251.3MB in the end (delta: -195.3MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2024-11-20 05:18:05,926 INFO L158 Benchmark]: TraceAbstraction took 5414.22ms. Allocated memory was 297.8MB in the beginning and 385.9MB in the end (delta: 88.1MB). Free memory was 251.3MB in the beginning and 216.9MB in the end (delta: 34.4MB). Peak memory consumption was 123.5MB. Max. memory is 16.1GB. [2024-11-20 05:18:05,926 INFO L158 Benchmark]: Witness Printer took 3.99ms. Allocated memory is still 385.9MB. Free memory was 216.9MB in the beginning and 215.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:18:05,927 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.13ms. Allocated memory is still 148.9MB. Free memory is still 112.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.37ms. Allocated memory is still 148.9MB. Free memory was 79.5MB in the beginning and 62.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.92ms. Allocated memory is still 148.9MB. Free memory was 62.2MB in the beginning and 59.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.63ms. Allocated memory is still 148.9MB. Free memory was 59.1MB in the beginning and 56.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 538.97ms. Allocated memory was 148.9MB in the beginning and 297.8MB in the end (delta: 148.9MB). Free memory was 56.0MB in the beginning and 251.3MB in the end (delta: -195.3MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5414.22ms. Allocated memory was 297.8MB in the beginning and 385.9MB in the end (delta: 88.1MB). Free memory was 251.3MB in the beginning and 216.9MB in the end (delta: 34.4MB). Peak memory consumption was 123.5MB. Max. memory is 16.1GB. * Witness Printer took 3.99ms. Allocated memory is still 385.9MB. Free memory was 216.9MB in the beginning and 215.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 201, overapproximation of someUnaryDOUBLEoperation at line 39, overapproximation of someBinaryArithmeticDOUBLEoperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 221, overapproximation of someBinaryArithmeticFLOAToperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] double var_1_5 = 127.5; [L25] double var_1_7 = 10000000000000.125; [L26] double var_1_8 = 1.25; [L27] double var_1_10 = 25.7; [L28] signed long int var_1_11 = -2; [L29] signed long int var_1_13 = 5; [L30] signed long int var_1_14 = 128; [L31] signed long int var_1_15 = 1000; [L32] double var_1_16 = 0.2; [L33] double var_1_17 = 0.25; [L34] double var_1_18 = 99999999999999.5; [L35] signed short int var_1_19 = -64; [L36] double var_1_20 = 256.75; [L37] double var_1_21 = 100.4; [L38] double var_1_22 = 4.5; [L39] double var_1_23 = -0.5; [L40] signed long int var_1_24 = 10; [L41] signed char var_1_25 = -8; [L42] double var_1_26 = 9.75; [L43] unsigned char var_1_27 = 1; [L44] signed char var_1_28 = 8; [L45] unsigned long int var_1_29 = 16; [L46] unsigned long int var_1_30 = 1; [L47] float var_1_31 = 16.6; [L48] unsigned char var_1_32 = 0; [L49] float var_1_33 = 0.25; [L50] float var_1_34 = 99.8; [L51] signed short int var_1_35 = 256; [L52] unsigned long int var_1_36 = 16; [L53] double var_1_37 = 8.5; [L54] unsigned long int var_1_38 = 3569725445; [L55] unsigned long int var_1_39 = 3551809449; [L56] unsigned long int var_1_40 = 10000000; [L57] unsigned char last_1_var_1_1 = 1; [L58] signed long int last_1_var_1_11 = -2; [L59] signed long int last_1_var_1_15 = 1000; [L60] double last_1_var_1_16 = 0.2; VAL [isInitial=0, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=0, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L225] isInitial = 1 [L226] FCALL initially() [L227] COND TRUE 1 [L228] CALL updateLastVariables() [L215] last_1_var_1_1 = var_1_1 [L216] last_1_var_1_11 = var_1_11 [L217] last_1_var_1_15 = var_1_15 [L218] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=0, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L228] RET updateLastVariables() [L229] CALL updateVariables() [L158] var_1_4 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L159] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L160] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L160] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L161] var_1_7 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L162] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L163] var_1_10 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L164] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L165] var_1_13 = __VERIFIER_nondet_long() [L166] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L166] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L167] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L167] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L168] var_1_14 = __VERIFIER_nondet_long() [L169] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L169] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L170] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L170] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L171] var_1_17 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L172] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L173] var_1_18 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L174] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L175] var_1_20 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_20 >= -922337.2036854776000e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L176] RET assume_abort_if_not((var_1_20 >= -922337.2036854776000e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L177] var_1_21 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L178] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L179] var_1_22 = __VERIFIER_nondet_double() [L180] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L180] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L181] var_1_23 = __VERIFIER_nondet_double() [L182] CALL assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L182] RET assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L183] var_1_26 = __VERIFIER_nondet_double() [L184] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L184] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L185] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L185] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L186] var_1_27 = __VERIFIER_nondet_uchar() [L187] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L187] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L188] CALL assume_abort_if_not(var_1_27 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L188] RET assume_abort_if_not(var_1_27 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L189] var_1_28 = __VERIFIER_nondet_char() [L190] CALL assume_abort_if_not(var_1_28 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L190] RET assume_abort_if_not(var_1_28 >= -127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L191] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L191] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L192] var_1_30 = __VERIFIER_nondet_ulong() [L193] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L193] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L194] CALL assume_abort_if_not(var_1_30 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L194] RET assume_abort_if_not(var_1_30 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L195] var_1_32 = __VERIFIER_nondet_uchar() [L196] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L196] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L197] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L197] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L198] var_1_33 = __VERIFIER_nondet_float() [L199] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L199] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L200] var_1_34 = __VERIFIER_nondet_float() [L201] CALL assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L201] RET assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L202] var_1_37 = __VERIFIER_nondet_double() [L203] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L203] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L204] var_1_38 = __VERIFIER_nondet_ulong() [L205] CALL assume_abort_if_not(var_1_38 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L205] RET assume_abort_if_not(var_1_38 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L206] CALL assume_abort_if_not(var_1_38 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L206] RET assume_abort_if_not(var_1_38 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L207] var_1_39 = __VERIFIER_nondet_ulong() [L208] CALL assume_abort_if_not(var_1_39 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L208] RET assume_abort_if_not(var_1_39 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L209] CALL assume_abort_if_not(var_1_39 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L209] RET assume_abort_if_not(var_1_39 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L210] var_1_40 = __VERIFIER_nondet_ulong() [L211] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L211] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L212] CALL assume_abort_if_not(var_1_40 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L212] RET assume_abort_if_not(var_1_40 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L229] RET updateVariables() [L230] CALL step() [L64] COND TRUE (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) - var_1_21) == (var_1_22 * var_1_23) [L65] var_1_19 = -4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L67] var_1_24 = var_1_19 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L68] COND TRUE var_1_21 != var_1_23 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L69] COND TRUE var_1_20 < (var_1_22 / var_1_26) [L70] var_1_25 = ((((4) < 0 ) ? -(4) : (4))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L81] var_1_29 = var_1_30 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=-2, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L82] COND FALSE !(var_1_22 > var_1_23) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=-2, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L89] COND TRUE \read(var_1_27) [L90] var_1_31 = ((((((((var_1_33) < (var_1_34)) ? (var_1_33) : (var_1_34))) < 0 ) ? -((((var_1_33) < (var_1_34)) ? (var_1_33) : (var_1_34))) : ((((var_1_33) < (var_1_34)) ? (var_1_33) : (var_1_34))))) - 256.35f) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L93] COND TRUE ! ((1 + var_1_24) <= var_1_19) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L94] COND FALSE !(var_1_24 > (((((((-5) < 0 ) ? -(-5) : (-5))) < 0 ) ? -((((-5) < 0 ) ? -(-5) : (-5))) : ((((-5) < 0 ) ? -(-5) : (-5)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L98] COND FALSE !(var_1_21 < var_1_23) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L105] COND TRUE \read(last_1_var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L106] COND TRUE ((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16 [L107] var_1_11 = ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L112] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L113] COND TRUE (last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= stepLocal_0 [L114] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L116] signed long int stepLocal_2 = var_1_11; [L117] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=0, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L118] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=0, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L119] COND TRUE var_1_11 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L120] COND TRUE stepLocal_1 || (var_1_11 < var_1_11) [L121] var_1_5 = var_1_7 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L127] EXPR var_1_11 & var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L127] COND FALSE !((- var_1_11) > (var_1_11 & var_1_13)) [L138] var_1_15 = var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L140] COND TRUE ((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7 [L141] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L145] COND FALSE !(10.55f < var_1_16) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L150] COND TRUE var_1_16 > var_1_7 [L151] var_1_8 = var_1_10 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000005, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000005] [L230] RET step() [L231] CALL, EXPR property() [L221] EXPR ((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000005, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000005] [L221-L222] return (((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L231] RET, EXPR property() [L231] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000005, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000005] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000005, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000005] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 8, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1213 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1212 mSDsluCounter, 2680 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1438 mSDsCounter, 408 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 632 IncrementalHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 408 mSolverCounterUnsat, 1242 mSDtfsCounter, 632 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 979 GetRequests, 941 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred in iteration=6, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 184 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1967 NumberOfCodeBlocks, 1967 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1956 ConstructedInterpolants, 0 QuantifiedInterpolants, 3870 SizeOfPredicates, 1 NumberOfNonLiveVariables, 490 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 18630/19008 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 05:18:05,961 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-ps-cn_file-30.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 f2cbb62030ab23e4520c519e21c33cbadba0c771a34e0ede2d3d80a8d3569561 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:18:07,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:18:08,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 05:18:08,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:18:08,013 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:18:08,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:18:08,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:18:08,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:18:08,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:18:08,038 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:18:08,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:18:08,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:18:08,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:18:08,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:18:08,040 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:18:08,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:18:08,043 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:18:08,043 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:18:08,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:18:08,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:18:08,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:18:08,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:18:08,044 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:18:08,044 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 05:18:08,044 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 05:18:08,044 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:18:08,044 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 05:18:08,044 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:18:08,045 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:18:08,045 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:18:08,045 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:18:08,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:18:08,045 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:18:08,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:18:08,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:18:08,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:18:08,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:18:08,046 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:18:08,048 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 05:18:08,048 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 05:18:08,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:18:08,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:18:08,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:18:08,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:18:08,049 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 -> f2cbb62030ab23e4520c519e21c33cbadba0c771a34e0ede2d3d80a8d3569561 [2024-11-20 05:18:08,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:18:08,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:18:08,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:18:08,372 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:18:08,375 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:18:08,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-30.i [2024-11-20 05:18:10,130 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:18:10,315 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:18:10,316 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-30.i [2024-11-20 05:18:10,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b553d45f/2a71f4c198414db9ade344d6d9ac8138/FLAG9b72970fe [2024-11-20 05:18:10,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b553d45f/2a71f4c198414db9ade344d6d9ac8138 [2024-11-20 05:18:10,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:18:10,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:18:10,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:18:10,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:18:10,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:18:10,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:18:10" (1/1) ... [2024-11-20 05:18:10,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29e93932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:18:10, skipping insertion in model container [2024-11-20 05:18:10,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:18:10" (1/1) ... [2024-11-20 05:18:10,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:18:10,923 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-30.i[919,932] [2024-11-20 05:18:10,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:18:11,016 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:18:11,025 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-30.i[919,932] [2024-11-20 05:18:11,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:18:11,082 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:18:11,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:18:11 WrapperNode [2024-11-20 05:18:11,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:18:11,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:18:11,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:18:11,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:18:11,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:18:11" (1/1) ... [2024-11-20 05:18:11,112 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:18:11" (1/1) ... [2024-11-20 05:18:11,140 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 230 [2024-11-20 05:18:11,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:18:11,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:18:11,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:18:11,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:18:11,149 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:18:11" (1/1) ... [2024-11-20 05:18:11,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:18:11" (1/1) ... [2024-11-20 05:18:11,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:18:11" (1/1) ... [2024-11-20 05:18:11,167 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 05:18:11,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:18:11" (1/1) ... [2024-11-20 05:18:11,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:18:11" (1/1) ... [2024-11-20 05:18:11,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:18:11" (1/1) ... [2024-11-20 05:18:11,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:18:11" (1/1) ... [2024-11-20 05:18:11,185 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:18:11" (1/1) ... [2024-11-20 05:18:11,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:18:11" (1/1) ... [2024-11-20 05:18:11,192 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:18:11,193 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:18:11,193 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:18:11,193 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:18:11,194 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:18:11" (1/1) ... [2024-11-20 05:18:11,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:18:11,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:18:11,226 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 05:18:11,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 05:18:11,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:18:11,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 05:18:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:18:11,267 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:18:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:18:11,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:18:11,339 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:18:11,340 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:18:39,696 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-20 05:18:39,697 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:18:39,714 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:18:39,716 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:18:39,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:18:39 BoogieIcfgContainer [2024-11-20 05:18:39,717 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:18:39,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:18:39,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:18:39,721 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:18:39,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:18:10" (1/3) ... [2024-11-20 05:18:39,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e36af7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:18:39, skipping insertion in model container [2024-11-20 05:18:39,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:18:11" (2/3) ... [2024-11-20 05:18:39,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e36af7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:18:39, skipping insertion in model container [2024-11-20 05:18:39,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:18:39" (3/3) ... [2024-11-20 05:18:39,725 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-30.i [2024-11-20 05:18:39,738 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:18:39,739 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:18:39,794 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:18:39,801 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;@15952eba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:18:39,803 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:18:39,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 68 states have internal predecessors, (97), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-20 05:18:39,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-20 05:18:39,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:18:39,822 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:18:39,823 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:18:39,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:18:39,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1065562390, now seen corresponding path program 1 times [2024-11-20 05:18:39,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:18:39,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427055013] [2024-11-20 05:18:39,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:18:39,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:18:39,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:18:39,849 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:18:39,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 05:18:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:41,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 05:18:41,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:18:41,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 988 proven. 0 refuted. 0 times theorem prover too weak. 1124 trivial. 0 not checked. [2024-11-20 05:18:41,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:18:41,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:18:41,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427055013] [2024-11-20 05:18:41,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427055013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:18:41,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:18:41,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:18:41,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079021819] [2024-11-20 05:18:41,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:18:41,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:18:41,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:18:41,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:18:41,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:18:41,202 INFO L87 Difference]: Start difference. First operand has 103 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 68 states have internal predecessors, (97), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-20 05:18:41,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:18:41,230 INFO L93 Difference]: Finished difference Result 199 states and 353 transitions. [2024-11-20 05:18:41,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:18:41,231 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 214 [2024-11-20 05:18:41,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:18:41,237 INFO L225 Difference]: With dead ends: 199 [2024-11-20 05:18:41,237 INFO L226 Difference]: Without dead ends: 99 [2024-11-20 05:18:41,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:18:41,245 INFO L432 NwaCegarLoop]: 156 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, 156 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:18:41,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:18:41,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-20 05:18:41,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-20 05:18:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-20 05:18:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 156 transitions. [2024-11-20 05:18:41,281 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 156 transitions. Word has length 214 [2024-11-20 05:18:41,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:18:41,282 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 156 transitions. [2024-11-20 05:18:41,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-20 05:18:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 156 transitions. [2024-11-20 05:18:41,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-20 05:18:41,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:18:41,285 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:18:41,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 05:18:41,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:18:41,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:18:41,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:18:41,487 INFO L85 PathProgramCache]: Analyzing trace with hash 621730508, now seen corresponding path program 1 times [2024-11-20 05:18:41,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:18:41,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423906429] [2024-11-20 05:18:41,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:18:41,489 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:18:41,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:18:41,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:18:41,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 05:18:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:42,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 05:18:42,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:18:43,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-20 05:18:43,337 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:18:43,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:18:43,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423906429] [2024-11-20 05:18:43,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423906429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:18:43,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:18:43,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:18:43,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19061053] [2024-11-20 05:18:43,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:18:43,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:18:43,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:18:43,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:18:43,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:18:43,340 INFO L87 Difference]: Start difference. First operand 99 states and 156 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-20 05:18:47,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:18:48,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:18:48,047 INFO L93 Difference]: Finished difference Result 292 states and 463 transitions. [2024-11-20 05:18:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:18:48,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2024-11-20 05:18:48,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:18:48,053 INFO L225 Difference]: With dead ends: 292 [2024-11-20 05:18:48,053 INFO L226 Difference]: Without dead ends: 196 [2024-11-20 05:18:48,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:18:48,055 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 222 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 68 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-20 05:18:48,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 437 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 8 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2024-11-20 05:18:48,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-20 05:18:48,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2024-11-20 05:18:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 124 states have (on average 1.403225806451613) internal successors, (174), 124 states have internal predecessors, (174), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-20 05:18:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 306 transitions. [2024-11-20 05:18:48,090 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 306 transitions. Word has length 214 [2024-11-20 05:18:48,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:18:48,091 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 306 transitions. [2024-11-20 05:18:48,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-20 05:18:48,091 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 306 transitions. [2024-11-20 05:18:48,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-20 05:18:48,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:18:48,094 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:18:48,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 05:18:48,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:18:48,298 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:18:48,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:18:48,299 INFO L85 PathProgramCache]: Analyzing trace with hash 840585226, now seen corresponding path program 1 times [2024-11-20 05:18:48,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:18:48,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063095946] [2024-11-20 05:18:48,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:18:48,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:18:48,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:18:48,305 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:18:48,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 05:18:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:18:49,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 05:18:49,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:18:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-20 05:18:53,891 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:18:53,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:18:53,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063095946] [2024-11-20 05:18:53,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063095946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:18:53,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:18:53,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:18:53,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915353436] [2024-11-20 05:18:53,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:18:53,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:18:53,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:18:53,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:18:53,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:18:53,897 INFO L87 Difference]: Start difference. First operand 193 states and 306 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-20 05:18:58,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:19:02,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:19:07,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:19:11,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:19:15,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:19:19,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:19:19,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:19:19,200 INFO L93 Difference]: Finished difference Result 448 states and 706 transitions. [2024-11-20 05:19:19,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:19:19,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2024-11-20 05:19:19,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:19:19,205 INFO L225 Difference]: With dead ends: 448 [2024-11-20 05:19:19,205 INFO L226 Difference]: Without dead ends: 258 [2024-11-20 05:19:19,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:19:19,207 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 194 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:19:19,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 480 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 6 Unknown, 0 Unchecked, 25.2s Time] [2024-11-20 05:19:19,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-20 05:19:19,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 99. [2024-11-20 05:19:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-20 05:19:19,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 154 transitions. [2024-11-20 05:19:19,225 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 154 transitions. Word has length 214 [2024-11-20 05:19:19,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:19:19,226 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 154 transitions. [2024-11-20 05:19:19,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-20 05:19:19,226 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 154 transitions. [2024-11-20 05:19:19,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-20 05:19:19,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:19:19,228 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:19:19,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-20 05:19:19,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:19:19,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:19:19,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:19:19,434 INFO L85 PathProgramCache]: Analyzing trace with hash -531483211, now seen corresponding path program 1 times [2024-11-20 05:19:19,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:19:19,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003277716] [2024-11-20 05:19:19,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:19:19,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:19:19,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:19:19,444 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:19:19,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 05:19:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:19:20,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 05:19:20,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:19:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-20 05:19:25,035 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:19:25,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:19:25,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003277716] [2024-11-20 05:19:25,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003277716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:19:25,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:19:25,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:19:25,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943922999] [2024-11-20 05:19:25,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:19:25,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:19:25,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:19:25,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:19:25,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:19:25,038 INFO L87 Difference]: Start difference. First operand 99 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-20 05:19:29,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:19:32,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:19:36,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:19:36,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:19:36,524 INFO L93 Difference]: Finished difference Result 309 states and 484 transitions. [2024-11-20 05:19:36,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:19:36,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 215 [2024-11-20 05:19:36,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:19:36,567 INFO L225 Difference]: With dead ends: 309 [2024-11-20 05:19:36,567 INFO L226 Difference]: Without dead ends: 213 [2024-11-20 05:19:36,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:19:36,569 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 136 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 69 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-11-20 05:19:36,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 456 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 17 Invalid, 2 Unknown, 0 Unchecked, 11.4s Time] [2024-11-20 05:19:36,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-20 05:19:36,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 193. [2024-11-20 05:19:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 124 states have internal predecessors, (169), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-20 05:19:36,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 301 transitions. [2024-11-20 05:19:36,602 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 301 transitions. Word has length 215 [2024-11-20 05:19:36,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:19:36,602 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 301 transitions. [2024-11-20 05:19:36,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-20 05:19:36,603 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 301 transitions. [2024-11-20 05:19:36,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-20 05:19:36,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:19:36,605 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:19:36,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-20 05:19:36,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:19:36,805 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:19:36,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:19:36,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1828519640, now seen corresponding path program 1 times [2024-11-20 05:19:36,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:19:36,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349522474] [2024-11-20 05:19:36,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:19:36,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 05:19:36,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:19:36,810 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:19:36,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 05:19:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:19:38,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 05:19:38,174 INFO L278 TraceCheckSpWp]: Computing forward predicates...