./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c -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.graphml --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 86018b7f3e582b94d83913c12d8eaea893434e1e96da49ea035805521496eb67 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 06:51:06,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 06:51:06,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 06:51:06,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 06:51:06,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 06:51:06,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 06:51:06,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 06:51:06,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 06:51:06,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 06:51:06,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 06:51:06,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 06:51:06,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 06:51:06,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 06:51:06,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 06:51:06,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 06:51:06,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 06:51:06,089 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 06:51:06,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 06:51:06,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 06:51:06,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 06:51:06,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 06:51:06,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 06:51:06,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 06:51:06,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 06:51:06,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 06:51:06,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 06:51:06,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 06:51:06,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 06:51:06,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 06:51:06,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 06:51:06,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 06:51:06,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 06:51:06,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 06:51:06,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 06:51:06,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 06:51:06,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 06:51:06,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 06:51:06,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 06:51:06,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 06:51:06,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 06:51:06,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 06:51:06,118 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 06:51:06,147 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 06:51:06,153 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 06:51:06,154 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 06:51:06,154 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 06:51:06,155 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 06:51:06,155 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 06:51:06,155 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 06:51:06,155 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 06:51:06,156 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 06:51:06,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 06:51:06,156 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 06:51:06,156 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 06:51:06,156 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 06:51:06,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 06:51:06,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 06:51:06,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 06:51:06,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 06:51:06,157 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 06:51:06,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 06:51:06,157 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 06:51:06,157 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 06:51:06,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 06:51:06,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 06:51:06,158 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 06:51:06,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 06:51:06,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 06:51:06,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 06:51:06,158 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 06:51:06,158 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 06:51:06,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 06:51:06,159 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 06:51:06,159 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 06:51:06,159 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 06:51:06,159 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 06:51:06,159 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 06:51:06,159 INFO L138 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.graphml 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 -> 86018b7f3e582b94d83913c12d8eaea893434e1e96da49ea035805521496eb67 [2023-02-17 06:51:06,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 06:51:06,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 06:51:06,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 06:51:06,347 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 06:51:06,347 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 06:51:06,348 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2023-02-17 06:51:07,475 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 06:51:07,628 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 06:51:07,629 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2023-02-17 06:51:07,634 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae67793d3/62d5d6158ea64397963e8e5bf5f7e709/FLAG1737b7026 [2023-02-17 06:51:07,649 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae67793d3/62d5d6158ea64397963e8e5bf5f7e709 [2023-02-17 06:51:07,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 06:51:07,652 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 06:51:07,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 06:51:07,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 06:51:07,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 06:51:07,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 06:51:07" (1/1) ... [2023-02-17 06:51:07,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4061e31d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:51:07, skipping insertion in model container [2023-02-17 06:51:07,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 06:51:07" (1/1) ... [2023-02-17 06:51:07,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 06:51:07,676 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 06:51:07,773 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2023-02-17 06:51:07,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 06:51:07,808 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 06:51:07,819 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2023-02-17 06:51:07,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 06:51:07,834 INFO L208 MainTranslator]: Completed translation [2023-02-17 06:51:07,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:51:07 WrapperNode [2023-02-17 06:51:07,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 06:51:07,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 06:51:07,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 06:51:07,835 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 06:51:07,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:51:07" (1/1) ... [2023-02-17 06:51:07,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:51:07" (1/1) ... [2023-02-17 06:51:07,860 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2023-02-17 06:51:07,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 06:51:07,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 06:51:07,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 06:51:07,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 06:51:07,866 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:51:07" (1/1) ... [2023-02-17 06:51:07,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:51:07" (1/1) ... [2023-02-17 06:51:07,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:51:07" (1/1) ... [2023-02-17 06:51:07,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:51:07" (1/1) ... [2023-02-17 06:51:07,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:51:07" (1/1) ... [2023-02-17 06:51:07,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:51:07" (1/1) ... [2023-02-17 06:51:07,872 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:51:07" (1/1) ... [2023-02-17 06:51:07,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:51:07" (1/1) ... [2023-02-17 06:51:07,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 06:51:07,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 06:51:07,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 06:51:07,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 06:51:07,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:51:07" (1/1) ... [2023-02-17 06:51:07,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 06:51:07,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:51:07,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 06:51:07,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 06:51:07,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 06:51:07,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 06:51:07,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 06:51:07,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 06:51:07,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 06:51:07,933 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 06:51:07,972 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 06:51:07,973 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 06:51:08,130 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 06:51:08,147 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 06:51:08,148 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 06:51:08,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 06:51:08 BoogieIcfgContainer [2023-02-17 06:51:08,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 06:51:08,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 06:51:08,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 06:51:08,152 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 06:51:08,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 06:51:07" (1/3) ... [2023-02-17 06:51:08,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d4ae18a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 06:51:08, skipping insertion in model container [2023-02-17 06:51:08,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:51:07" (2/3) ... [2023-02-17 06:51:08,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d4ae18a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 06:51:08, skipping insertion in model container [2023-02-17 06:51:08,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 06:51:08" (3/3) ... [2023-02-17 06:51:08,154 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2023-02-17 06:51:08,164 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 06:51:08,180 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 06:51:08,237 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 06:51:08,242 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@109fda9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 06:51:08,243 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 06:51:08,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 06:51:08,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 06:51:08,251 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:51:08,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:51:08,253 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:51:08,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:51:08,257 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2023-02-17 06:51:08,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:51:08,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346450949] [2023-02-17 06:51:08,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:51:08,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:51:08,343 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:51:08,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [24828319] [2023-02-17 06:51:08,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:51:08,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:51:08,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:51:08,347 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) [2023-02-17 06:51:08,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 06:51:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:51:08,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 06:51:08,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:51:08,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:51:08,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 06:51:08,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:51:08,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346450949] [2023-02-17 06:51:08,467 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:51:08,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24828319] [2023-02-17 06:51:08,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24828319] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:51:08,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:51:08,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 06:51:08,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262053955] [2023-02-17 06:51:08,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:51:08,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 06:51:08,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:51:08,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 06:51:08,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 06:51:08,501 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:51:08,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:51:08,652 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2023-02-17 06:51:08,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 06:51:08,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-17 06:51:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:51:08,662 INFO L225 Difference]: With dead ends: 54 [2023-02-17 06:51:08,662 INFO L226 Difference]: Without dead ends: 25 [2023-02-17 06:51:08,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-17 06:51:08,669 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:51:08,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 64 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 06:51:08,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-17 06:51:08,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-02-17 06:51:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 06:51:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-02-17 06:51:08,702 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2023-02-17 06:51:08,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:51:08,702 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-02-17 06:51:08,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:51:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-02-17 06:51:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 06:51:08,704 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:51:08,705 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:51:08,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 06:51:08,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-17 06:51:08,912 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:51:08,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:51:08,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2023-02-17 06:51:08,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:51:08,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141582163] [2023-02-17 06:51:08,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:51:08,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:51:08,925 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:51:08,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [603034498] [2023-02-17 06:51:08,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:51:08,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:51:08,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:51:08,928 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) [2023-02-17 06:51:08,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 06:51:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:51:08,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-17 06:51:08,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:51:09,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:51:09,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:51:09,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:51:09,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:51:09,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141582163] [2023-02-17 06:51:09,429 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:51:09,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603034498] [2023-02-17 06:51:09,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603034498] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:51:09,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:51:09,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-17 06:51:09,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024607203] [2023-02-17 06:51:09,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:51:09,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 06:51:09,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:51:09,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 06:51:09,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-02-17 06:51:09,436 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 06:51:09,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:51:09,659 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2023-02-17 06:51:09,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 06:51:09,660 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-02-17 06:51:09,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:51:09,661 INFO L225 Difference]: With dead ends: 41 [2023-02-17 06:51:09,661 INFO L226 Difference]: Without dead ends: 34 [2023-02-17 06:51:09,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-02-17 06:51:09,662 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 06:51:09,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 64 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 06:51:09,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-17 06:51:09,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2023-02-17 06:51:09,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 06:51:09,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-02-17 06:51:09,667 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2023-02-17 06:51:09,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:51:09,667 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-02-17 06:51:09,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 06:51:09,668 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-02-17 06:51:09,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 06:51:09,670 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:51:09,670 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:51:09,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-17 06:51:09,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-17 06:51:09,871 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:51:09,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:51:09,871 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2023-02-17 06:51:09,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:51:09,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450586645] [2023-02-17 06:51:09,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:51:09,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:51:09,878 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:51:09,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1210891645] [2023-02-17 06:51:09,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:51:09,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:51:09,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:51:09,885 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) [2023-02-17 06:51:09,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 06:51:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:51:09,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 06:51:09,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:51:09,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:51:09,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:51:09,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:51:09,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:51:09,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450586645] [2023-02-17 06:51:09,955 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:51:09,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210891645] [2023-02-17 06:51:09,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210891645] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:51:09,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:51:09,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-02-17 06:51:09,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644729968] [2023-02-17 06:51:09,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:51:09,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 06:51:09,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:51:09,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 06:51:09,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-17 06:51:09,958 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 06:51:09,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:51:09,998 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2023-02-17 06:51:09,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 06:51:09,998 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-02-17 06:51:09,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:51:10,001 INFO L225 Difference]: With dead ends: 73 [2023-02-17 06:51:10,001 INFO L226 Difference]: Without dead ends: 67 [2023-02-17 06:51:10,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-17 06:51:10,004 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 06:51:10,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 106 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 06:51:10,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-17 06:51:10,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2023-02-17 06:51:10,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 06:51:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2023-02-17 06:51:10,025 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2023-02-17 06:51:10,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:51:10,026 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2023-02-17 06:51:10,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 06:51:10,027 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2023-02-17 06:51:10,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 06:51:10,027 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:51:10,027 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:51:10,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 06:51:10,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:51:10,235 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:51:10,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:51:10,236 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2023-02-17 06:51:10,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:51:10,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928972773] [2023-02-17 06:51:10,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:51:10,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:51:10,244 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:51:10,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1166111366] [2023-02-17 06:51:10,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:51:10,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:51:10,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:51:10,249 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) [2023-02-17 06:51:10,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 06:51:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:51:10,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 06:51:10,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:51:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 06:51:10,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:51:10,609 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 06:51:10,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:51:10,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928972773] [2023-02-17 06:51:10,610 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:51:10,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166111366] [2023-02-17 06:51:10,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166111366] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:51:10,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:51:10,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2023-02-17 06:51:10,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234892152] [2023-02-17 06:51:10,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:51:10,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-17 06:51:10,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:51:10,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-17 06:51:10,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-02-17 06:51:10,612 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 06:51:11,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:51:11,081 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2023-02-17 06:51:11,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-17 06:51:11,082 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2023-02-17 06:51:11,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:51:11,082 INFO L225 Difference]: With dead ends: 65 [2023-02-17 06:51:11,082 INFO L226 Difference]: Without dead ends: 57 [2023-02-17 06:51:11,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2023-02-17 06:51:11,083 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 56 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 06:51:11,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 78 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 06:51:11,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-17 06:51:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2023-02-17 06:51:11,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 06:51:11,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-02-17 06:51:11,092 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 25 [2023-02-17 06:51:11,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:51:11,093 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-02-17 06:51:11,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 06:51:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-02-17 06:51:11,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-17 06:51:11,094 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:51:11,094 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:51:11,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-17 06:51:11,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:51:11,298 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:51:11,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:51:11,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 1 times [2023-02-17 06:51:11,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:51:11,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570718813] [2023-02-17 06:51:11,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:51:11,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:51:11,306 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:51:11,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [595171504] [2023-02-17 06:51:11,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:51:11,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:51:11,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:51:11,308 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:51:11,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 06:51:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:51:11,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 06:51:11,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:51:11,392 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:51:11,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:51:11,428 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-17 06:51:11,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:51:11,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570718813] [2023-02-17 06:51:11,428 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:51:11,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595171504] [2023-02-17 06:51:11,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595171504] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:51:11,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:51:11,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-17 06:51:11,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962091474] [2023-02-17 06:51:11,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:51:11,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 06:51:11,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:51:11,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 06:51:11,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-17 06:51:11,430 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-17 06:51:11,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:51:11,521 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2023-02-17 06:51:11,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-17 06:51:11,522 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 49 [2023-02-17 06:51:11,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:51:11,522 INFO L225 Difference]: With dead ends: 116 [2023-02-17 06:51:11,523 INFO L226 Difference]: Without dead ends: 110 [2023-02-17 06:51:11,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2023-02-17 06:51:11,523 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 45 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 06:51:11,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 166 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 06:51:11,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-17 06:51:11,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-02-17 06:51:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.125) internal successors, (99), 88 states have internal predecessors, (99), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 06:51:11,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2023-02-17 06:51:11,540 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 49 [2023-02-17 06:51:11,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:51:11,540 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2023-02-17 06:51:11,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-17 06:51:11,541 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2023-02-17 06:51:11,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-02-17 06:51:11,542 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:51:11,543 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:51:11,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 06:51:11,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:51:11,747 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:51:11,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:51:11,748 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 2 times [2023-02-17 06:51:11,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:51:11,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149960505] [2023-02-17 06:51:11,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:51:11,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:51:11,763 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:51:11,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1698486536] [2023-02-17 06:51:11,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 06:51:11,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:51:11,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:51:11,766 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:51:11,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 06:51:11,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 06:51:11,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 06:51:11,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 06:51:11,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:51:11,910 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:51:11,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:51:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-02-17 06:51:12,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:51:12,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149960505] [2023-02-17 06:51:12,074 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:51:12,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698486536] [2023-02-17 06:51:12,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698486536] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:51:12,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:51:12,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2023-02-17 06:51:12,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355270726] [2023-02-17 06:51:12,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:51:12,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-17 06:51:12,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:51:12,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-17 06:51:12,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2023-02-17 06:51:12,078 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-17 06:51:12,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:51:12,433 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2023-02-17 06:51:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-17 06:51:12,433 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Word has length 109 [2023-02-17 06:51:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:51:12,435 INFO L225 Difference]: With dead ends: 236 [2023-02-17 06:51:12,436 INFO L226 Difference]: Without dead ends: 230 [2023-02-17 06:51:12,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2023-02-17 06:51:12,438 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 127 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:51:12,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 286 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 06:51:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-02-17 06:51:12,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2023-02-17 06:51:12,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 184 states have (on average 1.125) internal successors, (207), 184 states have internal predecessors, (207), 23 states have call successors, (23), 23 states have call predecessors, (23), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-17 06:51:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2023-02-17 06:51:12,484 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 109 [2023-02-17 06:51:12,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:51:12,484 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2023-02-17 06:51:12,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-17 06:51:12,485 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2023-02-17 06:51:12,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-02-17 06:51:12,487 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:51:12,488 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:51:12,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 06:51:12,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:51:12,694 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:51:12,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:51:12,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1294150550, now seen corresponding path program 3 times [2023-02-17 06:51:12,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:51:12,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059577724] [2023-02-17 06:51:12,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:51:12,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:51:12,711 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:51:12,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [533508633] [2023-02-17 06:51:12,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 06:51:12,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:51:12,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:51:12,733 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:51:12,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 06:51:12,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-17 06:51:12,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 06:51:12,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-17 06:51:12,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:51:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 234 proven. 1 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2023-02-17 06:51:12,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:51:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 106 proven. 129 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2023-02-17 06:51:13,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:51:13,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059577724] [2023-02-17 06:51:13,076 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:51:13,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533508633] [2023-02-17 06:51:13,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533508633] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:51:13,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:51:13,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-02-17 06:51:13,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223058693] [2023-02-17 06:51:13,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:51:13,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 06:51:13,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:51:13,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 06:51:13,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-02-17 06:51:13,078 INFO L87 Difference]: Start difference. First operand 230 states and 252 transitions. Second operand has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 06:51:13,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:51:13,245 INFO L93 Difference]: Finished difference Result 449 states and 492 transitions. [2023-02-17 06:51:13,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 06:51:13,245 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 229 [2023-02-17 06:51:13,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:51:13,251 INFO L225 Difference]: With dead ends: 449 [2023-02-17 06:51:13,251 INFO L226 Difference]: Without dead ends: 443 [2023-02-17 06:51:13,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 437 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-02-17 06:51:13,252 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:51:13,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 77 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 06:51:13,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-02-17 06:51:13,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2023-02-17 06:51:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 352 states have (on average 1.125) internal successors, (396), 352 states have internal predecessors, (396), 44 states have call successors, (44), 44 states have call predecessors, (44), 43 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2023-02-17 06:51:13,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 483 transitions. [2023-02-17 06:51:13,304 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 483 transitions. Word has length 229 [2023-02-17 06:51:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:51:13,305 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 483 transitions. [2023-02-17 06:51:13,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 06:51:13,305 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 483 transitions. [2023-02-17 06:51:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-02-17 06:51:13,309 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:51:13,309 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:51:13,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-17 06:51:13,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:51:13,514 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:51:13,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:51:13,515 INFO L85 PathProgramCache]: Analyzing trace with hash -614092180, now seen corresponding path program 1 times [2023-02-17 06:51:13,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:51:13,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151715774] [2023-02-17 06:51:13,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:51:13,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:51:13,529 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:51:13,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [407243391] [2023-02-17 06:51:13,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:51:13,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:51:13,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:51:13,545 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:51:13,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-17 06:51:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:51:13,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-17 06:51:13,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:51:13,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:51:13,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:51:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 1430 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-02-17 06:51:14,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:51:14,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151715774] [2023-02-17 06:51:14,521 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:51:14,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407243391] [2023-02-17 06:51:14,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407243391] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:51:14,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:51:14,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2023-02-17 06:51:14,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161983208] [2023-02-17 06:51:14,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:51:14,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-17 06:51:14,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:51:14,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-17 06:51:14,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2023-02-17 06:51:14,526 INFO L87 Difference]: Start difference. First operand 440 states and 483 transitions. Second operand has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-02-17 06:51:15,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:51:15,550 INFO L93 Difference]: Finished difference Result 929 states and 1043 transitions. [2023-02-17 06:51:15,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-02-17 06:51:15,550 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Word has length 229 [2023-02-17 06:51:15,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:51:15,555 INFO L225 Difference]: With dead ends: 929 [2023-02-17 06:51:15,556 INFO L226 Difference]: Without dead ends: 923 [2023-02-17 06:51:15,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2023-02-17 06:51:15,559 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 354 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 06:51:15,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 544 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 06:51:15,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2023-02-17 06:51:15,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2023-02-17 06:51:15,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 736 states have (on average 1.125) internal successors, (828), 736 states have internal predecessors, (828), 92 states have call successors, (92), 92 states have call predecessors, (92), 91 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2023-02-17 06:51:15,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1011 transitions. [2023-02-17 06:51:15,635 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1011 transitions. Word has length 229 [2023-02-17 06:51:15,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:51:15,636 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 1011 transitions. [2023-02-17 06:51:15,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-02-17 06:51:15,636 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1011 transitions. [2023-02-17 06:51:15,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2023-02-17 06:51:15,641 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:51:15,641 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:51:15,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-17 06:51:15,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-17 06:51:15,846 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:51:15,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:51:15,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1651100380, now seen corresponding path program 2 times [2023-02-17 06:51:15,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:51:15,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877778719] [2023-02-17 06:51:15,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:51:15,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:51:15,868 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:51:15,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [502639933] [2023-02-17 06:51:15,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 06:51:15,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:51:15,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:51:15,870 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:51:15,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-17 06:51:16,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 06:51:16,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 06:51:16,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 95 conjunts are in the unsatisfiable core [2023-02-17 06:51:16,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:51:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:51:16,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:51:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 6302 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2023-02-17 06:51:18,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:51:18,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877778719] [2023-02-17 06:51:18,811 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:51:18,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502639933] [2023-02-17 06:51:18,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502639933] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:51:18,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:51:18,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2023-02-17 06:51:18,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068825281] [2023-02-17 06:51:18,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:51:18,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2023-02-17 06:51:18,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:51:18,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2023-02-17 06:51:18,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2023-02-17 06:51:18,819 INFO L87 Difference]: Start difference. First operand 920 states and 1011 transitions. Second operand has 98 states, 98 states have (on average 6.255102040816326) internal successors, (613), 98 states have internal predecessors, (613), 93 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2023-02-17 06:51:22,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:51:22,818 INFO L93 Difference]: Finished difference Result 1889 states and 2123 transitions. [2023-02-17 06:51:22,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2023-02-17 06:51:22,819 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 6.255102040816326) internal successors, (613), 98 states have internal predecessors, (613), 93 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) Word has length 469 [2023-02-17 06:51:22,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:51:22,825 INFO L225 Difference]: With dead ends: 1889 [2023-02-17 06:51:22,825 INFO L226 Difference]: Without dead ends: 1883 [2023-02-17 06:51:22,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1029 GetRequests, 840 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5452 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=13540, Invalid=22750, Unknown=0, NotChecked=0, Total=36290 [2023-02-17 06:51:22,834 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 691 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 06:51:22,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 911 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 06:51:22,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2023-02-17 06:51:22,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1880. [2023-02-17 06:51:22,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1504 states have (on average 1.125) internal successors, (1692), 1504 states have internal predecessors, (1692), 188 states have call successors, (188), 188 states have call predecessors, (188), 187 states have return successors, (187), 187 states have call predecessors, (187), 187 states have call successors, (187) [2023-02-17 06:51:22,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2067 transitions. [2023-02-17 06:51:22,989 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2067 transitions. Word has length 469 [2023-02-17 06:51:22,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:51:22,989 INFO L495 AbstractCegarLoop]: Abstraction has 1880 states and 2067 transitions. [2023-02-17 06:51:22,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 6.255102040816326) internal successors, (613), 98 states have internal predecessors, (613), 93 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2023-02-17 06:51:22,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2067 transitions. [2023-02-17 06:51:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 950 [2023-02-17 06:51:23,005 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:51:23,006 INFO L195 NwaCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 94, 94, 94, 93, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:51:23,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-17 06:51:23,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:51:23,213 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:51:23,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:51:23,213 INFO L85 PathProgramCache]: Analyzing trace with hash 866618004, now seen corresponding path program 3 times [2023-02-17 06:51:23,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:51:23,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65043793] [2023-02-17 06:51:23,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:51:23,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:51:23,252 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:51:23,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1049132145] [2023-02-17 06:51:23,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 06:51:23,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:51:23,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:51:23,255 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:51:23,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-17 06:51:24,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 95 check-sat command(s) [2023-02-17 06:51:24,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 06:51:24,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 2313 conjuncts, 191 conjunts are in the unsatisfiable core [2023-02-17 06:51:24,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:51:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 44086 backedges. 188 proven. 43898 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:51:27,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:51:30,134 INFO L134 CoverageAnalysis]: Checked inductivity of 44086 backedges. 188 proven. 26414 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2023-02-17 06:51:30,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:51:30,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65043793] [2023-02-17 06:51:30,135 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:51:30,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049132145] [2023-02-17 06:51:30,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049132145] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:51:30,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:51:30,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2023-02-17 06:51:30,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538086828] [2023-02-17 06:51:30,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:51:30,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2023-02-17 06:51:30,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:51:30,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2023-02-17 06:51:30,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2023-02-17 06:51:30,140 INFO L87 Difference]: Start difference. First operand 1880 states and 2067 transitions. Second operand has 104 states, 104 states have (on average 7.625) internal successors, (793), 104 states have internal predecessors, (793), 100 states have call successors, (189), 96 states have call predecessors, (189), 95 states have return successors, (188), 99 states have call predecessors, (188), 99 states have call successors, (188) [2023-02-17 06:51:33,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:51:33,922 INFO L93 Difference]: Finished difference Result 2009 states and 2213 transitions. [2023-02-17 06:51:33,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2023-02-17 06:51:33,924 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 7.625) internal successors, (793), 104 states have internal predecessors, (793), 100 states have call successors, (189), 96 states have call predecessors, (189), 95 states have return successors, (188), 99 states have call predecessors, (188), 99 states have call successors, (188) Word has length 949 [2023-02-17 06:51:33,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:51:33,948 INFO L225 Difference]: With dead ends: 2009 [2023-02-17 06:51:33,948 INFO L226 Difference]: Without dead ends: 2003 [2023-02-17 06:51:33,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1995 GetRequests, 1704 SyntacticMatches, 90 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9505 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=15349, Invalid=25657, Unknown=0, NotChecked=0, Total=41006 [2023-02-17 06:51:33,951 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 360 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 06:51:33,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 953 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 06:51:33,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2023-02-17 06:51:34,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 2000. [2023-02-17 06:51:34,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2000 states, 1600 states have (on average 1.125) internal successors, (1800), 1600 states have internal predecessors, (1800), 200 states have call successors, (200), 200 states have call predecessors, (200), 199 states have return successors, (199), 199 states have call predecessors, (199), 199 states have call successors, (199) [2023-02-17 06:51:34,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2199 transitions. [2023-02-17 06:51:34,092 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2199 transitions. Word has length 949 [2023-02-17 06:51:34,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:51:34,093 INFO L495 AbstractCegarLoop]: Abstraction has 2000 states and 2199 transitions. [2023-02-17 06:51:34,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 7.625) internal successors, (793), 104 states have internal predecessors, (793), 100 states have call successors, (189), 96 states have call predecessors, (189), 95 states have return successors, (188), 99 states have call predecessors, (188), 99 states have call successors, (188) [2023-02-17 06:51:34,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2199 transitions. [2023-02-17 06:51:34,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2023-02-17 06:51:34,114 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:51:34,114 INFO L195 NwaCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 100, 99, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:51:34,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-02-17 06:51:34,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-17 06:51:34,325 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:51:34,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:51:34,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1685422910, now seen corresponding path program 4 times [2023-02-17 06:51:34,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:51:34,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146941388] [2023-02-17 06:51:34,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:51:34,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:51:34,361 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:51:34,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1242319619] [2023-02-17 06:51:34,362 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 06:51:34,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:51:34,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:51:34,369 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:51:34,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-17 06:51:34,810 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 06:51:34,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-17 06:51:34,810 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 06:51:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 06:51:35,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 06:51:35,892 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 06:51:35,892 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 06:51:35,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-17 06:51:36,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-17 06:51:36,107 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1] [2023-02-17 06:51:36,110 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 06:51:36,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 06:51:36 BoogieIcfgContainer [2023-02-17 06:51:36,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 06:51:36,293 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 06:51:36,293 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 06:51:36,293 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 06:51:36,294 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 06:51:08" (3/4) ... [2023-02-17 06:51:36,295 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-17 06:51:36,459 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 06:51:36,459 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 06:51:36,460 INFO L158 Benchmark]: Toolchain (without parser) took 28807.40ms. Allocated memory was 125.8MB in the beginning and 465.6MB in the end (delta: 339.7MB). Free memory was 87.1MB in the beginning and 231.1MB in the end (delta: -144.0MB). Peak memory consumption was 197.7MB. Max. memory is 16.1GB. [2023-02-17 06:51:36,460 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory was 92.9MB in the beginning and 92.8MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 06:51:36,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.26ms. Allocated memory is still 125.8MB. Free memory was 86.7MB in the beginning and 76.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 06:51:36,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.61ms. Allocated memory is still 125.8MB. Free memory was 76.2MB in the beginning and 75.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 06:51:36,461 INFO L158 Benchmark]: Boogie Preprocessor took 12.42ms. Allocated memory is still 125.8MB. Free memory was 75.0MB in the beginning and 73.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 06:51:36,461 INFO L158 Benchmark]: RCFGBuilder took 275.08ms. Allocated memory is still 125.8MB. Free memory was 73.7MB in the beginning and 63.6MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 06:51:36,461 INFO L158 Benchmark]: TraceAbstraction took 28142.47ms. Allocated memory was 125.8MB in the beginning and 465.6MB in the end (delta: 339.7MB). Free memory was 62.8MB in the beginning and 268.2MB in the end (delta: -205.4MB). Peak memory consumption was 134.8MB. Max. memory is 16.1GB. [2023-02-17 06:51:36,461 INFO L158 Benchmark]: Witness Printer took 166.01ms. Allocated memory is still 465.6MB. Free memory was 268.2MB in the beginning and 231.1MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-02-17 06:51:36,463 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory was 92.9MB in the beginning and 92.8MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.26ms. Allocated memory is still 125.8MB. Free memory was 86.7MB in the beginning and 76.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.61ms. Allocated memory is still 125.8MB. Free memory was 76.2MB in the beginning and 75.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.42ms. Allocated memory is still 125.8MB. Free memory was 75.0MB in the beginning and 73.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 275.08ms. Allocated memory is still 125.8MB. Free memory was 73.7MB in the beginning and 63.6MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 28142.47ms. Allocated memory was 125.8MB in the beginning and 465.6MB in the end (delta: 339.7MB). Free memory was 62.8MB in the beginning and 268.2MB in the end (delta: -205.4MB). Peak memory consumption was 134.8MB. Max. memory is 16.1GB. * Witness Printer took 166.01ms. Allocated memory is still 465.6MB. Free memory was 268.2MB in the beginning and 231.1MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. 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 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; VAL [counter=0] [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [counter=0, v=-2126008764, X=2147483600, x=0, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=-2126008764, x=0, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=-2126008764, x=0, x=0, X=2147483600, x=0, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=1, v=-2126008764, x=0, X=2147483600, x=0, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=1, v=-2126008764, x=0, x=0, x=0, X=2147483600, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=1, v=-2104533928, x=0, X=2147483600, x=0, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=1, v=-2104533928, X=2147483600, x=0, x=0, x=1, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-2104533928, x=0, x=1, X=2147483600, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=-2104533928, x=0, X=2147483600, x=1, x=10737418, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=2, v=-2104533928, x=10737418, x=0, x=1, X=2147483600, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=2, v=-2104533928, X=2147483600, x=10737418, x=0, x=1, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=2, v=-2083059092, X=2147483600, x=10737418, x=0, x=1, Y=10737418, y=0] [L45] x++ VAL [counter=2, v=-2083059092, x=10737418, x=0, X=2147483600, x=2, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=-2083059092, x=0, x=10737418, X=2147483600, x=2, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=-2083059092, x=2, X=2147483600, x=0, x=21474836, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=3, v=-2083059092, x=0, x=21474836, X=2147483600, x=2, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=3, v=-2083059092, x=21474836, x=0, X=2147483600, x=2, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=3, v=-2061584256, x=21474836, X=2147483600, x=2, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=3, v=-2061584256, x=21474836, x=0, x=3, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=-2061584256, x=3, x=21474836, X=2147483600, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=-2061584256, X=2147483600, x=3, x=32212254, x=0, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=4, v=-2061584256, X=2147483600, x=32212254, x=0, x=3, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=4, v=-2061584256, x=0, x=3, x=32212254, X=2147483600, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=4, v=-2040109420, x=32212254, X=2147483600, x=0, x=3, Y=10737418, y=0] [L45] x++ VAL [counter=4, v=-2040109420, X=2147483600, x=0, x=4, x=32212254, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=-2040109420, x=32212254, X=2147483600, x=4, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=-2040109420, x=42949672, x=4, X=2147483600, x=0, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=5, v=-2040109420, X=2147483600, x=0, x=42949672, x=4, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=5, v=-2040109420, x=0, x=4, X=2147483600, x=42949672, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=5, v=-2018634584, x=42949672, X=2147483600, x=0, x=4, Y=10737418, y=0] [L45] x++ VAL [counter=5, v=-2018634584, x=0, x=5, x=42949672, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-2018634584, x=5, x=42949672, x=0, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=-2018634584, x=5, x=53687090, x=0, X=2147483600, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=6, v=-2018634584, X=2147483600, x=0, x=5, x=53687090, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=6, v=-2018634584, X=2147483600, x=53687090, x=5, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=6, v=-1997159748, X=2147483600, x=0, x=5, x=53687090, y=0, Y=10737418] [L45] x++ VAL [counter=6, v=-1997159748, X=2147483600, x=0, x=53687090, x=6, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-1997159748, x=0, x=6, X=2147483600, x=53687090, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=-1997159748, x=6, x=0, x=64424508, X=2147483600, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=7, v=-1997159748, x=0, X=2147483600, x=6, x=64424508, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=7, v=-1997159748, x=6, x=0, x=64424508, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=7, v=-1975684912, x=6, x=0, X=2147483600, x=64424508, y=0, Y=10737418] [L45] x++ VAL [counter=7, v=-1975684912, x=0, x=64424508, x=7, X=2147483600, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=-1975684912, x=7, X=2147483600, x=0, x=64424508, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=-1975684912, x=75161926, x=0, X=2147483600, x=7, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=8, v=-1975684912, x=0, x=75161926, x=7, X=2147483600, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=8, v=-1975684912, x=0, x=7, X=2147483600, x=75161926, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=8, v=-1954210076, x=75161926, x=7, X=2147483600, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=8, v=-1954210076, x=0, x=8, x=75161926, X=2147483600, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-1954210076, x=75161926, x=0, x=8, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-1954210076, x=0, X=2147483600, x=8, x=85899344, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=9, v=-1954210076, X=2147483600, x=85899344, x=8, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=9, v=-1954210076, X=2147483600, x=85899344, x=8, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=9, v=-1932735240, x=8, X=2147483600, x=0, x=85899344, Y=10737418, y=0] [L45] x++ VAL [counter=9, v=-1932735240, x=9, X=2147483600, x=85899344, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=-1932735240, x=85899344, X=2147483600, x=9, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=-1932735240, X=2147483600, x=0, x=96636762, x=9, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=10, v=-1932735240, X=2147483600, x=9, x=0, x=96636762, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=10, v=-1932735240, x=96636762, X=2147483600, x=0, x=9, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=10, v=-1911260404, x=0, X=2147483600, x=96636762, x=9, Y=10737418, y=0] [L45] x++ VAL [counter=10, v=-1911260404, x=10, x=0, x=96636762, X=2147483600, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=-1911260404, x=0, x=10, X=2147483600, x=96636762, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=-1911260404, x=107374180, x=10, X=2147483600, x=0, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=11, v=-1911260404, x=0, x=10, X=2147483600, x=107374180, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=11, v=-1911260404, x=0, X=2147483600, x=10, x=107374180, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=11, v=-1889785568, X=2147483600, x=107374180, x=10, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=11, v=-1889785568, x=107374180, X=2147483600, x=0, x=11, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=-1889785568, x=11, X=2147483600, x=0, x=107374180, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=-1889785568, x=0, x=118111598, X=2147483600, x=11, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=12, v=-1889785568, x=118111598, x=0, x=11, X=2147483600, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=12, v=-1889785568, x=0, x=11, x=118111598, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=12, v=-1868310732, X=2147483600, x=0, x=118111598, x=11, Y=10737418, y=0] [L45] x++ VAL [counter=12, v=-1868310732, x=0, x=118111598, X=2147483600, x=12, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=-1868310732, X=2147483600, x=0, x=118111598, x=12, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=-1868310732, x=12, x=0, X=2147483600, x=128849016, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=13, v=-1868310732, x=128849016, x=0, X=2147483600, x=12, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=13, v=-1868310732, x=0, x=128849016, x=12, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=13, v=-1846835896, x=128849016, x=12, x=0, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=13, v=-1846835896, x=128849016, X=2147483600, x=0, x=13, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=-1846835896, x=0, x=13, x=128849016, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=-1846835896, x=0, x=139586434, x=13, X=2147483600, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=14, v=-1846835896, x=13, x=139586434, X=2147483600, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=14, v=-1846835896, X=2147483600, x=13, x=0, x=139586434, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=14, v=-1825361060, x=0, x=139586434, X=2147483600, x=13, Y=10737418, y=0] [L45] x++ VAL [counter=14, v=-1825361060, x=139586434, X=2147483600, x=0, x=14, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=-1825361060, X=2147483600, x=14, x=139586434, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=-1825361060, x=150323852, X=2147483600, x=0, x=14, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=15, v=-1825361060, x=150323852, X=2147483600, x=0, x=14, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=15, v=-1825361060, X=2147483600, x=150323852, x=0, x=14, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=15, v=-1803886224, x=14, x=0, x=150323852, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=15, v=-1803886224, x=0, X=2147483600, x=15, x=150323852, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=-1803886224, x=150323852, x=0, X=2147483600, x=15, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=-1803886224, x=161061270, x=15, x=0, X=2147483600, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=16, v=-1803886224, X=2147483600, x=0, x=161061270, x=15, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=16, v=-1803886224, x=161061270, X=2147483600, x=0, x=15, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=16, v=-1782411388, x=161061270, X=2147483600, x=15, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=16, v=-1782411388, x=16, X=2147483600, x=161061270, x=0, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=-1782411388, X=2147483600, x=0, x=16, x=161061270, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=-1782411388, x=0, X=2147483600, x=171798688, x=16, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=17, v=-1782411388, x=16, x=0, x=171798688, X=2147483600, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=17, v=-1782411388, X=2147483600, x=0, x=16, x=171798688, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=17, v=-1760936552, x=16, X=2147483600, x=0, x=171798688, y=0, Y=10737418] [L45] x++ VAL [counter=17, v=-1760936552, x=0, X=2147483600, x=17, x=171798688, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=-1760936552, X=2147483600, x=171798688, x=0, x=17, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=-1760936552, x=17, X=2147483600, x=0, x=182536106, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=18, v=-1760936552, x=17, x=0, X=2147483600, x=182536106, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=18, v=-1760936552, X=2147483600, x=0, x=17, x=182536106, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=18, v=-1739461716, x=17, x=0, x=182536106, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=18, v=-1739461716, x=18, x=0, x=182536106, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=-1739461716, x=0, x=18, X=2147483600, x=182536106, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=-1739461716, x=18, x=193273524, x=0, X=2147483600, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=19, v=-1739461716, x=0, x=193273524, x=18, X=2147483600, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=19, v=-1739461716, x=0, X=2147483600, x=193273524, x=18, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=19, v=-1717986880, x=0, x=193273524, X=2147483600, x=18, Y=10737418, y=0] [L45] x++ VAL [counter=19, v=-1717986880, x=19, x=193273524, x=0, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=-1717986880, x=193273524, X=2147483600, x=0, x=19, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=-1717986880, x=19, X=2147483600, x=204010942, x=0, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=20, v=-1717986880, X=2147483600, x=0, x=204010942, x=19, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=20, v=-1717986880, x=0, X=2147483600, x=19, x=204010942, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=20, v=-1696512044, x=19, X=2147483600, x=0, x=204010942, y=0, Y=10737418] [L45] x++ VAL [counter=20, v=-1696512044, X=2147483600, x=20, x=0, x=204010942, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=-1696512044, x=20, x=204010942, x=0, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=21, v=-1696512044, x=214748360, x=0, x=20, X=2147483600, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=21] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=21, v=-1696512044, x=20, x=0, x=214748360, X=2147483600, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=21, v=-1696512044, x=20, x=0, X=2147483600, x=214748360, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=21, v=-1675037208, X=2147483600, x=214748360, x=20, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=21, v=-1675037208, x=214748360, x=0, X=2147483600, x=21, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=-1675037208, x=0, x=214748360, x=21, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=22, v=-1675037208, x=225485778, x=21, x=0, X=2147483600, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=22] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=22, v=-1675037208, x=21, X=2147483600, x=225485778, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=22, v=-1675037208, X=2147483600, x=21, x=0, x=225485778, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=22, v=-1653562372, x=225485778, X=2147483600, x=0, x=21, y=0, Y=10737418] [L45] x++ VAL [counter=22, v=-1653562372, X=2147483600, x=225485778, x=0, x=22, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=23, counter++=22, v=-1653562372, x=225485778, x=0, x=22, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=23, v=-1653562372, x=236223196, x=22, x=0, X=2147483600, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=23] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=23, v=-1653562372, X=2147483600, x=0, x=236223196, x=22, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=23, v=-1653562372, X=2147483600, x=236223196, x=22, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=23, v=-1632087536, x=236223196, x=0, x=22, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=23, v=-1632087536, x=236223196, X=2147483600, x=0, x=23, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=-1632087536, x=23, x=236223196, x=0, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=24, v=-1632087536, x=23, x=246960614, X=2147483600, x=0, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=24] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=24, v=-1632087536, X=2147483600, x=23, x=0, x=246960614, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=24, v=-1632087536, x=23, X=2147483600, x=246960614, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=24, v=-1610612700, X=2147483600, x=0, x=23, x=246960614, y=0, Y=10737418] [L45] x++ VAL [counter=24, v=-1610612700, x=0, x=24, X=2147483600, x=246960614, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=-1610612700, x=246960614, x=0, x=24, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=25, v=-1610612700, X=2147483600, x=0, x=257698032, x=24, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=25] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=25, v=-1610612700, X=2147483600, x=24, x=0, x=257698032, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=25, v=-1610612700, x=24, X=2147483600, x=0, x=257698032, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=25, v=-1589137864, x=24, x=0, X=2147483600, x=257698032, Y=10737418, y=0] [L45] x++ VAL [counter=25, v=-1589137864, x=257698032, x=0, X=2147483600, x=25, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=26, counter++=25, v=-1589137864, x=0, X=2147483600, x=25, x=257698032, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=26, v=-1589137864, x=0, x=268435450, x=25, X=2147483600, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=26] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=26, v=-1589137864, X=2147483600, x=0, x=268435450, x=25, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=26, v=-1589137864, x=0, x=25, x=268435450, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=26, v=-1567663028, x=25, x=0, x=268435450, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=26, v=-1567663028, x=26, x=0, X=2147483600, x=268435450, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=27, counter++=26, v=-1567663028, x=26, x=268435450, X=2147483600, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=27, v=-1567663028, x=0, X=2147483600, x=279172868, x=26, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=27] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=27, v=-1567663028, x=279172868, x=26, X=2147483600, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=27, v=-1567663028, x=0, x=279172868, X=2147483600, x=26, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=27, v=-1546188192, x=26, x=279172868, X=2147483600, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=27, v=-1546188192, X=2147483600, x=0, x=279172868, x=27, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=-1546188192, x=0, X=2147483600, x=27, x=279172868, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=28, v=-1546188192, x=289910286, x=27, x=0, X=2147483600, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=28] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=28, v=-1546188192, X=2147483600, x=27, x=0, x=289910286, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=28, v=-1546188192, X=2147483600, x=27, x=289910286, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=28, v=-1524713356, x=27, x=0, x=289910286, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=28, v=-1524713356, x=28, x=0, X=2147483600, x=289910286, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=-1524713356, X=2147483600, x=0, x=289910286, x=28, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=29, v=-1524713356, X=2147483600, x=300647704, x=0, x=28, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=29] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=29, v=-1524713356, x=28, X=2147483600, x=0, x=300647704, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=29, v=-1524713356, x=300647704, x=28, X=2147483600, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=29, v=-1503238520, x=300647704, x=0, x=28, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=29, v=-1503238520, x=29, X=2147483600, x=0, x=300647704, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=-1503238520, x=0, x=300647704, x=29, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=30, v=-1503238520, x=311385122, x=0, X=2147483600, x=29, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=30] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=30, v=-1503238520, x=29, x=311385122, X=2147483600, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=30, v=-1503238520, x=311385122, x=29, x=0, X=2147483600, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=30, v=-1481763684, x=0, X=2147483600, x=29, x=311385122, y=0, Y=10737418] [L45] x++ VAL [counter=30, v=-1481763684, X=2147483600, x=30, x=311385122, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=-1481763684, x=311385122, x=30, X=2147483600, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=31, v=-1481763684, x=322122540, x=0, X=2147483600, x=30, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=31] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=31, v=-1481763684, X=2147483600, x=322122540, x=0, x=30, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=31, v=-1481763684, x=0, X=2147483600, x=322122540, x=30, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=31, v=-1460288848, x=322122540, x=0, X=2147483600, x=30, y=0, Y=10737418] [L45] x++ VAL [counter=31, v=-1460288848, x=322122540, x=0, x=31, X=2147483600, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=-1460288848, x=31, x=322122540, x=0, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=32, v=-1460288848, x=332859958, X=2147483600, x=0, x=31, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=32] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=32, v=-1460288848, X=2147483600, x=0, x=332859958, x=31, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=32, v=-1460288848, x=332859958, x=31, x=0, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=32, v=-1438814012, x=31, x=332859958, X=2147483600, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=32, v=-1438814012, x=332859958, X=2147483600, x=0, x=32, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=-1438814012, x=0, x=332859958, x=32, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=33, v=-1438814012, x=32, x=0, x=343597376, X=2147483600, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=33] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=33, v=-1438814012, X=2147483600, x=343597376, x=0, x=32, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=33, v=-1438814012, X=2147483600, x=32, x=0, x=343597376, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=33, v=-1417339176, x=0, x=32, x=343597376, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=33, v=-1417339176, x=343597376, x=33, x=0, X=2147483600, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=-1417339176, x=33, x=0, X=2147483600, x=343597376, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=34, v=-1417339176, x=0, x=354334794, x=33, X=2147483600, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=34] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=34, v=-1417339176, x=33, x=0, x=354334794, X=2147483600, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=34, v=-1417339176, x=33, x=354334794, x=0, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=34, v=-1395864340, x=354334794, x=0, x=33, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=34, v=-1395864340, x=0, x=34, x=354334794, X=2147483600, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=-1395864340, x=354334794, X=2147483600, x=34, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=35, v=-1395864340, x=365072212, X=2147483600, x=0, x=34, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=35] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=35, v=-1395864340, X=2147483600, x=34, x=0, x=365072212, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=35, v=-1395864340, x=365072212, x=34, X=2147483600, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=35, v=-1374389504, x=365072212, x=0, x=34, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=35, v=-1374389504, x=365072212, X=2147483600, x=0, x=35, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=-1374389504, x=365072212, X=2147483600, x=0, x=35, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=36, v=-1374389504, x=35, x=375809630, x=0, X=2147483600, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=36] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=36, v=-1374389504, x=0, X=2147483600, x=375809630, x=35, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=36, v=-1374389504, x=375809630, X=2147483600, x=0, x=35, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=36, v=-1352914668, x=375809630, x=0, X=2147483600, x=35, Y=10737418, y=0] [L45] x++ VAL [counter=36, v=-1352914668, x=0, x=375809630, x=36, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=-1352914668, x=375809630, X=2147483600, x=36, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=37, v=-1352914668, x=0, X=2147483600, x=36, x=386547048, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=37] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=37, v=-1352914668, X=2147483600, x=36, x=386547048, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=37, v=-1352914668, x=386547048, x=0, X=2147483600, x=36, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=37, v=-1331439832, X=2147483600, x=0, x=36, x=386547048, Y=10737418, y=0] [L45] x++ VAL [counter=37, v=-1331439832, X=2147483600, x=0, x=37, x=386547048, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=-1331439832, x=0, X=2147483600, x=37, x=386547048, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=38, v=-1331439832, x=0, x=37, x=397284466, X=2147483600, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=38] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=38, v=-1331439832, x=37, X=2147483600, x=0, x=397284466, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=38, v=-1331439832, x=37, x=397284466, x=0, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=38, v=-1309964996, x=37, X=2147483600, x=397284466, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=38, v=-1309964996, x=397284466, x=0, x=38, X=2147483600, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=-1309964996, X=2147483600, x=397284466, x=0, x=38, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=39, v=-1309964996, x=408021884, X=2147483600, x=0, x=38, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=39] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=39, v=-1309964996, x=0, x=38, x=408021884, X=2147483600, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=39, v=-1309964996, x=38, x=0, X=2147483600, x=408021884, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=39, v=-1288490160, X=2147483600, x=408021884, x=0, x=38, Y=10737418, y=0] [L45] x++ VAL [counter=39, v=-1288490160, x=408021884, X=2147483600, x=0, x=39, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=-1288490160, x=0, x=39, x=408021884, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=40, v=-1288490160, X=2147483600, x=0, x=39, x=418759302, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=40] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=40, v=-1288490160, x=418759302, x=0, X=2147483600, x=39, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=40, v=-1288490160, x=418759302, X=2147483600, x=39, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=40, v=-1267015324, x=0, x=418759302, X=2147483600, x=39, y=0, Y=10737418] [L45] x++ VAL [counter=40, v=-1267015324, X=2147483600, x=418759302, x=0, x=40, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=-1267015324, X=2147483600, x=40, x=418759302, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=41, v=-1267015324, X=2147483600, x=429496720, x=40, x=0, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=41] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=41, v=-1267015324, x=0, x=40, x=429496720, X=2147483600, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=41, v=-1267015324, x=429496720, X=2147483600, x=40, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=41, v=-1245540488, X=2147483600, x=429496720, x=40, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=41, v=-1245540488, x=41, x=429496720, X=2147483600, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=-1245540488, x=41, X=2147483600, x=429496720, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=42, v=-1245540488, x=41, x=0, x=440234138, X=2147483600, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=42] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=42, v=-1245540488, x=440234138, x=0, X=2147483600, x=41, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=42, v=-1245540488, x=440234138, x=41, x=0, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=42, v=-1224065652, x=440234138, x=0, x=41, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=42, v=-1224065652, x=42, x=0, x=440234138, X=2147483600, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=-1224065652, x=440234138, x=0, X=2147483600, x=42, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=43, v=-1224065652, x=450971556, x=0, X=2147483600, x=42, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=43] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=43, v=-1224065652, x=0, x=450971556, X=2147483600, x=42, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=43, v=-1224065652, x=0, X=2147483600, x=450971556, x=42, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=43, v=-1202590816, x=42, X=2147483600, x=450971556, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=43, v=-1202590816, x=43, X=2147483600, x=450971556, x=0, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=44, counter++=43, v=-1202590816, X=2147483600, x=450971556, x=0, x=43, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=44, v=-1202590816, x=461708974, x=43, X=2147483600, x=0, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=44] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=44, v=-1202590816, X=2147483600, x=43, x=0, x=461708974, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=44, v=-1202590816, x=461708974, x=0, X=2147483600, x=43, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=44, v=-1181115980, X=2147483600, x=0, x=461708974, x=43, y=0, Y=10737418] [L45] x++ VAL [counter=44, v=-1181115980, x=461708974, x=44, X=2147483600, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=-1181115980, x=0, x=44, X=2147483600, x=461708974, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=45, v=-1181115980, x=0, x=44, X=2147483600, x=472446392, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=45] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=45, v=-1181115980, x=44, x=0, x=472446392, X=2147483600, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=45, v=-1181115980, x=44, x=0, X=2147483600, x=472446392, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=45, v=-1159641144, x=0, X=2147483600, x=44, x=472446392, Y=10737418, y=0] [L45] x++ VAL [counter=45, v=-1159641144, x=0, x=472446392, x=45, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=46, counter++=45, v=-1159641144, x=472446392, x=45, X=2147483600, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=46, v=-1159641144, x=45, X=2147483600, x=0, x=483183810, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=46] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=46, v=-1159641144, X=2147483600, x=0, x=45, x=483183810, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=46, v=-1159641144, x=0, X=2147483600, x=483183810, x=45, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=46, v=-1138166308, x=483183810, x=0, X=2147483600, x=45, y=0, Y=10737418] [L45] x++ VAL [counter=46, v=-1138166308, x=0, x=46, x=483183810, X=2147483600, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=-1138166308, x=483183810, x=0, X=2147483600, x=46, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=47, v=-1138166308, x=46, X=2147483600, x=493921228, x=0, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=47] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=47, v=-1138166308, x=0, x=493921228, X=2147483600, x=46, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=47, v=-1138166308, x=493921228, x=46, x=0, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=47, v=-1116691472, x=46, X=2147483600, x=493921228, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=47, v=-1116691472, X=2147483600, x=493921228, x=47, x=0, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=-1116691472, X=2147483600, x=493921228, x=47, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=48, v=-1116691472, x=0, x=504658646, x=47, X=2147483600, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=48] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=48, v=-1116691472, X=2147483600, x=504658646, x=0, x=47, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=48, v=-1116691472, x=504658646, X=2147483600, x=47, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=48, v=-1095216636, x=47, x=0, x=504658646, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=48, v=-1095216636, X=2147483600, x=504658646, x=48, x=0, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=-1095216636, x=0, x=48, X=2147483600, x=504658646, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=49, v=-1095216636, x=515396064, X=2147483600, x=48, x=0, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=49] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=49, v=-1095216636, x=0, x=48, x=515396064, X=2147483600, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=49, v=-1095216636, X=2147483600, x=48, x=0, x=515396064, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=49, v=-1073741800, x=48, x=0, x=515396064, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=49, v=-1073741800, x=515396064, x=0, X=2147483600, x=49, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=50, counter++=49, v=-1073741800, x=49, x=515396064, x=0, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=50, v=-1073741800, x=0, x=526133482, x=49, X=2147483600, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=50] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=50, v=-1073741800, x=0, x=49, X=2147483600, x=526133482, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=50, v=-1073741800, x=0, X=2147483600, x=49, x=526133482, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=50, v=-1052266964, x=49, x=0, x=526133482, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=50, v=-1052266964, x=50, X=2147483600, x=526133482, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=-1052266964, x=50, x=526133482, x=0, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=51, v=-1052266964, X=2147483600, x=50, x=536870900, x=0, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=51] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=51, v=-1052266964, X=2147483600, x=536870900, x=50, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=51, v=-1052266964, X=2147483600, x=50, x=0, x=536870900, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=51, v=-1030792128, x=0, x=50, X=2147483600, x=536870900, Y=10737418, y=0] [L45] x++ VAL [counter=51, v=-1030792128, x=536870900, X=2147483600, x=51, x=0, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=52, counter++=51, v=-1030792128, x=51, x=0, x=536870900, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=52, v=-1030792128, x=547608318, x=51, X=2147483600, x=0, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=52] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=52, v=-1030792128, X=2147483600, x=51, x=0, x=547608318, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=52, v=-1030792128, x=51, x=0, X=2147483600, x=547608318, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=52, v=-1009317292, x=547608318, X=2147483600, x=0, x=51, Y=10737418, y=0] [L45] x++ VAL [counter=52, v=-1009317292, x=547608318, x=52, x=0, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=53, counter++=52, v=-1009317292, x=0, x=52, x=547608318, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=53, v=-1009317292, x=52, X=2147483600, x=558345736, x=0, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=53] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=53, v=-1009317292, X=2147483600, x=52, x=558345736, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=53, v=-1009317292, x=0, X=2147483600, x=52, x=558345736, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=53, v=-987842456, x=0, x=558345736, X=2147483600, x=52, Y=10737418, y=0] [L45] x++ VAL [counter=53, v=-987842456, X=2147483600, x=0, x=53, x=558345736, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=54, counter++=53, v=-987842456, x=558345736, X=2147483600, x=0, x=53, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=54, v=-987842456, X=2147483600, x=53, x=0, x=569083154, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=54] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=54, v=-987842456, X=2147483600, x=53, x=569083154, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=54, v=-987842456, x=569083154, x=53, x=0, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=54, v=-966367620, x=0, x=569083154, x=53, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=54, v=-966367620, x=54, x=569083154, x=0, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=55, counter++=54, v=-966367620, X=2147483600, x=54, x=569083154, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=55, v=-966367620, x=0, X=2147483600, x=579820572, x=54, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=55] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=55, v=-966367620, x=0, X=2147483600, x=579820572, x=54, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=55, v=-966367620, x=0, X=2147483600, x=54, x=579820572, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=55, v=-944892784, x=0, x=579820572, x=54, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=55, v=-944892784, x=55, X=2147483600, x=0, x=579820572, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=56, counter++=55, v=-944892784, x=55, X=2147483600, x=0, x=579820572, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=56, v=-944892784, x=0, X=2147483600, x=590557990, x=55, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=56] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=56, v=-944892784, X=2147483600, x=55, x=590557990, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=56, v=-944892784, x=590557990, x=55, X=2147483600, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=56, v=-923417948, x=55, x=0, x=590557990, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=56, v=-923417948, X=2147483600, x=590557990, x=0, x=56, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=57, counter++=56, v=-923417948, X=2147483600, x=56, x=590557990, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=57, v=-923417948, x=56, X=2147483600, x=0, x=601295408, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=57] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=57, v=-923417948, x=0, X=2147483600, x=601295408, x=56, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=57, v=-923417948, X=2147483600, x=0, x=56, x=601295408, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=57, v=-901943112, x=56, x=601295408, X=2147483600, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=57, v=-901943112, X=2147483600, x=601295408, x=0, x=57, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=58, counter++=57, v=-901943112, x=0, x=57, x=601295408, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=58, v=-901943112, x=0, x=57, x=612032826, X=2147483600, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=58] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=58, v=-901943112, X=2147483600, x=0, x=612032826, x=57, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=58, v=-901943112, X=2147483600, x=612032826, x=57, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=58, v=-880468276, x=612032826, X=2147483600, x=0, x=57, y=0, Y=10737418] [L45] x++ VAL [counter=58, v=-880468276, x=612032826, x=0, X=2147483600, x=58, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=59, counter++=58, v=-880468276, x=0, x=58, X=2147483600, x=612032826, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=59, v=-880468276, x=58, x=0, X=2147483600, x=622770244, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=59] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=59, v=-880468276, x=0, x=58, x=622770244, X=2147483600, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=59, v=-880468276, X=2147483600, x=622770244, x=58, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=59, v=-858993440, x=622770244, X=2147483600, x=58, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=59, v=-858993440, x=59, x=622770244, X=2147483600, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=60, counter++=59, v=-858993440, x=0, X=2147483600, x=622770244, x=59, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=60, v=-858993440, x=633507662, x=0, x=59, X=2147483600, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=60] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=60, v=-858993440, X=2147483600, x=59, x=633507662, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=60, v=-858993440, x=59, x=633507662, x=0, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=60, v=-837518604, X=2147483600, x=633507662, x=0, x=59, Y=10737418, y=0] [L45] x++ VAL [counter=60, v=-837518604, X=2147483600, x=60, x=633507662, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=61, counter++=60, v=-837518604, x=60, x=0, X=2147483600, x=633507662, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=61, v=-837518604, X=2147483600, x=644245080, x=0, x=60, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=61] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=61, v=-837518604, x=644245080, X=2147483600, x=60, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=61, v=-837518604, X=2147483600, x=0, x=60, x=644245080, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=61, v=-816043768, x=0, x=644245080, x=60, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=61, v=-816043768, X=2147483600, x=61, x=0, x=644245080, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=62, counter++=61, v=-816043768, x=644245080, x=0, x=61, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=62, v=-816043768, x=654982498, X=2147483600, x=61, x=0, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=62] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=62, v=-816043768, x=0, x=61, x=654982498, X=2147483600, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=62, v=-816043768, x=654982498, x=61, x=0, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=62, v=-794568932, x=654982498, x=0, X=2147483600, x=61, y=0, Y=10737418] [L45] x++ VAL [counter=62, v=-794568932, X=2147483600, x=62, x=0, x=654982498, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=63, counter++=62, v=-794568932, x=0, x=654982498, X=2147483600, x=62, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=63, v=-794568932, x=0, x=62, x=665719916, X=2147483600, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=63] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=63, v=-794568932, x=62, X=2147483600, x=665719916, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=63, v=-794568932, x=0, X=2147483600, x=62, x=665719916, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=63, v=-773094096, X=2147483600, x=62, x=0, x=665719916, Y=10737418, y=0] [L45] x++ VAL [counter=63, v=-773094096, x=665719916, X=2147483600, x=0, x=63, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=64, counter++=63, v=-773094096, X=2147483600, x=665719916, x=63, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=64, v=-773094096, x=63, x=676457334, X=2147483600, x=0, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=64] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=64, v=-773094096, x=63, x=676457334, X=2147483600, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=64, v=-773094096, x=676457334, x=0, x=63, X=2147483600, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=64, v=-751619260, X=2147483600, x=63, x=676457334, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=64, v=-751619260, x=0, x=64, x=676457334, X=2147483600, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=65, counter++=64, v=-751619260, x=64, X=2147483600, x=0, x=676457334, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=65, v=-751619260, x=687194752, x=0, x=64, X=2147483600, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=65] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=65, v=-751619260, X=2147483600, x=0, x=687194752, x=64, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=65, v=-751619260, x=64, x=0, x=687194752, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=65, v=-730144424, X=2147483600, x=64, x=0, x=687194752, Y=10737418, y=0] [L45] x++ VAL [counter=65, v=-730144424, x=687194752, x=0, X=2147483600, x=65, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=66, counter++=65, v=-730144424, X=2147483600, x=0, x=687194752, x=65, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=66, v=-730144424, X=2147483600, x=0, x=65, x=697932170, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=66] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=66, v=-730144424, x=0, x=65, x=697932170, X=2147483600, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=66, v=-730144424, x=0, X=2147483600, x=65, x=697932170, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=66, v=-708669588, x=65, X=2147483600, x=697932170, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=66, v=-708669588, X=2147483600, x=697932170, x=66, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=67, counter++=66, v=-708669588, x=66, x=0, X=2147483600, x=697932170, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=67, v=-708669588, X=2147483600, x=708669588, x=66, x=0, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=67] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=67, v=-708669588, x=708669588, x=66, x=0, X=2147483600, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=67, v=-708669588, x=66, x=708669588, X=2147483600, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=67, v=-687194752, x=0, X=2147483600, x=66, x=708669588, y=0, Y=10737418] [L45] x++ VAL [counter=67, v=-687194752, X=2147483600, x=67, x=0, x=708669588, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=68, counter++=67, v=-687194752, X=2147483600, x=0, x=67, x=708669588, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=68, v=-687194752, x=67, x=0, X=2147483600, x=719407006, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=68] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=68, v=-687194752, x=719407006, x=67, X=2147483600, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=68, v=-687194752, X=2147483600, x=0, x=719407006, x=67, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=68, v=-665719916, X=2147483600, x=719407006, x=0, x=67, y=0, Y=10737418] [L45] x++ VAL [counter=68, v=-665719916, X=2147483600, x=68, x=0, x=719407006, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=69, counter++=68, v=-665719916, x=0, x=719407006, x=68, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=69, v=-665719916, x=0, X=2147483600, x=730144424, x=68, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=69] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=69, v=-665719916, x=730144424, x=68, X=2147483600, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=69, v=-665719916, x=0, x=730144424, x=68, X=2147483600, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=69, v=-644245080, x=0, X=2147483600, x=730144424, x=68, y=0, Y=10737418] [L45] x++ VAL [counter=69, v=-644245080, x=0, x=69, X=2147483600, x=730144424, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=70, counter++=69, v=-644245080, x=730144424, X=2147483600, x=69, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=70, v=-644245080, x=740881842, x=69, x=0, X=2147483600, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=70] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=70, v=-644245080, x=69, X=2147483600, x=0, x=740881842, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=70, v=-644245080, X=2147483600, x=740881842, x=0, x=69, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=70, v=-622770244, X=2147483600, x=740881842, x=0, x=69, y=0, Y=10737418] [L45] x++ VAL [counter=70, v=-622770244, x=0, x=70, X=2147483600, x=740881842, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=71, counter++=70, v=-622770244, X=2147483600, x=740881842, x=70, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=71, v=-622770244, X=2147483600, x=70, x=751619260, x=0, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=71] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=71, v=-622770244, X=2147483600, x=70, x=0, x=751619260, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=71, v=-622770244, X=2147483600, x=70, x=0, x=751619260, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=71, v=-601295408, x=70, X=2147483600, x=751619260, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=71, v=-601295408, x=71, x=0, X=2147483600, x=751619260, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=72, counter++=71, v=-601295408, x=0, x=751619260, x=71, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=72, v=-601295408, x=71, x=0, X=2147483600, x=762356678, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=72] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=72, v=-601295408, x=762356678, x=71, x=0, X=2147483600, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=72, v=-601295408, x=762356678, x=0, X=2147483600, x=71, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=72, v=-579820572, x=0, x=71, X=2147483600, x=762356678, y=0, Y=10737418] [L45] x++ VAL [counter=72, v=-579820572, x=762356678, x=72, X=2147483600, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=73, counter++=72, v=-579820572, x=0, X=2147483600, x=72, x=762356678, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=73, v=-579820572, x=72, x=0, x=773094096, X=2147483600, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=73] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=73, v=-579820572, X=2147483600, x=0, x=773094096, x=72, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=73, v=-579820572, x=773094096, X=2147483600, x=0, x=72, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=73, v=-558345736, x=72, x=0, x=773094096, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=73, v=-558345736, x=73, x=0, x=773094096, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=74, counter++=73, v=-558345736, x=773094096, x=73, x=0, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=74, v=-558345736, x=0, X=2147483600, x=783831514, x=73, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=74] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=74, v=-558345736, x=783831514, x=0, X=2147483600, x=73, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=74, v=-558345736, X=2147483600, x=783831514, x=0, x=73, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=74, v=-536870900, x=783831514, X=2147483600, x=0, x=73, y=0, Y=10737418] [L45] x++ VAL [counter=74, v=-536870900, x=0, x=783831514, x=74, X=2147483600, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=75, counter++=74, v=-536870900, x=783831514, x=74, X=2147483600, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=75, v=-536870900, x=794568932, X=2147483600, x=0, x=74, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=75] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=75, v=-536870900, X=2147483600, x=0, x=794568932, x=74, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=75, v=-536870900, x=0, x=74, X=2147483600, x=794568932, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=75, v=-515396064, x=794568932, x=0, x=74, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=75, v=-515396064, X=2147483600, x=0, x=75, x=794568932, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=76, counter++=75, v=-515396064, x=794568932, x=75, x=0, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=76, v=-515396064, X=2147483600, x=805306350, x=0, x=75, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=76] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=76, v=-515396064, x=805306350, x=75, X=2147483600, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=76, v=-515396064, X=2147483600, x=805306350, x=75, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=76, v=-493921228, x=75, X=2147483600, x=805306350, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=76, v=-493921228, x=76, X=2147483600, x=805306350, x=0, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=77, counter++=76, v=-493921228, x=805306350, x=76, X=2147483600, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=77, v=-493921228, x=816043768, x=0, x=76, X=2147483600, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=77] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=77, v=-493921228, x=76, X=2147483600, x=816043768, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=77, v=-493921228, x=0, X=2147483600, x=816043768, x=76, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=77, v=-472446392, x=76, x=0, x=816043768, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=77, v=-472446392, x=816043768, x=77, x=0, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=78, counter++=77, v=-472446392, X=2147483600, x=0, x=816043768, x=77, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=78, v=-472446392, x=0, X=2147483600, x=826781186, x=77, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=78] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=78, v=-472446392, x=826781186, x=0, x=77, X=2147483600, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=78, v=-472446392, X=2147483600, x=826781186, x=0, x=77, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=78, v=-450971556, X=2147483600, x=826781186, x=77, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=78, v=-450971556, X=2147483600, x=826781186, x=78, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=79, counter++=78, v=-450971556, x=78, x=0, X=2147483600, x=826781186, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=79, v=-450971556, x=837518604, x=78, X=2147483600, x=0, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=79] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=79, v=-450971556, x=78, x=0, x=837518604, X=2147483600, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=79, v=-450971556, x=837518604, X=2147483600, x=78, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=79, v=-429496720, X=2147483600, x=837518604, x=0, x=78, y=0, Y=10737418] [L45] x++ VAL [counter=79, v=-429496720, x=79, x=837518604, X=2147483600, x=0, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=80, counter++=79, v=-429496720, x=837518604, x=0, X=2147483600, x=79, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=80, v=-429496720, x=0, x=79, x=848256022, X=2147483600, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=80] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=80, v=-429496720, x=848256022, x=0, x=79, X=2147483600, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=80, v=-429496720, x=848256022, x=0, X=2147483600, x=79, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=80, v=-408021884, x=79, x=848256022, X=2147483600, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=80, v=-408021884, x=80, X=2147483600, x=848256022, x=0, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=81, counter++=80, v=-408021884, x=80, X=2147483600, x=0, x=848256022, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=81, v=-408021884, x=858993440, x=80, X=2147483600, x=0, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=81] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=81, v=-408021884, X=2147483600, x=858993440, x=80, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=81, v=-408021884, x=0, x=858993440, x=80, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=81, v=-386547048, x=858993440, x=0, X=2147483600, x=80, y=0, Y=10737418] [L45] x++ VAL [counter=81, v=-386547048, X=2147483600, x=0, x=858993440, x=81, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=82, counter++=81, v=-386547048, x=81, x=858993440, x=0, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=82, v=-386547048, x=869730858, x=81, X=2147483600, x=0, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=82] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=82, v=-386547048, x=0, X=2147483600, x=81, x=869730858, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=82, v=-386547048, x=869730858, x=81, X=2147483600, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=82, v=-365072212, x=869730858, X=2147483600, x=81, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=82, v=-365072212, x=0, x=869730858, X=2147483600, x=82, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=83, counter++=82, v=-365072212, X=2147483600, x=0, x=869730858, x=82, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=83, v=-365072212, X=2147483600, x=0, x=880468276, x=82, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=83] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=83, v=-365072212, x=0, X=2147483600, x=880468276, x=82, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=83, v=-365072212, x=880468276, x=82, x=0, X=2147483600, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=83, v=-343597376, x=82, x=880468276, X=2147483600, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=83, v=-343597376, x=0, X=2147483600, x=83, x=880468276, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=84, counter++=83, v=-343597376, x=83, x=880468276, X=2147483600, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=84, v=-343597376, x=83, x=0, x=891205694, X=2147483600, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=84] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=84, v=-343597376, x=0, x=83, X=2147483600, x=891205694, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=84, v=-343597376, x=83, x=0, X=2147483600, x=891205694, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=84, v=-322122540, x=0, x=83, x=891205694, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=84, v=-322122540, x=84, X=2147483600, x=0, x=891205694, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=85, counter++=84, v=-322122540, x=891205694, x=84, x=0, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=85, v=-322122540, x=901943112, X=2147483600, x=84, x=0, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=85] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=85, v=-322122540, x=84, x=901943112, X=2147483600, x=0, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=85, v=-322122540, X=2147483600, x=0, x=84, x=901943112, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=85, v=-300647704, x=84, x=0, X=2147483600, x=901943112, y=0, Y=10737418] [L45] x++ VAL [counter=85, v=-300647704, x=901943112, X=2147483600, x=0, x=85, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=86, counter++=85, v=-300647704, x=85, x=901943112, X=2147483600, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=86, v=-300647704, x=912680530, x=0, X=2147483600, x=85, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=86] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=86, v=-300647704, x=912680530, X=2147483600, x=85, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=86, v=-300647704, x=85, x=0, x=912680530, X=2147483600, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=86, v=-279172868, x=0, X=2147483600, x=85, x=912680530, y=0, Y=10737418] [L45] x++ VAL [counter=86, v=-279172868, x=86, X=2147483600, x=912680530, x=0, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=87, counter++=86, v=-279172868, x=912680530, x=0, X=2147483600, x=86, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=87, v=-279172868, X=2147483600, x=86, x=0, x=923417948, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=87] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=87, v=-279172868, x=0, x=86, X=2147483600, x=923417948, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=87, v=-279172868, x=0, X=2147483600, x=923417948, x=86, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=87, v=-257698032, x=0, X=2147483600, x=86, x=923417948, y=0, Y=10737418] [L45] x++ VAL [counter=87, v=-257698032, x=923417948, x=87, X=2147483600, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=88, counter++=87, v=-257698032, x=923417948, x=87, x=0, X=2147483600, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=88, v=-257698032, x=0, X=2147483600, x=934155366, x=87, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=88] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=88, v=-257698032, x=87, X=2147483600, x=0, x=934155366, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=88, v=-257698032, x=934155366, X=2147483600, x=0, x=87, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=88, v=-236223196, x=0, x=934155366, x=87, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=88, v=-236223196, X=2147483600, x=88, x=0, x=934155366, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=89, counter++=88, v=-236223196, x=88, x=934155366, X=2147483600, x=0, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=89, v=-236223196, X=2147483600, x=88, x=0, x=944892784, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=89] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=89, v=-236223196, x=944892784, x=0, X=2147483600, x=88, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=89, v=-236223196, x=88, x=944892784, X=2147483600, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=89, v=-214748360, x=88, x=944892784, X=2147483600, x=0, Y=10737418, y=0] [L45] x++ VAL [counter=89, v=-214748360, x=0, x=944892784, X=2147483600, x=89, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=90, counter++=89, v=-214748360, x=0, X=2147483600, x=89, x=944892784, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=90, v=-214748360, X=2147483600, x=0, x=89, x=955630202, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=90] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=90, v=-214748360, x=0, x=955630202, X=2147483600, x=89, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=90, v=-214748360, x=0, x=89, X=2147483600, x=955630202, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=90, v=-193273524, X=2147483600, x=89, x=955630202, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=90, v=-193273524, x=90, x=955630202, X=2147483600, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=91, counter++=90, v=-193273524, x=955630202, X=2147483600, x=0, x=90, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=91, v=-193273524, x=90, x=0, x=966367620, X=2147483600, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=91] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=91, v=-193273524, x=0, x=966367620, X=2147483600, x=90, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=91, v=-193273524, X=2147483600, x=0, x=966367620, x=90, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=91, v=-171798688, X=2147483600, x=90, x=0, x=966367620, Y=10737418, y=0] [L45] x++ VAL [counter=91, v=-171798688, x=91, x=966367620, x=0, X=2147483600, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=92, counter++=91, v=-171798688, X=2147483600, x=0, x=966367620, x=91, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=92, v=-171798688, x=0, x=977105038, X=2147483600, x=91, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=92] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=92, v=-171798688, x=91, X=2147483600, x=0, x=977105038, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=92, v=-171798688, x=0, x=91, X=2147483600, x=977105038, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=92, v=-150323852, x=0, x=977105038, X=2147483600, x=91, Y=10737418, y=0] [L45] x++ VAL [counter=92, v=-150323852, X=2147483600, x=977105038, x=0, x=92, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=93, counter++=92, v=-150323852, x=977105038, X=2147483600, x=0, x=92, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=93, v=-150323852, x=92, x=0, x=987842456, X=2147483600, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=93] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=93, v=-150323852, x=987842456, X=2147483600, x=0, x=92, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=93, v=-150323852, x=987842456, x=92, X=2147483600, x=0, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=93, v=-128849016, x=987842456, X=2147483600, x=92, x=0, y=0, Y=10737418] [L45] x++ VAL [counter=93, v=-128849016, X=2147483600, x=987842456, x=0, x=93, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=94, counter++=93, v=-128849016, x=93, X=2147483600, x=0, x=987842456, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=94, v=-128849016, x=0, x=998579874, X=2147483600, x=93, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=94] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=94, v=-128849016, x=0, X=2147483600, x=998579874, x=93, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=94, v=-128849016, x=0, X=2147483600, x=998579874, x=93, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=94, v=-107374180, x=998579874, X=2147483600, x=0, x=93, y=0, Y=10737418] [L45] x++ VAL [counter=94, v=-107374180, x=0, x=998579874, X=2147483600, x=94, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=95, counter++=94, v=-107374180, X=2147483600, x=998579874, x=0, x=94, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=95, v=-107374180, x=1009317292, X=2147483600, x=0, x=94, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=95] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=95, v=-107374180, X=2147483600, x=1009317292, x=94, x=0, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=95, v=-107374180, x=1009317292, x=94, X=2147483600, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=95, v=-85899344, X=2147483600, x=94, x=0, x=1009317292, Y=10737418, y=0] [L45] x++ VAL [counter=95, v=-85899344, x=1009317292, x=95, X=2147483600, x=0, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=96, counter++=95, v=-85899344, x=0, x=95, x=1009317292, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=96, v=-85899344, x=0, X=2147483600, x=1020054710, x=95, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=96] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=96, v=-85899344, x=0, x=95, x=1020054710, X=2147483600, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=96, v=-85899344, x=1020054710, X=2147483600, x=95, x=0, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=96, v=-64424508, x=0, x=1020054710, x=95, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=96, v=-64424508, x=1020054710, X=2147483600, x=0, x=96, y=0, Y=10737418] [L31] EXPR counter++ VAL [counter=97, counter++=96, v=-64424508, x=1020054710, x=0, x=96, X=2147483600, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=97, v=-64424508, x=96, X=2147483600, x=0, x=1030792128, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=97] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=97, v=-64424508, X=2147483600, x=96, x=0, x=1030792128, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=97, v=-64424508, x=1030792128, x=0, X=2147483600, x=96, y=0, Y=10737418] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=97, v=-42949672, x=96, x=0, x=1030792128, X=2147483600, Y=10737418, y=0] [L45] x++ VAL [counter=97, v=-42949672, x=1030792128, x=97, X=2147483600, x=0, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=98, counter++=97, v=-42949672, x=97, x=0, X=2147483600, x=1030792128, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=98, v=-42949672, x=1041529546, x=0, X=2147483600, x=97, y=0, Y=10737418] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=98] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=98, v=-42949672, X=2147483600, x=97, x=0, x=1041529546, y=0, Y=10737418] [L35] COND FALSE !(!(x <= X)) VAL [counter=98, v=-42949672, x=1041529546, X=2147483600, x=0, x=97, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=98, v=-21474836, X=2147483600, x=97, x=0, x=1041529546, Y=10737418, y=0] [L45] x++ VAL [counter=98, v=-21474836, X=2147483600, x=98, x=0, x=1041529546, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=99, counter++=98, v=-21474836, x=98, X=2147483600, x=1041529546, x=0, y=0, Y=10737418] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=99, v=-21474836, x=98, x=0, X=2147483600, x=1052266964, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=99] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=99, v=-21474836, x=0, X=2147483600, x=1052266964, x=98, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=99, v=-21474836, x=1052266964, X=2147483600, x=0, x=98, Y=10737418, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=99, v=0, x=1052266964, x=0, x=98, X=2147483600, y=0, Y=10737418] [L45] x++ VAL [counter=99, v=0, X=2147483600, x=0, x=99, x=1052266964, Y=10737418, y=0] [L31] EXPR counter++ VAL [counter=100, counter++=99, v=0, x=0, x=99, X=2147483600, x=1052266964, Y=10737418, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=100, v=0, x=1063004382, x=0, x=99, X=2147483600, Y=10737418, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=100] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=100, v=0, x=0, x=99, X=2147483600, x=1063004382, Y=10737418, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=100, v=0, x=0, x=99, X=2147483600, x=1063004382, y=0, Y=10737418] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=100, v=-4273492364, x=99, X=2147483600, x=1063004382, x=0, Y=10737418, y=1] [L45] x++ VAL [counter=100, v=-4273492364, x=1063004382, x=0, X=2147483600, x=100, y=1, Y=10737418] [L31] EXPR counter++ VAL [counter=101, counter++=100, v=-4273492364, x=100, x=0, x=1063004382, X=2147483600, y=1, Y=10737418] [L31] COND FALSE !(counter++<100) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=101, v=-4273492364, X=2147483600, x=1073741800, x=100, x=100, y=1, Y=10737418] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=101] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=101] [L16] reach_error() VAL [\old(cond)=0, cond=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.9s, OverallIterations: 11, TraceHistogramMax: 101, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1735 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1734 mSDsluCounter, 3249 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2839 mSDsCounter, 209 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2808 IncrementalHoareTripleChecker+Invalid, 3017 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 209 mSolverCounterUnsat, 410 mSDtfsCounter, 2808 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4479 GetRequests, 3740 SyntacticMatches, 98 SemanticMatches, 641 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17049 ImplicationChecksByTransitivity, 16.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2000occurred in iteration=10, InterpolantAutomatonStates: 621, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 34 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 3113 NumberOfCodeBlocks, 2903 NumberOfCodeBlocksAsserted, 109 NumberOfCheckSat, 4181 ConstructedInterpolants, 5 QuantifiedInterpolants, 17129 SizeOfPredicates, 209 NumberOfNonLiveVariables, 4894 ConjunctsInSsa, 467 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 28148/120006 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 proved your program to be incorrect! [2023-02-17 06:51:36,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE