./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_fillercodesize_ps-cn-25_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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_fillercodesize_ps-cn-25_file-42.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 5f62dbdf30439c22b90c0714165751cfb1215bac5efc8ba17b86c401a925f47d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:24:48,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:24:48,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 06:24:48,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:24:48,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:24:48,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:24:48,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:24:48,817 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:24:48,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:24:48,818 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:24:48,818 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:24:48,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:24:48,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:24:48,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:24:48,820 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:24:48,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:24:48,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:24:48,821 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:24:48,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 06:24:48,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:24:48,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:24:48,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:24:48,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:24:48,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:24:48,826 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:24:48,826 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:24:48,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:24:48,826 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:24:48,827 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:24:48,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:24:48,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:24:48,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:24:48,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:24:48,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:24:48,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:24:48,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:24:48,829 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 06:24:48,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 06:24:48,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:24:48,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:24:48,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:24:48,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:24:48,830 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 -> 5f62dbdf30439c22b90c0714165751cfb1215bac5efc8ba17b86c401a925f47d [2024-10-24 06:24:49,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:24:49,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:24:49,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:24:49,167 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:24:49,167 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:24:49,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2024-10-24 06:24:50,759 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:24:51,001 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:24:51,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2024-10-24 06:24:51,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/397715769/7dfa085c03324beababef0477a25e6b7/FLAGc6c83247d [2024-10-24 06:24:51,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/397715769/7dfa085c03324beababef0477a25e6b7 [2024-10-24 06:24:51,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:24:51,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:24:51,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:24:51,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:24:51,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:24:51,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:24:51" (1/1) ... [2024-10-24 06:24:51,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20c0fac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:51, skipping insertion in model container [2024-10-24 06:24:51,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:24:51" (1/1) ... [2024-10-24 06:24:51,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:24:51,301 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i[915,928] [2024-10-24 06:24:51,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:24:51,432 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:24:51,446 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i[915,928] [2024-10-24 06:24:51,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:24:51,521 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:24:51,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:51 WrapperNode [2024-10-24 06:24:51,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:24:51,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:24:51,524 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:24:51,524 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:24:51,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:51" (1/1) ... [2024-10-24 06:24:51,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:51" (1/1) ... [2024-10-24 06:24:51,600 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 225 [2024-10-24 06:24:51,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:24:51,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:24:51,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:24:51,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:24:51,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:51" (1/1) ... [2024-10-24 06:24:51,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:51" (1/1) ... [2024-10-24 06:24:51,622 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:51" (1/1) ... [2024-10-24 06:24:51,656 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-10-24 06:24:51,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:51" (1/1) ... [2024-10-24 06:24:51,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:51" (1/1) ... [2024-10-24 06:24:51,669 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:51" (1/1) ... [2024-10-24 06:24:51,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:51" (1/1) ... [2024-10-24 06:24:51,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:51" (1/1) ... [2024-10-24 06:24:51,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:51" (1/1) ... [2024-10-24 06:24:51,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:24:51,682 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:24:51,683 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:24:51,683 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:24:51,684 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:51" (1/1) ... [2024-10-24 06:24:51,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:24:51,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:24:51,721 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-10-24 06:24:51,728 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-10-24 06:24:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:24:51,773 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:24:51,773 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:24:51,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 06:24:51,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:24:51,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:24:51,855 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:24:51,857 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:24:52,262 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-24 06:24:52,262 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:24:52,321 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:24:52,322 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:24:52,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:24:52 BoogieIcfgContainer [2024-10-24 06:24:52,323 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:24:52,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:24:52,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:24:52,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:24:52,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:24:51" (1/3) ... [2024-10-24 06:24:52,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3683feda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:24:52, skipping insertion in model container [2024-10-24 06:24:52,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:51" (2/3) ... [2024-10-24 06:24:52,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3683feda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:24:52, skipping insertion in model container [2024-10-24 06:24:52,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:24:52" (3/3) ... [2024-10-24 06:24:52,336 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2024-10-24 06:24:52,354 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:24:52,354 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:24:52,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:24:52,426 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;@6d5a7226, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:24:52,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:24:52,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 56 states have internal predecessors, (79), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 06:24:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-24 06:24:52,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:52,454 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:24:52,454 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:52,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:52,461 INFO L85 PathProgramCache]: Analyzing trace with hash 258799246, now seen corresponding path program 1 times [2024-10-24 06:24:52,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:24:52,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429463951] [2024-10-24 06:24:52,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:52,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:24:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:52,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:24:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:52,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:24:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:52,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:24:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:52,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:24:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:52,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:24:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:52,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:24:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:52,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:24:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:52,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:24:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:52,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:24:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:24:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:24:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:24:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:24:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:24:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:24:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:24:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:24:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:24:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:24:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:24:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:24:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:24:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:24:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:24:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 06:24:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:24:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 06:24:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:24:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:24:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:24:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 06:24:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:24:53,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:24:53,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429463951] [2024-10-24 06:24:53,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429463951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:24:53,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:24:53,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:24:53,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231273900] [2024-10-24 06:24:53,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:24:53,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:24:53,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:24:53,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:24:53,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:24:53,236 INFO L87 Difference]: Start difference. First operand has 89 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 56 states have internal predecessors, (79), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 06:24:53,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:53,302 INFO L93 Difference]: Finished difference Result 175 states and 311 transitions. [2024-10-24 06:24:53,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:24:53,308 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 197 [2024-10-24 06:24:53,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:53,318 INFO L225 Difference]: With dead ends: 175 [2024-10-24 06:24:53,319 INFO L226 Difference]: Without dead ends: 87 [2024-10-24 06:24:53,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:24:53,330 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:53,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:24:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-24 06:24:53,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-24 06:24:53,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 06:24:53,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 136 transitions. [2024-10-24 06:24:53,402 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 136 transitions. Word has length 197 [2024-10-24 06:24:53,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:53,404 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 136 transitions. [2024-10-24 06:24:53,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 06:24:53,405 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 136 transitions. [2024-10-24 06:24:53,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-24 06:24:53,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:53,412 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:24:53,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 06:24:53,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:53,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:53,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1884942792, now seen corresponding path program 1 times [2024-10-24 06:24:53,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:24:53,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66894966] [2024-10-24 06:24:53,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:53,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:24:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:24:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:24:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:24:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:24:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:24:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:24:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:24:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:24:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:24:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:24:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:24:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:24:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:24:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:24:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:24:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:24:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:24:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:24:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:24:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:24:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:24:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:24:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:24:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:24:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 06:24:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:24:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 06:24:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:24:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:24:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:24:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 06:24:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:24:54,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:24:54,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66894966] [2024-10-24 06:24:54,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66894966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:24:54,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:24:54,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:24:54,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794860009] [2024-10-24 06:24:54,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:24:54,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:24:54,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:24:54,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:24:54,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:24:54,345 INFO L87 Difference]: Start difference. First operand 87 states and 136 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:24:54,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:54,620 INFO L93 Difference]: Finished difference Result 260 states and 407 transitions. [2024-10-24 06:24:54,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:24:54,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2024-10-24 06:24:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:54,625 INFO L225 Difference]: With dead ends: 260 [2024-10-24 06:24:54,625 INFO L226 Difference]: Without dead ends: 174 [2024-10-24 06:24:54,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:24:54,627 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 109 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:54,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 393 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:24:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-24 06:24:54,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 154. [2024-10-24 06:24:54,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 89 states have internal predecessors, (117), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 06:24:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 241 transitions. [2024-10-24 06:24:54,664 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 241 transitions. Word has length 197 [2024-10-24 06:24:54,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:54,665 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 241 transitions. [2024-10-24 06:24:54,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:24:54,666 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 241 transitions. [2024-10-24 06:24:54,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-24 06:24:54,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:54,669 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:24:54,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 06:24:54,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:54,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:54,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1930462375, now seen corresponding path program 1 times [2024-10-24 06:24:54,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:24:54,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030217491] [2024-10-24 06:24:54,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:54,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:24:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:24:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:24:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:24:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:24:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:24:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:24:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:24:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:24:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:24:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:24:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:24:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:24:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:24:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:24:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:24:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:24:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:24:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:24:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:24:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:24:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:24:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:24:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:24:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:24:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 06:24:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:24:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 06:24:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:24:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:24:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:24:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 06:24:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:55,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:24:55,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:24:55,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030217491] [2024-10-24 06:24:55,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030217491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:24:55,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:24:55,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:24:55,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566575154] [2024-10-24 06:24:55,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:24:55,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:24:55,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:24:55,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:24:55,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:24:55,285 INFO L87 Difference]: Start difference. First operand 154 states and 241 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:24:55,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:55,694 INFO L93 Difference]: Finished difference Result 369 states and 577 transitions. [2024-10-24 06:24:55,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 06:24:55,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2024-10-24 06:24:55,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:55,701 INFO L225 Difference]: With dead ends: 369 [2024-10-24 06:24:55,701 INFO L226 Difference]: Without dead ends: 283 [2024-10-24 06:24:55,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 06:24:55,703 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 138 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:55,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 516 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 06:24:55,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-24 06:24:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 238. [2024-10-24 06:24:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 141 states have (on average 1.3333333333333333) internal successors, (188), 141 states have internal predecessors, (188), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-10-24 06:24:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 374 transitions. [2024-10-24 06:24:55,760 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 374 transitions. Word has length 198 [2024-10-24 06:24:55,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:55,761 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 374 transitions. [2024-10-24 06:24:55,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:24:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 374 transitions. [2024-10-24 06:24:55,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-24 06:24:55,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:55,765 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:24:55,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 06:24:55,765 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:55,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:55,766 INFO L85 PathProgramCache]: Analyzing trace with hash 919345125, now seen corresponding path program 1 times [2024-10-24 06:24:55,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:24:55,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983153480] [2024-10-24 06:24:55,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:55,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:24:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:24:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:24:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:24:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:24:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:24:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:24:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:24:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:24:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:24:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:24:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:24:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:24:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:24:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:24:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:24:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:24:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:24:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:24:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:24:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:24:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:24:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:24:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:24:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:24:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 06:24:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:24:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 06:24:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:24:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:24:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:24:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 06:24:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:24:56,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:24:56,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983153480] [2024-10-24 06:24:56,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983153480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:24:56,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:24:56,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:24:56,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298798410] [2024-10-24 06:24:56,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:24:56,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:24:56,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:24:56,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:24:56,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:24:56,099 INFO L87 Difference]: Start difference. First operand 238 states and 374 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:24:56,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:56,174 INFO L93 Difference]: Finished difference Result 548 states and 857 transitions. [2024-10-24 06:24:56,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:24:56,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2024-10-24 06:24:56,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:56,179 INFO L225 Difference]: With dead ends: 548 [2024-10-24 06:24:56,179 INFO L226 Difference]: Without dead ends: 376 [2024-10-24 06:24:56,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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-10-24 06:24:56,181 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 100 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:56,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 251 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:24:56,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-10-24 06:24:56,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 372. [2024-10-24 06:24:56,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 222 states have (on average 1.3288288288288288) internal successors, (295), 224 states have internal predecessors, (295), 143 states have call successors, (143), 6 states have call predecessors, (143), 6 states have return successors, (143), 141 states have call predecessors, (143), 143 states have call successors, (143) [2024-10-24 06:24:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 581 transitions. [2024-10-24 06:24:56,268 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 581 transitions. Word has length 198 [2024-10-24 06:24:56,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:56,269 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 581 transitions. [2024-10-24 06:24:56,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:24:56,271 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 581 transitions. [2024-10-24 06:24:56,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-24 06:24:56,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:56,274 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:24:56,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 06:24:56,275 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:56,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:56,275 INFO L85 PathProgramCache]: Analyzing trace with hash -669002777, now seen corresponding path program 1 times [2024-10-24 06:24:56,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:24:56,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212933388] [2024-10-24 06:24:56,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:56,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:24:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:24:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:24:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:24:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:24:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:24:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:24:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:24:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:24:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:24:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:24:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:24:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:24:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:24:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:24:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:24:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:24:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:24:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:24:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:24:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:24:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:24:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:24:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:24:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:24:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 06:24:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:24:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 06:24:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:24:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:24:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:24:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 06:24:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 51 proven. 123 refuted. 0 times theorem prover too weak. 1686 trivial. 0 not checked. [2024-10-24 06:24:57,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:24:57,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212933388] [2024-10-24 06:24:57,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212933388] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:24:57,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295371600] [2024-10-24 06:24:57,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:57,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:24:57,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:24:57,238 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-10-24 06:24:57,240 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-10-24 06:24:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:57,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 06:24:57,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:24:58,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 947 proven. 123 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2024-10-24 06:24:58,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:24:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 51 proven. 126 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2024-10-24 06:24:58,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295371600] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:24:58,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 06:24:58,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-10-24 06:24:58,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989151639] [2024-10-24 06:24:58,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 06:24:58,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 06:24:58,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:24:58,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 06:24:58,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-10-24 06:24:58,977 INFO L87 Difference]: Start difference. First operand 372 states and 581 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2024-10-24 06:25:00,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:25:00,371 INFO L93 Difference]: Finished difference Result 1138 states and 1678 transitions. [2024-10-24 06:25:00,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-24 06:25:00,372 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) Word has length 198 [2024-10-24 06:25:00,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:25:00,385 INFO L225 Difference]: With dead ends: 1138 [2024-10-24 06:25:00,386 INFO L226 Difference]: Without dead ends: 989 [2024-10-24 06:25:00,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 452 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2024-10-24 06:25:00,391 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 518 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 06:25:00,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 681 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 06:25:00,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2024-10-24 06:25:00,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 593. [2024-10-24 06:25:00,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 371 states have (on average 1.3018867924528301) internal successors, (483), 374 states have internal predecessors, (483), 199 states have call successors, (199), 22 states have call predecessors, (199), 22 states have return successors, (199), 196 states have call predecessors, (199), 199 states have call successors, (199) [2024-10-24 06:25:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 881 transitions. [2024-10-24 06:25:00,561 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 881 transitions. Word has length 198 [2024-10-24 06:25:00,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:25:00,564 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 881 transitions. [2024-10-24 06:25:00,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2024-10-24 06:25:00,565 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 881 transitions. [2024-10-24 06:25:00,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-24 06:25:00,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:25:00,568 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:25:00,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 06:25:00,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:25:00,769 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:25:00,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:25:00,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1255808791, now seen corresponding path program 1 times [2024-10-24 06:25:00,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:25:00,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671943627] [2024-10-24 06:25:00,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:25:00,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:25:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 06:25:00,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1105235430] [2024-10-24 06:25:00,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:25:00,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:25:00,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:25:00,885 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:25:00,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 06:25:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:25:01,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 06:25:01,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:25:02,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 288 proven. 162 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-10-24 06:25:02,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:25:03,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:25:03,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671943627] [2024-10-24 06:25:03,179 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 06:25:03,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105235430] [2024-10-24 06:25:03,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105235430] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:25:03,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-24 06:25:03,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-10-24 06:25:03,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563349396] [2024-10-24 06:25:03,180 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-24 06:25:03,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 06:25:03,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:25:03,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 06:25:03,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=237, Unknown=6, NotChecked=0, Total=342 [2024-10-24 06:25:03,181 INFO L87 Difference]: Start difference. First operand 593 states and 881 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-24 06:25:04,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:25:04,187 INFO L93 Difference]: Finished difference Result 1722 states and 2480 transitions. [2024-10-24 06:25:04,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 06:25:04,188 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 198 [2024-10-24 06:25:04,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:25:04,201 INFO L225 Difference]: With dead ends: 1722 [2024-10-24 06:25:04,201 INFO L226 Difference]: Without dead ends: 1396 [2024-10-24 06:25:04,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=324, Invalid=726, Unknown=6, NotChecked=0, Total=1056 [2024-10-24 06:25:04,207 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 163 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 06:25:04,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 902 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 06:25:04,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2024-10-24 06:25:04,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1226. [2024-10-24 06:25:04,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 792 states have (on average 1.2916666666666667) internal successors, (1023), 802 states have internal predecessors, (1023), 375 states have call successors, (375), 58 states have call predecessors, (375), 58 states have return successors, (375), 365 states have call predecessors, (375), 375 states have call successors, (375) [2024-10-24 06:25:04,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1773 transitions. [2024-10-24 06:25:04,431 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1773 transitions. Word has length 198 [2024-10-24 06:25:04,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:25:04,432 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1773 transitions. [2024-10-24 06:25:04,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-24 06:25:04,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1773 transitions. [2024-10-24 06:25:04,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-24 06:25:04,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:25:04,435 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:25:04,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 06:25:04,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 06:25:04,636 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:25:04,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:25:04,637 INFO L85 PathProgramCache]: Analyzing trace with hash -997643353, now seen corresponding path program 1 times [2024-10-24 06:25:04,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:25:04,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687388533] [2024-10-24 06:25:04,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:25:04,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:25:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 06:25:04,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [810103909] [2024-10-24 06:25:04,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:25:04,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:25:04,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:25:04,750 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:25:04,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 06:25:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:25:04,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 06:25:04,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:25:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2024-10-24 06:25:07,040 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:25:07,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:25:07,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687388533] [2024-10-24 06:25:07,738 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 06:25:07,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810103909] [2024-10-24 06:25:07,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810103909] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:25:07,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-24 06:25:07,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-10-24 06:25:07,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832975330] [2024-10-24 06:25:07,740 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-24 06:25:07,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 06:25:07,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:25:07,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 06:25:07,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=1, NotChecked=0, Total=210 [2024-10-24 06:25:07,742 INFO L87 Difference]: Start difference. First operand 1226 states and 1773 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 06:25:08,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:25:08,934 INFO L93 Difference]: Finished difference Result 2351 states and 3406 transitions. [2024-10-24 06:25:08,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 06:25:08,935 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 198 [2024-10-24 06:25:08,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:25:08,954 INFO L225 Difference]: With dead ends: 2351 [2024-10-24 06:25:08,955 INFO L226 Difference]: Without dead ends: 1854 [2024-10-24 06:25:08,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=466, Unknown=1, NotChecked=0, Total=650 [2024-10-24 06:25:08,961 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 134 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 74 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 06:25:08,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 949 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 630 Invalid, 6 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 06:25:08,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2024-10-24 06:25:09,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1582. [2024-10-24 06:25:09,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1016 states have (on average 1.280511811023622) internal successors, (1301), 1028 states have internal predecessors, (1301), 487 states have call successors, (487), 78 states have call predecessors, (487), 78 states have return successors, (487), 475 states have call predecessors, (487), 487 states have call successors, (487) [2024-10-24 06:25:09,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2275 transitions. [2024-10-24 06:25:09,295 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2275 transitions. Word has length 198 [2024-10-24 06:25:09,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:25:09,296 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2275 transitions. [2024-10-24 06:25:09,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 06:25:09,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2275 transitions. [2024-10-24 06:25:09,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-24 06:25:09,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:25:09,300 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:25:09,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 06:25:09,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:25:09,501 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:25:09,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:25:09,502 INFO L85 PathProgramCache]: Analyzing trace with hash 914456943, now seen corresponding path program 1 times [2024-10-24 06:25:09,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:25:09,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963600633] [2024-10-24 06:25:09,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:25:09,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:25:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 06:25:09,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [487561393] [2024-10-24 06:25:09,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:25:09,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:25:09,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:25:09,659 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:25:09,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 06:25:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:25:09,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 06:25:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:25:10,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 06:25:10,064 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 06:25:10,065 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 06:25:10,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 06:25:10,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:25:10,271 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:25:10,417 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 06:25:10,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:25:10 BoogieIcfgContainer [2024-10-24 06:25:10,421 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 06:25:10,421 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 06:25:10,421 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 06:25:10,422 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 06:25:10,422 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:24:52" (3/4) ... [2024-10-24 06:25:10,424 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 06:25:10,426 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 06:25:10,426 INFO L158 Benchmark]: Toolchain (without parser) took 19354.88ms. Allocated memory was 167.8MB in the beginning and 398.5MB in the end (delta: 230.7MB). Free memory was 137.5MB in the beginning and 232.3MB in the end (delta: -94.8MB). Peak memory consumption was 135.6MB. Max. memory is 16.1GB. [2024-10-24 06:25:10,426 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory was 140.9MB in the beginning and 140.7MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:25:10,427 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.83ms. Allocated memory is still 167.8MB. Free memory was 137.5MB in the beginning and 120.5MB in the end (delta: 17.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 06:25:10,427 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.71ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 116.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:25:10,427 INFO L158 Benchmark]: Boogie Preprocessor took 80.23ms. Allocated memory is still 167.8MB. Free memory was 116.3MB in the beginning and 110.0MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:25:10,427 INFO L158 Benchmark]: RCFGBuilder took 640.42ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 80.0MB in the end (delta: 30.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-24 06:25:10,428 INFO L158 Benchmark]: TraceAbstraction took 18093.66ms. Allocated memory was 167.8MB in the beginning and 398.5MB in the end (delta: 230.7MB). Free memory was 78.8MB in the beginning and 232.3MB in the end (delta: -153.5MB). Peak memory consumption was 79.0MB. Max. memory is 16.1GB. [2024-10-24 06:25:10,428 INFO L158 Benchmark]: Witness Printer took 4.47ms. Allocated memory is still 398.5MB. Free memory is still 232.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:25:10,429 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.17ms. Allocated memory is still 167.8MB. Free memory was 140.9MB in the beginning and 140.7MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.83ms. Allocated memory is still 167.8MB. Free memory was 137.5MB in the beginning and 120.5MB in the end (delta: 17.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.71ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 116.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.23ms. Allocated memory is still 167.8MB. Free memory was 116.3MB in the beginning and 110.0MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 640.42ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 80.0MB in the end (delta: 30.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18093.66ms. Allocated memory was 167.8MB in the beginning and 398.5MB in the end (delta: 230.7MB). Free memory was 78.8MB in the beginning and 232.3MB in the end (delta: -153.5MB). Peak memory consumption was 79.0MB. Max. memory is 16.1GB. * Witness Printer took 4.47ms. Allocated memory is still 398.5MB. Free memory is still 232.3MB. 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 186, overapproximation of someUnaryDOUBLEoperation at line 30, overapproximation of someBinaryArithmeticFLOAToperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 0; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 1; [L39] signed short int var_1_24 = -32; [L40] unsigned char var_1_25 = 1; [L41] float var_1_26 = 500.65; [L42] signed long int var_1_27 = -8; [L43] unsigned long int var_1_28 = 10; [L44] signed short int var_1_29 = -256; [L45] signed char var_1_30 = 1; [L46] float var_1_31 = 7.8; [L47] float var_1_32 = 63.25; [L48] float var_1_33 = 0.4; [L49] float var_1_34 = 64.875; [L50] float var_1_35 = 1.3; [L51] unsigned short int var_1_36 = 100; [L52] signed short int last_1_var_1_1 = 16; [L53] unsigned char last_1_var_1_6 = 10; [L54] unsigned char last_1_var_1_8 = 1; [L55] signed short int last_1_var_1_13 = 200; [L190] isInitial = 1 [L191] FCALL initially() [L192] COND TRUE 1 [L193] CALL updateLastVariables() [L180] last_1_var_1_1 = var_1_1 [L181] last_1_var_1_6 = var_1_6 [L182] last_1_var_1_8 = var_1_8 [L183] last_1_var_1_13 = var_1_13 [L193] RET updateLastVariables() [L194] CALL updateVariables() [L129] var_1_5 = __VERIFIER_nondet_char() [L130] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=128, var_1_8=1] [L130] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=128, var_1_8=1] [L131] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=128, var_1_8=1] [L131] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=128, var_1_8=1] [L132] var_1_7 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L133] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L134] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L134] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L135] var_1_11 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L136] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L137] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L137] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L138] var_1_12 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L139] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L140] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L140] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L141] var_1_15 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L142] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L143] var_1_16 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L144] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L145] var_1_20 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L146] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L147] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L147] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L148] var_1_22 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L149] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L150] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L150] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L151] var_1_23 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L152] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L153] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L153] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L154] var_1_24 = __VERIFIER_nondet_short() [L155] CALL assume_abort_if_not(var_1_24 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L155] RET assume_abort_if_not(var_1_24 >= -32768) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L156] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L156] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L157] var_1_25 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L158] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L159] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L159] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L160] var_1_27 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_27 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L161] RET assume_abort_if_not(var_1_27 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L162] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L162] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L163] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L163] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L164] var_1_29 = __VERIFIER_nondet_short() [L165] CALL assume_abort_if_not(var_1_29 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L165] RET assume_abort_if_not(var_1_29 >= -32768) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L166] CALL assume_abort_if_not(var_1_29 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L166] RET assume_abort_if_not(var_1_29 <= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L167] var_1_30 = __VERIFIER_nondet_char() [L168] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L168] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L169] CALL assume_abort_if_not(var_1_30 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L169] RET assume_abort_if_not(var_1_30 <= 16) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L170] var_1_32 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L171] RET assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L172] var_1_33 = __VERIFIER_nondet_float() [L173] CALL assume_abort_if_not((var_1_33 >= -461168.6018427382800e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 4611686.018427382800e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L173] RET assume_abort_if_not((var_1_33 >= -461168.6018427382800e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 4611686.018427382800e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L174] var_1_34 = __VERIFIER_nondet_float() [L175] CALL assume_abort_if_not((var_1_34 >= -461168.6018427382800e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 4611686.018427382800e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L175] RET assume_abort_if_not((var_1_34 >= -461168.6018427382800e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 4611686.018427382800e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L176] var_1_35 = __VERIFIER_nondet_float() [L177] CALL assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L177] RET assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L194] RET updateVariables() [L195] CALL step() [L59] COND TRUE var_1_22 || var_1_23 [L60] var_1_21 = ((var_1_24 > -4) || var_1_25) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L62] COND TRUE ((var_1_24 + 25) % var_1_27) < 2 [L63] var_1_26 = 8.5f VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L65] EXPR var_1_29 >> var_1_30 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L65] EXPR ((var_1_27) > ((var_1_29 >> var_1_30))) ? (var_1_27) : ((var_1_29 >> var_1_30)) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L65] COND TRUE var_1_24 > ((((var_1_27) > ((var_1_29 >> var_1_30))) ? (var_1_27) : ((var_1_29 >> var_1_30)))) [L66] var_1_28 = var_1_30 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L68] COND TRUE var_1_27 > var_1_28 [L69] var_1_31 = (((((var_1_32 + ((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))))) > (var_1_35)) ? ((var_1_32 + ((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))))) : (var_1_35))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L73] COND FALSE !(((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) < var_1_30) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L76] signed long int stepLocal_6 = last_1_var_1_1; [L77] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L78] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L79] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L82] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L87] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L90] COND TRUE var_1_5 >= -2 [L91] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L93] unsigned char stepLocal_4 = var_1_6; [L94] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=27, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L95] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=27, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L96] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L97] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L104] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=27, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L105] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L108] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=27, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L109] COND TRUE \read(var_1_19) [L110] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=27, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=27, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L116] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L117] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=27, stepLocal_1=383, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=27, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L118] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L125] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=27, stepLocal_1=383, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=27, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=0] [L195] RET step() [L196] CALL, EXPR property() [L186-L187] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; [L196] RET, EXPR property() [L196] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=27, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=27, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.9s, OverallIterations: 8, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 1195 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1162 mSDsluCounter, 3825 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2823 mSDsCounter, 590 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2037 IncrementalHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 590 mSolverCounterUnsat, 1002 mSDtfsCounter, 2037 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1580 GetRequests, 1468 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1582occurred in iteration=7, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 7 MinimizatonAttempts, 907 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 2376 NumberOfCodeBlocks, 2376 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1771 ConstructedInterpolants, 1 QuantifiedInterpolants, 10639 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1380 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 16122/16740 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-10-24 06:25:10,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.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 5f62dbdf30439c22b90c0714165751cfb1215bac5efc8ba17b86c401a925f47d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:25:12,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:25:13,047 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 06:25:13,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:25:13,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:25:13,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:25:13,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:25:13,094 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:25:13,095 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:25:13,096 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:25:13,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:25:13,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:25:13,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:25:13,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:25:13,102 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:25:13,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:25:13,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:25:13,103 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:25:13,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:25:13,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:25:13,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:25:13,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:25:13,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:25:13,106 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 06:25:13,107 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 06:25:13,107 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:25:13,107 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 06:25:13,108 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:25:13,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:25:13,108 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:25:13,108 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:25:13,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:25:13,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:25:13,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:25:13,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:25:13,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:25:13,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:25:13,111 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:25:13,111 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 06:25:13,112 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 06:25:13,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:25:13,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:25:13,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:25:13,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:25:13,113 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 06:25:13,113 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 -> 5f62dbdf30439c22b90c0714165751cfb1215bac5efc8ba17b86c401a925f47d [2024-10-24 06:25:13,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:25:13,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:25:13,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:25:13,540 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:25:13,541 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:25:13,543 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2024-10-24 06:25:15,222 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:25:15,524 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:25:15,525 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2024-10-24 06:25:15,543 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c32c6da8/07220192b17b44aaaffa35a56c439ba7/FLAG05f466590 [2024-10-24 06:25:15,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c32c6da8/07220192b17b44aaaffa35a56c439ba7 [2024-10-24 06:25:15,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:25:15,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:25:15,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:25:15,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:25:15,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:25:15,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:25:15" (1/1) ... [2024-10-24 06:25:15,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fdb6ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:25:15, skipping insertion in model container [2024-10-24 06:25:15,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:25:15" (1/1) ... [2024-10-24 06:25:15,880 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:25:16,083 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i[915,928] [2024-10-24 06:25:16,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:25:16,205 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:25:16,219 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i[915,928] [2024-10-24 06:25:16,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:25:16,307 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:25:16,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:25:16 WrapperNode [2024-10-24 06:25:16,308 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:25:16,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:25:16,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:25:16,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:25:16,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:25:16" (1/1) ... [2024-10-24 06:25:16,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:25:16" (1/1) ... [2024-10-24 06:25:16,409 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-10-24 06:25:16,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:25:16,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:25:16,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:25:16,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:25:16,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:25:16" (1/1) ... [2024-10-24 06:25:16,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:25:16" (1/1) ... [2024-10-24 06:25:16,431 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:25:16" (1/1) ... [2024-10-24 06:25:16,459 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-10-24 06:25:16,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:25:16" (1/1) ... [2024-10-24 06:25:16,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:25:16" (1/1) ... [2024-10-24 06:25:16,476 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:25:16" (1/1) ... [2024-10-24 06:25:16,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:25:16" (1/1) ... [2024-10-24 06:25:16,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:25:16" (1/1) ... [2024-10-24 06:25:16,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:25:16" (1/1) ... [2024-10-24 06:25:16,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:25:16,500 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:25:16,500 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:25:16,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:25:16,501 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:25:16" (1/1) ... [2024-10-24 06:25:16,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:25:16,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:25:16,540 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-10-24 06:25:16,546 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-10-24 06:25:16,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:25:16,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 06:25:16,600 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:25:16,600 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:25:16,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:25:16,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:25:16,737 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:25:16,739 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:25:17,535 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-24 06:25:17,535 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:25:17,618 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:25:17,619 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:25:17,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:25:17 BoogieIcfgContainer [2024-10-24 06:25:17,619 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:25:17,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:25:17,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:25:17,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:25:17,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:25:15" (1/3) ... [2024-10-24 06:25:17,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448094e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:25:17, skipping insertion in model container [2024-10-24 06:25:17,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:25:16" (2/3) ... [2024-10-24 06:25:17,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448094e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:25:17, skipping insertion in model container [2024-10-24 06:25:17,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:25:17" (3/3) ... [2024-10-24 06:25:17,634 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2024-10-24 06:25:17,654 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:25:17,655 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:25:17,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:25:17,744 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;@73d298dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:25:17,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:25:17,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 50 states have internal predecessors, (70), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 06:25:17,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-24 06:25:17,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:25:17,773 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:25:17,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:25:17,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:25:17,781 INFO L85 PathProgramCache]: Analyzing trace with hash 135550756, now seen corresponding path program 1 times [2024-10-24 06:25:17,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:25:17,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561199713] [2024-10-24 06:25:17,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:25:17,800 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-10-24 06:25:17,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:25:17,803 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-10-24 06:25:17,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 06:25:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:25:18,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 06:25:18,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:25:18,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 587 proven. 24 refuted. 0 times theorem prover too weak. 1249 trivial. 0 not checked. [2024-10-24 06:25:18,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:25:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:25:19,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:25:19,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561199713] [2024-10-24 06:25:19,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561199713] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 06:25:19,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 06:25:19,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 06:25:19,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238464634] [2024-10-24 06:25:19,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:25:19,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:25:19,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:25:19,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:25:19,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-24 06:25:19,231 INFO L87 Difference]: Start difference. First operand has 83 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 50 states have internal predecessors, (70), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:25:19,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:25:19,620 INFO L93 Difference]: Finished difference Result 229 states and 425 transitions. [2024-10-24 06:25:19,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:25:19,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 195 [2024-10-24 06:25:19,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:25:19,635 INFO L225 Difference]: With dead ends: 229 [2024-10-24 06:25:19,635 INFO L226 Difference]: Without dead ends: 147 [2024-10-24 06:25:19,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-24 06:25:19,643 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 100 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 06:25:19,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 236 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 06:25:19,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-24 06:25:19,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2024-10-24 06:25:19,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 86 states have internal predecessors, (115), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-24 06:25:19,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 227 transitions. [2024-10-24 06:25:19,725 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 227 transitions. Word has length 195 [2024-10-24 06:25:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:25:19,727 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 227 transitions. [2024-10-24 06:25:19,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:25:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 227 transitions. [2024-10-24 06:25:19,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-24 06:25:19,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:25:19,736 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:25:19,765 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-10-24 06:25:19,943 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-10-24 06:25:19,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:25:19,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:25:19,944 INFO L85 PathProgramCache]: Analyzing trace with hash -885517598, now seen corresponding path program 1 times [2024-10-24 06:25:19,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:25:19,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060636796] [2024-10-24 06:25:19,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:25:19,946 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-10-24 06:25:19,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:25:19,948 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-10-24 06:25:19,949 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-10-24 06:25:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:25:20,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 06:25:20,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:25:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:25:20,853 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:25:20,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:25:20,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060636796] [2024-10-24 06:25:20,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060636796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:25:20,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:25:20,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:25:20,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692381836] [2024-10-24 06:25:20,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:25:20,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:25:20,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:25:20,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:25:20,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:25:20,860 INFO L87 Difference]: Start difference. First operand 144 states and 227 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:25:21,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:25:21,414 INFO L93 Difference]: Finished difference Result 394 states and 618 transitions. [2024-10-24 06:25:21,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:25:21,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 195 [2024-10-24 06:25:21,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:25:21,430 INFO L225 Difference]: With dead ends: 394 [2024-10-24 06:25:21,432 INFO L226 Difference]: Without dead ends: 251 [2024-10-24 06:25:21,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 192 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-10-24 06:25:21,436 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 90 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 06:25:21,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 366 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 06:25:21,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-24 06:25:21,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 213. [2024-10-24 06:25:21,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 122 states have internal predecessors, (157), 87 states have call successors, (87), 4 states have call predecessors, (87), 4 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-24 06:25:21,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 331 transitions. [2024-10-24 06:25:21,488 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 331 transitions. Word has length 195 [2024-10-24 06:25:21,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:25:21,489 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 331 transitions. [2024-10-24 06:25:21,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:25:21,489 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 331 transitions. [2024-10-24 06:25:21,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 06:25:21,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:25:21,492 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:25:21,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 06:25:21,693 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-10-24 06:25:21,694 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:25:21,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:25:21,694 INFO L85 PathProgramCache]: Analyzing trace with hash -435714880, now seen corresponding path program 1 times [2024-10-24 06:25:21,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:25:21,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764225248] [2024-10-24 06:25:21,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:25:21,696 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-10-24 06:25:21,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:25:21,698 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-10-24 06:25:21,699 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-10-24 06:25:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:25:22,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 06:25:22,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:25:23,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:25:23,023 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:25:23,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:25:23,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764225248] [2024-10-24 06:25:23,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764225248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:25:23,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:25:23,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:25:23,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608579022] [2024-10-24 06:25:23,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:25:23,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:25:23,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:25:23,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:25:23,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:25:23,026 INFO L87 Difference]: Start difference. First operand 213 states and 331 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:25:23,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:25:23,937 INFO L93 Difference]: Finished difference Result 583 states and 914 transitions. [2024-10-24 06:25:23,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 06:25:23,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-24 06:25:23,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:25:23,951 INFO L225 Difference]: With dead ends: 583 [2024-10-24 06:25:23,951 INFO L226 Difference]: Without dead ends: 440 [2024-10-24 06:25:23,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 06:25:23,953 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 119 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 06:25:23,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 480 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 06:25:23,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-24 06:25:24,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 354. [2024-10-24 06:25:24,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 204 states have (on average 1.3137254901960784) internal successors, (268), 206 states have internal predecessors, (268), 143 states have call successors, (143), 6 states have call predecessors, (143), 6 states have return successors, (143), 141 states have call predecessors, (143), 143 states have call successors, (143) [2024-10-24 06:25:24,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 554 transitions. [2024-10-24 06:25:24,069 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 554 transitions. Word has length 196 [2024-10-24 06:25:24,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:25:24,072 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 554 transitions. [2024-10-24 06:25:24,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:25:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 554 transitions. [2024-10-24 06:25:24,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 06:25:24,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:25:24,077 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:25:24,097 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-10-24 06:25:24,277 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-10-24 06:25:24,278 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:25:24,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:25:24,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1446832130, now seen corresponding path program 1 times [2024-10-24 06:25:24,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:25:24,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460059896] [2024-10-24 06:25:24,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:25:24,280 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-10-24 06:25:24,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:25:24,283 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-10-24 06:25:24,285 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-10-24 06:25:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:25:24,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 06:25:24,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:25:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:25:24,723 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:25:24,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:25:24,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460059896] [2024-10-24 06:25:24,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [460059896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:25:24,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:25:24,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:25:24,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257052198] [2024-10-24 06:25:24,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:25:24,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:25:24,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:25:24,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:25:24,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:25:24,729 INFO L87 Difference]: Start difference. First operand 354 states and 554 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:25:24,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:25:24,907 INFO L93 Difference]: Finished difference Result 638 states and 1003 transitions. [2024-10-24 06:25:24,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:25:24,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-24 06:25:24,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:25:24,922 INFO L225 Difference]: With dead ends: 638 [2024-10-24 06:25:24,922 INFO L226 Difference]: Without dead ends: 354 [2024-10-24 06:25:24,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 194 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-10-24 06:25:24,926 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:25:24,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:25:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-24 06:25:24,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-10-24 06:25:24,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 204 states have (on average 1.2941176470588236) internal successors, (264), 206 states have internal predecessors, (264), 143 states have call successors, (143), 6 states have call predecessors, (143), 6 states have return successors, (143), 141 states have call predecessors, (143), 143 states have call successors, (143) [2024-10-24 06:25:24,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 550 transitions. [2024-10-24 06:25:24,993 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 550 transitions. Word has length 196 [2024-10-24 06:25:24,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:25:24,996 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 550 transitions. [2024-10-24 06:25:24,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:25:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 550 transitions. [2024-10-24 06:25:24,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 06:25:25,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:25:25,001 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:25:25,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 06:25:25,201 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-10-24 06:25:25,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:25:25,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:25:25,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2038788540, now seen corresponding path program 1 times [2024-10-24 06:25:25,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:25:25,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307585786] [2024-10-24 06:25:25,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:25:25,204 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-10-24 06:25:25,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:25:25,209 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-10-24 06:25:25,211 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-10-24 06:25:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:25:25,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 06:25:25,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:25:26,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2024-10-24 06:25:26,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:25:26,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:25:26,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307585786] [2024-10-24 06:25:26,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307585786] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:25:26,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1669181052] [2024-10-24 06:25:26,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:25:26,968 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 06:25:26,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 06:25:26,975 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 06:25:26,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-24 06:25:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:25:27,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 06:25:27,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:25:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:25:28,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:25:28,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1669181052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:25:28,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 06:25:28,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-10-24 06:25:28,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595686224] [2024-10-24 06:25:28,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:25:28,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 06:25:28,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:25:28,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 06:25:28,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-24 06:25:28,546 INFO L87 Difference]: Start difference. First operand 354 states and 550 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:25:30,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:25:30,859 INFO L93 Difference]: Finished difference Result 903 states and 1384 transitions. [2024-10-24 06:25:30,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 06:25:30,867 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-24 06:25:30,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:25:30,874 INFO L225 Difference]: With dead ends: 903 [2024-10-24 06:25:30,878 INFO L226 Difference]: Without dead ends: 760 [2024-10-24 06:25:30,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-24 06:25:30,883 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 154 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 06:25:30,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 509 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 06:25:30,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-10-24 06:25:30,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 678. [2024-10-24 06:25:30,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 406 states have (on average 1.3103448275862069) internal successors, (532), 412 states have internal predecessors, (532), 259 states have call successors, (259), 12 states have call predecessors, (259), 12 states have return successors, (259), 253 states have call predecessors, (259), 259 states have call successors, (259) [2024-10-24 06:25:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1050 transitions. [2024-10-24 06:25:30,990 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1050 transitions. Word has length 196 [2024-10-24 06:25:30,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:25:30,991 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 1050 transitions. [2024-10-24 06:25:30,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:25:30,992 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1050 transitions. [2024-10-24 06:25:30,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 06:25:30,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:25:30,994 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:25:31,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-10-24 06:25:31,209 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 (6)] Forceful destruction successful, exit code 0 [2024-10-24 06:25:31,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:25:31,396 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:25:31,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:25:31,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1998013318, now seen corresponding path program 1 times [2024-10-24 06:25:31,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:25:31,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442223112] [2024-10-24 06:25:31,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:25:31,398 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-10-24 06:25:31,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:25:31,399 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:25:31,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 06:25:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:25:31,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 06:25:31,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:25:32,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2024-10-24 06:25:32,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:25:32,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:25:32,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442223112] [2024-10-24 06:25:32,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442223112] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:25:32,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [27383339] [2024-10-24 06:25:32,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:25:32,935 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 06:25:32,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 06:25:32,938 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 06:25:32,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-10-24 06:25:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:25:33,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 06:25:33,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:25:34,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:25:34,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:25:34,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [27383339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:25:34,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 06:25:34,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-10-24 06:25:34,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835408909] [2024-10-24 06:25:34,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:25:34,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:25:34,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:25:34,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:25:34,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-24 06:25:34,794 INFO L87 Difference]: Start difference. First operand 678 states and 1050 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:25:36,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:25:36,577 INFO L93 Difference]: Finished difference Result 1155 states and 1788 transitions. [2024-10-24 06:25:36,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:25:36,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-24 06:25:36,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:25:36,584 INFO L225 Difference]: With dead ends: 1155 [2024-10-24 06:25:36,584 INFO L226 Difference]: Without dead ends: 871 [2024-10-24 06:25:36,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-24 06:25:36,587 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 105 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 06:25:36,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 437 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 06:25:36,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-10-24 06:25:36,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2024-10-24 06:25:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 489 states have (on average 1.3067484662576687) internal successors, (639), 496 states have internal predecessors, (639), 315 states have call successors, (315), 14 states have call predecessors, (315), 14 states have return successors, (315), 308 states have call predecessors, (315), 315 states have call successors, (315) [2024-10-24 06:25:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1269 transitions. [2024-10-24 06:25:36,685 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1269 transitions. Word has length 196 [2024-10-24 06:25:36,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:25:36,688 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1269 transitions. [2024-10-24 06:25:36,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:25:36,688 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1269 transitions. [2024-10-24 06:25:36,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-24 06:25:36,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:25:36,690 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:25:36,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2024-10-24 06:25:36,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-24 06:25:37,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:25:37,092 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:25:37,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:25:37,093 INFO L85 PathProgramCache]: Analyzing trace with hash -425267931, now seen corresponding path program 1 times [2024-10-24 06:25:37,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:25:37,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951847839] [2024-10-24 06:25:37,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:25:37,094 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-10-24 06:25:37,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:25:37,097 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:25:37,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 06:25:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:25:37,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 06:25:37,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:25:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2024-10-24 06:25:38,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:25:38,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:25:38,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951847839] [2024-10-24 06:25:38,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951847839] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:25:38,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1417160029] [2024-10-24 06:25:38,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:25:38,923 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 06:25:38,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 06:25:38,925 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 06:25:38,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-10-24 06:25:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:25:40,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 06:25:40,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:25:40,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2024-10-24 06:25:40,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:25:41,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1417160029] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:25:41,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 06:25:41,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-24 06:25:41,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656662324] [2024-10-24 06:25:41,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 06:25:41,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 06:25:41,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:25:41,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 06:25:41,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-24 06:25:41,227 INFO L87 Difference]: Start difference. First operand 819 states and 1269 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 06:25:42,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:25:42,360 INFO L93 Difference]: Finished difference Result 1076 states and 1631 transitions. [2024-10-24 06:25:42,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 06:25:42,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 197 [2024-10-24 06:25:42,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:25:42,379 INFO L225 Difference]: With dead ends: 1076 [2024-10-24 06:25:42,379 INFO L226 Difference]: Without dead ends: 750 [2024-10-24 06:25:42,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2024-10-24 06:25:42,382 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 152 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 06:25:42,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 619 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 06:25:42,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2024-10-24 06:25:42,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 662. [2024-10-24 06:25:42,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 391 states have (on average 1.2813299232736572) internal successors, (501), 395 states have internal predecessors, (501), 255 states have call successors, (255), 15 states have call predecessors, (255), 15 states have return successors, (255), 251 states have call predecessors, (255), 255 states have call successors, (255) [2024-10-24 06:25:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1011 transitions. [2024-10-24 06:25:42,473 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1011 transitions. Word has length 197 [2024-10-24 06:25:42,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:25:42,474 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1011 transitions. [2024-10-24 06:25:42,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 06:25:42,474 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1011 transitions. [2024-10-24 06:25:42,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-24 06:25:42,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:25:42,476 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:25:42,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-10-24 06:25:42,691 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 (10)] Forceful destruction successful, exit code 0 [2024-10-24 06:25:42,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /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-10-24 06:25:42,877 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:25:42,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:25:42,878 INFO L85 PathProgramCache]: Analyzing trace with hash -32240921, now seen corresponding path program 1 times [2024-10-24 06:25:42,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:25:42,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893066888] [2024-10-24 06:25:42,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:25:42,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:25:42,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:25:42,880 INFO L229 MonitoredProcess]: Starting monitored process 12 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-10-24 06:25:42,881 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 (12)] Waiting until timeout for monitored process [2024-10-24 06:25:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:25:43,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-24 06:25:43,249 INFO L278 TraceCheckSpWp]: Computing forward predicates...