./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 26d01a9c 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-?-26d01a9 [2023-02-18 01:15:14,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 01:15:14,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 01:15:14,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 01:15:14,296 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 01:15:14,296 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 01:15:14,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 01:15:14,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 01:15:14,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 01:15:14,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 01:15:14,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 01:15:14,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 01:15:14,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 01:15:14,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 01:15:14,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 01:15:14,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 01:15:14,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 01:15:14,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 01:15:14,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 01:15:14,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 01:15:14,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 01:15:14,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 01:15:14,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 01:15:14,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 01:15:14,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 01:15:14,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 01:15:14,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 01:15:14,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 01:15:14,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 01:15:14,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 01:15:14,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 01:15:14,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 01:15:14,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 01:15:14,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 01:15:14,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 01:15:14,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 01:15:14,345 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 01:15:14,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 01:15:14,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 01:15:14,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 01:15:14,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 01:15:14,348 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 01:15:14,367 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 01:15:14,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 01:15:14,368 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 01:15:14,368 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 01:15:14,369 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 01:15:14,369 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 01:15:14,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 01:15:14,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 01:15:14,369 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 01:15:14,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 01:15:14,370 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 01:15:14,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 01:15:14,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 01:15:14,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 01:15:14,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 01:15:14,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 01:15:14,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 01:15:14,371 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 01:15:14,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 01:15:14,371 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 01:15:14,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 01:15:14,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 01:15:14,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 01:15:14,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 01:15:14,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 01:15:14,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 01:15:14,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 01:15:14,372 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 01:15:14,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 01:15:14,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 01:15:14,373 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 01:15:14,373 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 01:15:14,373 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 01:15:14,373 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 01:15:14,373 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 01:15:14,373 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-18 01:15:14,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 01:15:14,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 01:15:14,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 01:15:14,564 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 01:15:14,564 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 01:15:14,565 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-18 01:15:15,571 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 01:15:15,701 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 01:15:15,702 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2023-02-18 01:15:15,705 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a609e5e/0f28629c183a46d6b6c575419b4a03c1/FLAG9a89e250e [2023-02-18 01:15:15,714 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a609e5e/0f28629c183a46d6b6c575419b4a03c1 [2023-02-18 01:15:15,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 01:15:15,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 01:15:15,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 01:15:15,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 01:15:15,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 01:15:15,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:15:15" (1/1) ... [2023-02-18 01:15:15,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e52b8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:15, skipping insertion in model container [2023-02-18 01:15:15,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:15:15" (1/1) ... [2023-02-18 01:15:15,726 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 01:15:15,735 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 01:15:15,814 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-18 01:15:15,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 01:15:15,831 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 01:15:15,837 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-18 01:15:15,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 01:15:15,851 INFO L208 MainTranslator]: Completed translation [2023-02-18 01:15:15,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:15 WrapperNode [2023-02-18 01:15:15,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 01:15:15,853 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 01:15:15,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 01:15:15,853 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 01:15:15,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:15" (1/1) ... [2023-02-18 01:15:15,861 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:15" (1/1) ... [2023-02-18 01:15:15,870 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2023-02-18 01:15:15,870 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 01:15:15,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 01:15:15,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 01:15:15,871 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 01:15:15,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:15" (1/1) ... [2023-02-18 01:15:15,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:15" (1/1) ... [2023-02-18 01:15:15,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:15" (1/1) ... [2023-02-18 01:15:15,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:15" (1/1) ... [2023-02-18 01:15:15,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:15" (1/1) ... [2023-02-18 01:15:15,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:15" (1/1) ... [2023-02-18 01:15:15,881 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:15" (1/1) ... [2023-02-18 01:15:15,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:15" (1/1) ... [2023-02-18 01:15:15,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 01:15:15,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 01:15:15,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 01:15:15,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 01:15:15,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:15" (1/1) ... [2023-02-18 01:15:15,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 01:15:15,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:15:15,906 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-18 01:15:15,914 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-18 01:15:15,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 01:15:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 01:15:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 01:15:15,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 01:15:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 01:15:15,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 01:15:15,986 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 01:15:15,987 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 01:15:16,108 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 01:15:16,112 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 01:15:16,112 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 01:15:16,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:15:16 BoogieIcfgContainer [2023-02-18 01:15:16,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 01:15:16,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 01:15:16,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 01:15:16,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 01:15:16,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 01:15:15" (1/3) ... [2023-02-18 01:15:16,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557949d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:15:16, skipping insertion in model container [2023-02-18 01:15:16,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:15" (2/3) ... [2023-02-18 01:15:16,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557949d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:15:16, skipping insertion in model container [2023-02-18 01:15:16,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:15:16" (3/3) ... [2023-02-18 01:15:16,127 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2023-02-18 01:15:16,141 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 01:15:16,142 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 01:15:16,184 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 01:15:16,189 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;@1c867a3f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 01:15:16,189 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 01:15:16,192 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-18 01:15:16,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-18 01:15:16,197 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:15:16,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:15:16,198 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:15:16,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:15:16,203 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2023-02-18 01:15:16,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:15:16,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967037235] [2023-02-18 01:15:16,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:16,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:15:16,284 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:15:16,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1191751319] [2023-02-18 01:15:16,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:16,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:15:16,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:15:16,287 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-18 01:15:16,289 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-18 01:15:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:15:16,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-18 01:15:16,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:15:16,404 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-18 01:15:16,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 01:15:16,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:15:16,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967037235] [2023-02-18 01:15:16,405 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:15:16,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191751319] [2023-02-18 01:15:16,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191751319] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 01:15:16,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 01:15:16,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 01:15:16,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577118468] [2023-02-18 01:15:16,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:15:16,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 01:15:16,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:15:16,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 01:15:16,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 01:15:16,427 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-18 01:15:16,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:15:16,512 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2023-02-18 01:15:16,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 01:15:16,513 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-18 01:15:16,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:15:16,518 INFO L225 Difference]: With dead ends: 54 [2023-02-18 01:15:16,518 INFO L226 Difference]: Without dead ends: 25 [2023-02-18 01:15:16,520 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-18 01:15:16,527 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-18 01:15:16,528 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-18 01:15:16,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-18 01:15:16,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-02-18 01:15:16,549 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-18 01:15:16,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-02-18 01:15:16,551 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2023-02-18 01:15:16,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:15:16,551 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-02-18 01:15:16,551 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-18 01:15:16,552 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-02-18 01:15:16,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-18 01:15:16,552 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:15:16,552 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:15:16,570 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-18 01:15:16,757 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-18 01:15:16,758 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:15:16,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:15:16,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2023-02-18 01:15:16,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:15:16,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288288822] [2023-02-18 01:15:16,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:16,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:15:16,780 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:15:16,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [786248862] [2023-02-18 01:15:16,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:16,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:15:16,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:15:16,784 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-18 01:15:16,796 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-18 01:15:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:15:16,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-18 01:15:16,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:15:16,971 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-18 01:15:16,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:15:17,149 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-18 01:15:17,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:15:17,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288288822] [2023-02-18 01:15:17,149 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:15:17,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786248862] [2023-02-18 01:15:17,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786248862] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:15:17,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:15:17,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2023-02-18 01:15:17,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430100052] [2023-02-18 01:15:17,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:15:17,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 01:15:17,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:15:17,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 01:15:17,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-02-18 01:15:17,165 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 17 states, 13 states have (on average 2.076923076923077) internal successors, (27), 16 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-18 01:15:17,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:15:17,390 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2023-02-18 01:15:17,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 01:15:17,390 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.076923076923077) internal successors, (27), 16 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-18 01:15:17,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:15:17,391 INFO L225 Difference]: With dead ends: 42 [2023-02-18 01:15:17,391 INFO L226 Difference]: Without dead ends: 35 [2023-02-18 01:15:17,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2023-02-18 01:15:17,392 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:15:17,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 50 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:15:17,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-18 01:15:17,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2023-02-18 01:15:17,397 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-18 01:15:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-02-18 01:15:17,398 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2023-02-18 01:15:17,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:15:17,398 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-02-18 01:15:17,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.076923076923077) internal successors, (27), 16 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-18 01:15:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-02-18 01:15:17,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 01:15:17,400 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:15:17,400 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:15:17,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 01:15:17,605 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-18 01:15:17,605 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:15:17,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:15:17,605 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2023-02-18 01:15:17,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:15:17,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892675121] [2023-02-18 01:15:17,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:17,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:15:17,617 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:15:17,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [944686863] [2023-02-18 01:15:17,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:17,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:15:17,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:15:17,640 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-18 01:15:17,641 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-18 01:15:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:15:17,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 01:15:17,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:15:17,702 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-18 01:15:17,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:15:17,714 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-18 01:15:17,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:15:17,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892675121] [2023-02-18 01:15:17,715 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:15:17,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944686863] [2023-02-18 01:15:17,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944686863] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:15:17,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:15:17,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-02-18 01:15:17,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576948523] [2023-02-18 01:15:17,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:15:17,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 01:15:17,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:15:17,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 01:15:17,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-18 01:15:17,716 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-18 01:15:17,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:15:17,753 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2023-02-18 01:15:17,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 01:15:17,754 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-18 01:15:17,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:15:17,754 INFO L225 Difference]: With dead ends: 73 [2023-02-18 01:15:17,754 INFO L226 Difference]: Without dead ends: 67 [2023-02-18 01:15:17,755 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-18 01:15:17,755 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 01:15:17,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 86 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 01:15:17,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-18 01:15:17,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2023-02-18 01:15:17,762 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-18 01:15:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2023-02-18 01:15:17,762 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2023-02-18 01:15:17,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:15:17,763 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2023-02-18 01:15:17,763 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-18 01:15:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2023-02-18 01:15:17,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-18 01:15:17,763 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:15:17,763 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:15:17,770 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-18 01:15:17,968 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-18 01:15:17,968 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:15:17,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:15:17,969 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2023-02-18 01:15:17,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:15:17,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986989459] [2023-02-18 01:15:17,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:17,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:15:17,976 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:15:17,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1362174726] [2023-02-18 01:15:17,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:17,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:15:17,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:15:17,977 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-18 01:15:17,979 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-18 01:15:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:15:18,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-18 01:15:18,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:15:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 01:15:18,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:15:18,322 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-18 01:15:18,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:15:18,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986989459] [2023-02-18 01:15:18,323 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:15:18,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362174726] [2023-02-18 01:15:18,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362174726] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:15:18,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:15:18,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2023-02-18 01:15:18,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421281956] [2023-02-18 01:15:18,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:15:18,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-18 01:15:18,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:15:18,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-18 01:15:18,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-02-18 01:15:18,325 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-18 01:15:18,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:15:18,926 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2023-02-18 01:15:18,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-18 01:15:18,927 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-18 01:15:18,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:15:18,928 INFO L225 Difference]: With dead ends: 65 [2023-02-18 01:15:18,928 INFO L226 Difference]: Without dead ends: 57 [2023-02-18 01:15:18,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2023-02-18 01:15:18,929 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 47 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 01:15:18,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 89 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 01:15:18,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-18 01:15:18,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2023-02-18 01:15:18,945 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-18 01:15:18,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-02-18 01:15:18,952 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 25 [2023-02-18 01:15:18,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:15:18,952 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-02-18 01:15:18,953 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-18 01:15:18,953 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-02-18 01:15:18,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-18 01:15:18,954 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:15:18,954 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:15:18,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 01:15:19,159 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-18 01:15:19,159 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:15:19,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:15:19,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 1 times [2023-02-18 01:15:19,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:15:19,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323643093] [2023-02-18 01:15:19,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:19,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:15:19,179 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:15:19,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [543680009] [2023-02-18 01:15:19,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:19,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:15:19,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:15:19,184 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-18 01:15:19,187 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-18 01:15:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:15:19,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 01:15:19,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:15:19,261 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-18 01:15:19,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:15:19,305 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-18 01:15:19,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:15:19,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323643093] [2023-02-18 01:15:19,305 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:15:19,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543680009] [2023-02-18 01:15:19,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543680009] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:15:19,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:15:19,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-18 01:15:19,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901051838] [2023-02-18 01:15:19,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:15:19,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 01:15:19,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:15:19,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 01:15:19,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:15:19,307 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-18 01:15:19,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:15:19,396 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2023-02-18 01:15:19,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-18 01:15:19,397 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-18 01:15:19,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:15:19,398 INFO L225 Difference]: With dead ends: 116 [2023-02-18 01:15:19,398 INFO L226 Difference]: Without dead ends: 110 [2023-02-18 01:15:19,398 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-18 01:15:19,399 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 52 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 01:15:19,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 137 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 01:15:19,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-18 01:15:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-02-18 01:15:19,414 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-18 01:15:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2023-02-18 01:15:19,414 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 49 [2023-02-18 01:15:19,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:15:19,415 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2023-02-18 01:15:19,415 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-18 01:15:19,415 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2023-02-18 01:15:19,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-02-18 01:15:19,417 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:15:19,417 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:15:19,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-18 01:15:19,622 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-18 01:15:19,622 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:15:19,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:15:19,623 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 2 times [2023-02-18 01:15:19,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:15:19,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567463606] [2023-02-18 01:15:19,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:19,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:15:19,632 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:15:19,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [734983666] [2023-02-18 01:15:19,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 01:15:19,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:15:19,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:15:19,653 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-18 01:15:19,703 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-18 01:15:19,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 01:15:19,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:15:19,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 01:15:19,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:15:19,831 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-18 01:15:19,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:15:19,994 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-18 01:15:19,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:15:19,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567463606] [2023-02-18 01:15:19,995 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:15:19,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734983666] [2023-02-18 01:15:19,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734983666] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:15:19,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:15:19,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2023-02-18 01:15:19,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924256427] [2023-02-18 01:15:19,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:15:19,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-18 01:15:19,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:15:19,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-18 01:15:19,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2023-02-18 01:15:19,998 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-18 01:15:20,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:15:20,284 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2023-02-18 01:15:20,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-18 01:15:20,284 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-18 01:15:20,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:15:20,290 INFO L225 Difference]: With dead ends: 236 [2023-02-18 01:15:20,290 INFO L226 Difference]: Without dead ends: 230 [2023-02-18 01:15:20,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2023-02-18 01:15:20,292 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 173 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:15:20,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 239 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:15:20,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-02-18 01:15:20,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2023-02-18 01:15:20,332 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-18 01:15:20,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2023-02-18 01:15:20,333 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 109 [2023-02-18 01:15:20,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:15:20,335 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2023-02-18 01:15:20,335 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-18 01:15:20,335 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2023-02-18 01:15:20,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-02-18 01:15:20,344 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:15:20,344 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:15:20,361 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-18 01:15:20,550 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-18 01:15:20,550 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:15:20,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:15:20,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1294150550, now seen corresponding path program 3 times [2023-02-18 01:15:20,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:15:20,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347863569] [2023-02-18 01:15:20,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:20,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:15:20,573 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:15:20,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [746437253] [2023-02-18 01:15:20,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 01:15:20,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:15:20,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:15:20,586 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-18 01:15:20,588 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-18 01:15:20,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-18 01:15:20,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:15:20,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-18 01:15:20,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:15:20,702 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-18 01:15:20,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:15:20,799 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-18 01:15:20,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:15:20,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347863569] [2023-02-18 01:15:20,799 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:15:20,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746437253] [2023-02-18 01:15:20,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746437253] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:15:20,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:15:20,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-02-18 01:15:20,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704117102] [2023-02-18 01:15:20,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:15:20,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 01:15:20,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:15:20,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 01:15:20,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-02-18 01:15:20,802 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-18 01:15:20,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:15:20,951 INFO L93 Difference]: Finished difference Result 449 states and 492 transitions. [2023-02-18 01:15:20,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 01:15:20,951 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-18 01:15:20,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:15:20,953 INFO L225 Difference]: With dead ends: 449 [2023-02-18 01:15:20,953 INFO L226 Difference]: Without dead ends: 443 [2023-02-18 01:15:20,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 438 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-02-18 01:15:20,954 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:15:20,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 63 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:15:20,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-02-18 01:15:20,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2023-02-18 01:15:20,991 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-18 01:15:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 483 transitions. [2023-02-18 01:15:20,993 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 483 transitions. Word has length 229 [2023-02-18 01:15:20,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:15:20,993 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 483 transitions. [2023-02-18 01:15:20,994 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-18 01:15:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 483 transitions. [2023-02-18 01:15:20,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-02-18 01:15:20,995 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:15:20,995 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-18 01:15:21,011 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-18 01:15:21,200 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-18 01:15:21,200 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:15:21,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:15:21,201 INFO L85 PathProgramCache]: Analyzing trace with hash -614092180, now seen corresponding path program 1 times [2023-02-18 01:15:21,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:15:21,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839611905] [2023-02-18 01:15:21,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:21,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:15:21,217 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:15:21,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1071903741] [2023-02-18 01:15:21,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:21,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:15:21,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:15:21,233 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-18 01:15:21,257 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-18 01:15:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:15:21,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-18 01:15:21,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:15:21,577 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-18 01:15:21,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:15:22,116 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-18 01:15:22,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:15:22,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839611905] [2023-02-18 01:15:22,116 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:15:22,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071903741] [2023-02-18 01:15:22,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071903741] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:15:22,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:15:22,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2023-02-18 01:15:22,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476688805] [2023-02-18 01:15:22,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:15:22,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-18 01:15:22,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:15:22,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-18 01:15:22,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2023-02-18 01:15:22,119 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-18 01:15:23,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:15:23,080 INFO L93 Difference]: Finished difference Result 929 states and 1043 transitions. [2023-02-18 01:15:23,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-02-18 01:15:23,081 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-18 01:15:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:15:23,084 INFO L225 Difference]: With dead ends: 929 [2023-02-18 01:15:23,084 INFO L226 Difference]: Without dead ends: 923 [2023-02-18 01:15:23,087 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-18 01:15:23,087 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 376 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 01:15:23,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 526 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 01:15:23,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2023-02-18 01:15:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2023-02-18 01:15:23,158 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-18 01:15:23,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1011 transitions. [2023-02-18 01:15:23,160 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1011 transitions. Word has length 229 [2023-02-18 01:15:23,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:15:23,161 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 1011 transitions. [2023-02-18 01:15:23,161 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-18 01:15:23,161 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1011 transitions. [2023-02-18 01:15:23,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2023-02-18 01:15:23,166 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:15:23,166 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-18 01:15:23,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 01:15:23,374 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-18 01:15:23,374 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:15:23,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:15:23,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1651100380, now seen corresponding path program 2 times [2023-02-18 01:15:23,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:15:23,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858441468] [2023-02-18 01:15:23,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:23,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:15:23,389 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:15:23,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [219159333] [2023-02-18 01:15:23,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 01:15:23,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:15:23,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:15:23,391 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-18 01:15:23,393 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-18 01:15:23,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 01:15:23,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:15:23,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 95 conjunts are in the unsatisfiable core [2023-02-18 01:15:23,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:15:24,355 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-18 01:15:24,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:15:26,267 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-18 01:15:26,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:15:26,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858441468] [2023-02-18 01:15:26,268 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:15:26,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219159333] [2023-02-18 01:15:26,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219159333] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:15:26,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:15:26,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2023-02-18 01:15:26,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037664755] [2023-02-18 01:15:26,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:15:26,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2023-02-18 01:15:26,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:15:26,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2023-02-18 01:15:26,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2023-02-18 01:15:26,280 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-18 01:15:29,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:15:29,750 INFO L93 Difference]: Finished difference Result 1889 states and 2123 transitions. [2023-02-18 01:15:29,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2023-02-18 01:15:29,751 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-18 01:15:29,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:15:29,764 INFO L225 Difference]: With dead ends: 1889 [2023-02-18 01:15:29,764 INFO L226 Difference]: Without dead ends: 1883 [2023-02-18 01:15:29,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1029 GetRequests, 840 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5452 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=13540, Invalid=22750, Unknown=0, NotChecked=0, Total=36290 [2023-02-18 01:15:29,789 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 791 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 01:15:29,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 905 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 01:15:29,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2023-02-18 01:15:29,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1880. [2023-02-18 01:15:29,930 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-18 01:15:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2067 transitions. [2023-02-18 01:15:29,934 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2067 transitions. Word has length 469 [2023-02-18 01:15:29,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:15:29,934 INFO L495 AbstractCegarLoop]: Abstraction has 1880 states and 2067 transitions. [2023-02-18 01:15:29,935 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-18 01:15:29,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2067 transitions. [2023-02-18 01:15:29,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 950 [2023-02-18 01:15:29,964 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:15:29,964 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-18 01:15:29,979 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-18 01:15:30,171 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-18 01:15:30,172 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:15:30,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:15:30,173 INFO L85 PathProgramCache]: Analyzing trace with hash 866618004, now seen corresponding path program 3 times [2023-02-18 01:15:30,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:15:30,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486955992] [2023-02-18 01:15:30,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:30,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:15:30,213 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:15:30,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [687233738] [2023-02-18 01:15:30,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 01:15:30,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:15:30,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:15:30,215 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-18 01:15:30,248 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-18 01:15:31,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 95 check-sat command(s) [2023-02-18 01:15:31,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:15:31,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 2313 conjuncts, 191 conjunts are in the unsatisfiable core [2023-02-18 01:15:31,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:15:33,533 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-18 01:15:33,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:15:35,674 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-18 01:15:35,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:15:35,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486955992] [2023-02-18 01:15:35,675 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:15:35,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687233738] [2023-02-18 01:15:35,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687233738] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:15:35,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:15:35,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2023-02-18 01:15:35,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278584973] [2023-02-18 01:15:35,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:15:35,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2023-02-18 01:15:35,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:15:35,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2023-02-18 01:15:35,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2023-02-18 01:15:35,683 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-18 01:15:38,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:15:38,968 INFO L93 Difference]: Finished difference Result 2009 states and 2213 transitions. [2023-02-18 01:15:38,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2023-02-18 01:15:38,969 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-18 01:15:38,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:15:38,997 INFO L225 Difference]: With dead ends: 2009 [2023-02-18 01:15:38,997 INFO L226 Difference]: Without dead ends: 2003 [2023-02-18 01:15:39,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1995 GetRequests, 1704 SyntacticMatches, 90 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9505 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=15349, Invalid=25657, Unknown=0, NotChecked=0, Total=41006 [2023-02-18 01:15:39,001 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 379 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 01:15:39,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 959 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 01:15:39,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2023-02-18 01:15:39,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 2000. [2023-02-18 01:15:39,161 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-18 01:15:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2199 transitions. [2023-02-18 01:15:39,165 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2199 transitions. Word has length 949 [2023-02-18 01:15:39,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:15:39,166 INFO L495 AbstractCegarLoop]: Abstraction has 2000 states and 2199 transitions. [2023-02-18 01:15:39,167 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-18 01:15:39,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2199 transitions. [2023-02-18 01:15:39,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2023-02-18 01:15:39,176 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:15:39,176 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-18 01:15:39,186 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-18 01:15:39,381 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-18 01:15:39,381 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:15:39,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:15:39,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1685422910, now seen corresponding path program 4 times [2023-02-18 01:15:39,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:15:39,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048524961] [2023-02-18 01:15:39,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:39,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:15:39,406 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:15:39,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1672044898] [2023-02-18 01:15:39,406 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 01:15:39,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:15:39,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:15:39,417 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-18 01:15:39,417 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-18 01:15:39,912 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 01:15:39,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-18 01:15:39,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 01:15:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 01:15:40,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 01:15:40,732 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 01:15:40,732 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 01:15:40,760 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-18 01:15:40,945 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-18 01:15:40,949 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1] [2023-02-18 01:15:40,953 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 01:15:41,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 01:15:41 BoogieIcfgContainer [2023-02-18 01:15:41,115 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 01:15:41,116 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 01:15:41,116 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 01:15:41,116 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 01:15:41,116 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:15:16" (3/4) ... [2023-02-18 01:15:41,118 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-18 01:15:41,309 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 01:15:41,309 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 01:15:41,309 INFO L158 Benchmark]: Toolchain (without parser) took 25592.30ms. Allocated memory was 136.3MB in the beginning and 499.1MB in the end (delta: 362.8MB). Free memory was 79.7MB in the beginning and 422.2MB in the end (delta: -342.5MB). Peak memory consumption was 276.5MB. Max. memory is 16.1GB. [2023-02-18 01:15:41,309 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 01:15:41,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 134.58ms. Allocated memory is still 136.3MB. Free memory was 79.7MB in the beginning and 69.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 01:15:41,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.70ms. Allocated memory is still 136.3MB. Free memory was 69.2MB in the beginning and 67.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 01:15:41,310 INFO L158 Benchmark]: Boogie Preprocessor took 11.79ms. Allocated memory is still 136.3MB. Free memory was 67.6MB in the beginning and 66.7MB in the end (delta: 934.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 01:15:41,310 INFO L158 Benchmark]: RCFGBuilder took 237.11ms. Allocated memory is still 136.3MB. Free memory was 66.4MB in the beginning and 56.2MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 01:15:41,311 INFO L158 Benchmark]: TraceAbstraction took 24993.78ms. Allocated memory was 136.3MB in the beginning and 499.1MB in the end (delta: 362.8MB). Free memory was 55.5MB in the beginning and 182.4MB in the end (delta: -127.0MB). Peak memory consumption was 237.2MB. Max. memory is 16.1GB. [2023-02-18 01:15:41,311 INFO L158 Benchmark]: Witness Printer took 192.94ms. Allocated memory is still 499.1MB. Free memory was 182.4MB in the beginning and 422.2MB in the end (delta: -239.8MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2023-02-18 01:15:41,313 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 98.6MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 134.58ms. Allocated memory is still 136.3MB. Free memory was 79.7MB in the beginning and 69.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.70ms. Allocated memory is still 136.3MB. Free memory was 69.2MB in the beginning and 67.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.79ms. Allocated memory is still 136.3MB. Free memory was 67.6MB in the beginning and 66.7MB in the end (delta: 934.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 237.11ms. Allocated memory is still 136.3MB. Free memory was 66.4MB in the beginning and 56.2MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 24993.78ms. Allocated memory was 136.3MB in the beginning and 499.1MB in the end (delta: 362.8MB). Free memory was 55.5MB in the beginning and 182.4MB in the end (delta: -127.0MB). Peak memory consumption was 237.2MB. Max. memory is 16.1GB. * Witness Printer took 192.94ms. Allocated memory is still 499.1MB. Free memory was 182.4MB in the beginning and 422.2MB in the end (delta: -239.8MB). Peak memory consumption was 14.1MB. 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=-19601, x=0, X=19801, y=0, Y=100] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=-19601, X=19801, x=0, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=-19601, x=0, x=0, x=0, X=19801, Y=100, y=0] [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=-19601, x=0, x=0, x=0, X=19801, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=1, v=-19601, x=0, x=0, x=0, X=19801, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=1, v=-19401, x=0, X=19801, x=0, x=0, y=0, Y=100] [L45] x++ VAL [counter=1, v=-19401, X=19801, x=1, x=0, x=0, Y=100, y=0] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-19401, x=0, X=19801, x=1, x=0, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=-19401, X=19801, x=100, x=1, x=0, y=0, Y=100] [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=-19401, x=100, x=0, x=1, X=19801, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=2, v=-19401, x=0, x=1, X=19801, x=100, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=2, v=-19201, x=0, X=19801, x=1, x=100, Y=100, y=0] [L45] x++ VAL [counter=2, v=-19201, x=0, x=100, X=19801, x=2, y=0, Y=100] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=-19201, x=0, x=2, x=100, X=19801, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=-19201, x=2, x=200, X=19801, x=0, y=0, Y=100] [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=-19201, x=200, x=0, X=19801, x=2, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=3, v=-19201, x=200, x=0, X=19801, x=2, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=3, v=-19001, x=0, x=2, X=19801, x=200, Y=100, y=0] [L45] x++ VAL [counter=3, v=-19001, x=0, x=200, X=19801, x=3, y=0, Y=100] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=-19001, x=0, X=19801, x=200, x=3, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=-19001, x=3, X=19801, x=0, x=300, Y=100, 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=-19001, x=300, x=0, X=19801, x=3, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=4, v=-19001, x=300, X=19801, x=0, x=3, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=4, v=-18801, x=3, x=300, X=19801, x=0, y=0, Y=100] [L45] x++ VAL [counter=4, v=-18801, x=300, X=19801, x=4, x=0, y=0, Y=100] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=-18801, x=300, X=19801, x=4, x=0, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=-18801, x=400, x=4, X=19801, x=0, y=0, Y=100] [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=-18801, X=19801, x=4, x=400, x=0, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=5, v=-18801, x=0, X=19801, x=400, x=4, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=5, v=-18601, X=19801, x=4, x=0, x=400, y=0, Y=100] [L45] x++ VAL [counter=5, v=-18601, X=19801, x=0, x=400, x=5, y=0, Y=100] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-18601, x=5, x=400, X=19801, x=0, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=-18601, X=19801, x=5, x=0, x=500, y=0, Y=100] [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=-18601, x=0, x=5, x=500, X=19801, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=6, v=-18601, x=0, x=5, X=19801, x=500, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=6, v=-18401, x=500, x=0, x=5, X=19801, Y=100, y=0] [L45] x++ VAL [counter=6, v=-18401, X=19801, x=6, x=0, x=500, y=0, Y=100] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-18401, x=500, X=19801, x=6, x=0, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=-18401, X=19801, x=6, x=600, x=0, Y=100, y=0] [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=-18401, x=6, x=0, X=19801, x=600, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=7, v=-18401, x=0, X=19801, x=6, x=600, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=7, v=-18201, x=0, x=600, X=19801, x=6, Y=100, y=0] [L45] x++ VAL [counter=7, v=-18201, x=0, x=7, x=600, X=19801, Y=100, y=0] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=-18201, x=7, x=600, x=0, X=19801, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=-18201, x=0, x=700, X=19801, x=7, Y=100, 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=-18201, X=19801, x=0, x=700, x=7, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=8, v=-18201, x=7, x=0, x=700, X=19801, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=8, v=-18001, X=19801, x=700, x=7, x=0, y=0, Y=100] [L45] x++ VAL [counter=8, v=-18001, X=19801, x=0, x=8, x=700, y=0, Y=100] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-18001, x=700, x=0, x=8, X=19801, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-18001, X=19801, x=0, x=800, x=8, y=0, Y=100] [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=-18001, x=800, X=19801, x=0, x=8, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=9, v=-18001, x=800, X=19801, x=8, x=0, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=9, v=-17801, x=800, x=0, x=8, X=19801, y=0, Y=100] [L45] x++ VAL [counter=9, v=-17801, x=0, x=800, X=19801, x=9, y=0, Y=100] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=-17801, X=19801, x=0, x=9, x=800, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=-17801, x=900, x=0, x=9, X=19801, Y=100, 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=-17801, x=0, x=9, X=19801, x=900, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=10, v=-17801, x=9, X=19801, x=900, x=0, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=10, v=-17601, x=900, x=0, X=19801, x=9, Y=100, y=0] [L45] x++ VAL [counter=10, v=-17601, x=0, X=19801, x=900, x=10, Y=100, y=0] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=-17601, x=0, x=10, x=900, X=19801, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=-17601, x=0, x=10, x=1000, X=19801, y=0, Y=100] [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=-17601, x=1000, x=0, x=10, X=19801, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=11, v=-17601, X=19801, x=1000, x=0, x=10, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=11, v=-17401, X=19801, x=0, x=1000, x=10, Y=100, y=0] [L45] x++ VAL [counter=11, v=-17401, X=19801, x=11, x=0, x=1000, y=0, Y=100] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=-17401, X=19801, x=1000, x=11, x=0, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=-17401, X=19801, x=0, x=1100, x=11, y=0, Y=100] [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=-17401, X=19801, x=0, x=11, x=1100, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=12, v=-17401, x=11, x=0, X=19801, x=1100, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=12, v=-17201, X=19801, x=1100, x=0, x=11, Y=100, y=0] [L45] x++ VAL [counter=12, v=-17201, x=1100, X=19801, x=0, x=12, Y=100, y=0] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=-17201, x=12, X=19801, x=1100, x=0, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=-17201, X=19801, x=12, x=1200, x=0, Y=100, 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=-17201, x=0, x=12, X=19801, x=1200, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=13, v=-17201, x=12, x=1200, x=0, X=19801, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=13, v=-17001, x=12, x=0, x=1200, X=19801, y=0, Y=100] [L45] x++ VAL [counter=13, v=-17001, x=0, x=1200, x=13, X=19801, y=0, Y=100] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=-17001, x=1200, x=0, X=19801, x=13, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=-17001, x=1300, x=0, x=13, X=19801, y=0, Y=100] [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=-17001, X=19801, x=0, x=13, x=1300, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=14, v=-17001, x=0, X=19801, x=1300, x=13, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=14, v=-16801, x=0, x=13, X=19801, x=1300, y=0, Y=100] [L45] x++ VAL [counter=14, v=-16801, X=19801, x=1300, x=0, x=14, Y=100, y=0] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=-16801, x=14, x=1300, X=19801, x=0, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=-16801, x=1400, x=14, X=19801, x=0, Y=100, y=0] [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=-16801, X=19801, x=14, x=1400, x=0, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=15, v=-16801, x=1400, x=14, X=19801, x=0, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=15, v=-16601, x=1400, X=19801, x=14, x=0, Y=100, y=0] [L45] x++ VAL [counter=15, v=-16601, x=0, x=15, x=1400, X=19801, Y=100, y=0] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=-16601, x=0, x=15, x=1400, X=19801, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=-16601, x=15, x=1500, x=0, X=19801, Y=100, 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=-16601, x=1500, x=15, x=0, X=19801, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=16, v=-16601, X=19801, x=15, x=1500, x=0, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=16, v=-16401, x=1500, x=15, x=0, X=19801, Y=100, y=0] [L45] x++ VAL [counter=16, v=-16401, x=0, X=19801, x=16, x=1500, Y=100, y=0] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=-16401, x=1500, x=0, x=16, X=19801, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=-16401, x=1600, x=16, x=0, X=19801, y=0, Y=100] [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=-16401, x=0, x=16, x=1600, X=19801, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=17, v=-16401, x=1600, x=16, x=0, X=19801, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=17, v=-16201, x=0, X=19801, x=16, x=1600, Y=100, y=0] [L45] x++ VAL [counter=17, v=-16201, x=0, x=1600, x=17, X=19801, y=0, Y=100] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=-16201, X=19801, x=17, x=1600, x=0, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=-16201, x=17, x=0, x=1700, X=19801, y=0, Y=100] [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=-16201, x=17, x=1700, X=19801, x=0, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=18, v=-16201, x=17, x=0, X=19801, x=1700, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=18, v=-16001, X=19801, x=1700, x=17, x=0, y=0, Y=100] [L45] x++ VAL [counter=18, v=-16001, x=1700, x=18, X=19801, x=0, y=0, Y=100] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=-16001, x=1700, x=18, X=19801, x=0, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=-16001, x=0, x=1800, x=18, X=19801, Y=100, y=0] [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=-16001, X=19801, x=1800, x=0, x=18, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=19, v=-16001, x=0, x=18, x=1800, X=19801, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=19, v=-15801, x=0, X=19801, x=1800, x=18, Y=100, y=0] [L45] x++ VAL [counter=19, v=-15801, X=19801, x=19, x=0, x=1800, Y=100, y=0] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=-15801, x=0, x=1800, X=19801, x=19, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=-15801, x=1900, x=0, X=19801, x=19, y=0, Y=100] [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=-15801, x=1900, x=0, x=19, X=19801, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=20, v=-15801, x=1900, X=19801, x=19, x=0, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=20, v=-15601, x=1900, x=19, X=19801, x=0, Y=100, y=0] [L45] x++ VAL [counter=20, v=-15601, X=19801, x=1900, x=0, x=20, y=0, Y=100] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=-15601, x=0, X=19801, x=1900, x=20, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=21, v=-15601, X=19801, x=20, x=0, x=2000, y=0, Y=100] [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=-15601, X=19801, x=20, x=0, x=2000, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=21, v=-15601, x=2000, x=0, X=19801, x=20, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=21, v=-15401, x=2000, X=19801, x=20, x=0, y=0, Y=100] [L45] x++ VAL [counter=21, v=-15401, x=2000, x=21, X=19801, x=0, y=0, Y=100] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=-15401, x=21, X=19801, x=2000, x=0, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=22, v=-15401, x=2100, X=19801, x=21, x=0, Y=100, y=0] [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=-15401, x=21, X=19801, x=0, x=2100, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=22, v=-15401, x=2100, X=19801, x=0, x=21, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=22, v=-15201, x=2100, x=0, X=19801, x=21, y=0, Y=100] [L45] x++ VAL [counter=22, v=-15201, X=19801, x=0, x=2100, x=22, y=0, Y=100] [L31] EXPR counter++ VAL [counter=23, counter++=22, v=-15201, x=0, x=22, x=2100, X=19801, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=23, v=-15201, x=22, X=19801, x=2200, x=0, y=0, Y=100] [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=-15201, x=2200, x=0, x=22, X=19801, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=23, v=-15201, X=19801, x=0, x=2200, x=22, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=23, v=-15001, x=2200, x=0, x=22, X=19801, y=0, Y=100] [L45] x++ VAL [counter=23, v=-15001, X=19801, x=0, x=2200, x=23, y=0, Y=100] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=-15001, x=23, X=19801, x=0, x=2200, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=24, v=-15001, x=0, x=23, x=2300, X=19801, Y=100, 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=-15001, x=23, x=2300, x=0, X=19801, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=24, v=-15001, x=0, x=2300, X=19801, x=23, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=24, v=-14801, X=19801, x=0, x=2300, x=23, y=0, Y=100] [L45] x++ VAL [counter=24, v=-14801, x=2300, x=24, x=0, X=19801, y=0, Y=100] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=-14801, x=24, x=2300, x=0, X=19801, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=25, v=-14801, x=24, x=0, X=19801, x=2400, Y=100, y=0] [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=-14801, x=24, x=0, X=19801, x=2400, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=25, v=-14801, x=2400, X=19801, x=24, x=0, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=25, v=-14601, X=19801, x=24, x=0, x=2400, Y=100, y=0] [L45] x++ VAL [counter=25, v=-14601, x=25, x=0, x=2400, X=19801, y=0, Y=100] [L31] EXPR counter++ VAL [counter=26, counter++=25, v=-14601, X=19801, x=25, x=0, x=2400, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=26, v=-14601, x=0, X=19801, x=2500, x=25, y=0, Y=100] [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=-14601, x=0, x=2500, x=25, X=19801, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=26, v=-14601, x=25, X=19801, x=0, x=2500, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=26, v=-14401, x=2500, X=19801, x=25, x=0, y=0, Y=100] [L45] x++ VAL [counter=26, v=-14401, X=19801, x=2500, x=26, x=0, Y=100, y=0] [L31] EXPR counter++ VAL [counter=27, counter++=26, v=-14401, X=19801, x=0, x=26, x=2500, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=27, v=-14401, x=0, x=26, X=19801, x=2600, Y=100, 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=-14401, X=19801, x=26, x=2600, x=0, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=27, v=-14401, X=19801, x=26, x=2600, x=0, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=27, v=-14201, X=19801, x=0, x=2600, x=26, y=0, Y=100] [L45] x++ VAL [counter=27, v=-14201, x=2600, x=27, x=0, X=19801, Y=100, y=0] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=-14201, x=0, x=27, x=2600, X=19801, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=28, v=-14201, X=19801, x=2700, x=27, x=0, y=0, Y=100] [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=-14201, X=19801, x=2700, x=27, x=0, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=28, v=-14201, x=0, X=19801, x=2700, x=27, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=28, v=-14001, x=2700, X=19801, x=0, x=27, y=0, Y=100] [L45] x++ VAL [counter=28, v=-14001, x=0, X=19801, x=28, x=2700, Y=100, y=0] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=-14001, x=2700, x=28, X=19801, x=0, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=29, v=-14001, x=0, X=19801, x=28, x=2800, y=0, Y=100] [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=-14001, x=2800, x=0, X=19801, x=28, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=29, v=-14001, x=0, X=19801, x=2800, x=28, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=29, v=-13801, X=19801, x=28, x=0, x=2800, y=0, Y=100] [L45] x++ VAL [counter=29, v=-13801, X=19801, x=0, x=29, x=2800, Y=100, y=0] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=-13801, x=2800, x=29, x=0, X=19801, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=30, v=-13801, x=2900, X=19801, x=0, x=29, y=0, Y=100] [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=-13801, X=19801, x=29, x=0, x=2900, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=30, v=-13801, X=19801, x=0, x=29, x=2900, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=30, v=-13601, x=0, x=29, x=2900, X=19801, Y=100, y=0] [L45] x++ VAL [counter=30, v=-13601, x=2900, x=0, X=19801, x=30, Y=100, y=0] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=-13601, x=30, x=2900, X=19801, x=0, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=31, v=-13601, X=19801, x=0, x=30, x=3000, y=0, Y=100] [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=-13601, x=3000, X=19801, x=30, x=0, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=31, v=-13601, x=0, x=3000, X=19801, x=30, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=31, v=-13401, x=30, x=3000, x=0, X=19801, y=0, Y=100] [L45] x++ VAL [counter=31, v=-13401, x=3000, X=19801, x=0, x=31, Y=100, y=0] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=-13401, x=3000, x=0, X=19801, x=31, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=32, v=-13401, x=31, x=0, X=19801, x=3100, y=0, Y=100] [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=-13401, x=0, x=31, x=3100, X=19801, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=32, v=-13401, x=3100, X=19801, x=31, x=0, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=32, v=-13201, x=31, x=0, x=3100, X=19801, y=0, Y=100] [L45] x++ VAL [counter=32, v=-13201, x=0, X=19801, x=32, x=3100, y=0, Y=100] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=-13201, x=0, X=19801, x=3100, x=32, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=33, v=-13201, X=19801, x=32, x=3200, x=0, Y=100, y=0] [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=-13201, x=0, x=32, X=19801, x=3200, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=33, v=-13201, x=3200, x=0, x=32, X=19801, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=33, v=-13001, x=3200, X=19801, x=32, x=0, Y=100, y=0] [L45] x++ VAL [counter=33, v=-13001, x=0, X=19801, x=33, x=3200, Y=100, y=0] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=-13001, x=0, x=3200, X=19801, x=33, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=34, v=-13001, x=3300, x=0, x=33, X=19801, y=0, Y=100] [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=-13001, x=33, x=3300, x=0, X=19801, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=34, v=-13001, X=19801, x=0, x=3300, x=33, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=34, v=-12801, x=0, X=19801, x=3300, x=33, y=0, Y=100] [L45] x++ VAL [counter=34, v=-12801, X=19801, x=0, x=34, x=3300, y=0, Y=100] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=-12801, x=34, x=0, x=3300, X=19801, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=35, v=-12801, X=19801, x=0, x=3400, x=34, Y=100, 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=-12801, X=19801, x=0, x=3400, x=34, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=35, v=-12801, x=3400, x=34, x=0, X=19801, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=35, v=-12601, x=0, X=19801, x=34, x=3400, y=0, Y=100] [L45] x++ VAL [counter=35, v=-12601, x=0, x=3400, X=19801, x=35, y=0, Y=100] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=-12601, x=0, x=35, X=19801, x=3400, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=36, v=-12601, x=3500, X=19801, x=35, x=0, y=0, Y=100] [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=-12601, x=3500, X=19801, x=35, x=0, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=36, v=-12601, x=35, x=0, x=3500, X=19801, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=36, v=-12401, x=0, X=19801, x=35, x=3500, Y=100, y=0] [L45] x++ VAL [counter=36, v=-12401, x=36, x=3500, X=19801, x=0, y=0, Y=100] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=-12401, x=3500, x=36, X=19801, x=0, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=37, v=-12401, x=36, X=19801, x=0, x=3600, Y=100, 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=-12401, x=3600, x=36, X=19801, x=0, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=37, v=-12401, x=3600, X=19801, x=0, x=36, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=37, v=-12201, x=36, X=19801, x=3600, x=0, Y=100, y=0] [L45] x++ VAL [counter=37, v=-12201, X=19801, x=3600, x=37, x=0, Y=100, y=0] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=-12201, x=0, x=3600, x=37, X=19801, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=38, v=-12201, x=3700, X=19801, x=0, x=37, Y=100, 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=-12201, x=3700, X=19801, x=37, x=0, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=38, v=-12201, x=3700, x=37, x=0, X=19801, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=38, v=-12001, x=37, x=0, X=19801, x=3700, y=0, Y=100] [L45] x++ VAL [counter=38, v=-12001, x=0, X=19801, x=3700, x=38, y=0, Y=100] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=-12001, x=3700, x=38, x=0, X=19801, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=39, v=-12001, x=0, x=38, X=19801, x=3800, Y=100, y=0] [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=-12001, x=3800, x=0, X=19801, x=38, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=39, v=-12001, x=38, X=19801, x=0, x=3800, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=39, v=-11801, x=0, X=19801, x=38, x=3800, y=0, Y=100] [L45] x++ VAL [counter=39, v=-11801, x=3800, X=19801, x=39, x=0, y=0, Y=100] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=-11801, x=0, x=39, x=3800, X=19801, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=40, v=-11801, x=39, X=19801, x=0, x=3900, Y=100, y=0] [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=-11801, x=0, x=3900, X=19801, x=39, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=40, v=-11801, x=3900, x=0, X=19801, x=39, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=40, v=-11601, X=19801, x=3900, x=0, x=39, y=0, Y=100] [L45] x++ VAL [counter=40, v=-11601, x=3900, x=40, x=0, X=19801, Y=100, y=0] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=-11601, x=0, x=40, X=19801, x=3900, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=41, v=-11601, X=19801, x=0, x=4000, x=40, Y=100, y=0] [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=-11601, x=4000, x=40, X=19801, x=0, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=41, v=-11601, x=0, X=19801, x=4000, x=40, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=41, v=-11401, x=0, x=40, x=4000, X=19801, Y=100, y=0] [L45] x++ VAL [counter=41, v=-11401, x=4000, x=0, x=41, X=19801, y=0, Y=100] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=-11401, x=0, X=19801, x=41, x=4000, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=42, v=-11401, x=41, x=4100, x=0, X=19801, y=0, Y=100] [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=-11401, x=0, x=41, x=4100, X=19801, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=42, v=-11401, X=19801, x=4100, x=41, x=0, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=42, v=-11201, X=19801, x=41, x=0, x=4100, y=0, Y=100] [L45] x++ VAL [counter=42, v=-11201, X=19801, x=0, x=42, x=4100, y=0, Y=100] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=-11201, x=0, X=19801, x=4100, x=42, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=43, v=-11201, x=0, X=19801, x=42, x=4200, y=0, Y=100] [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=-11201, x=4200, x=0, X=19801, x=42, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=43, v=-11201, x=42, x=4200, x=0, X=19801, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=43, v=-11001, x=4200, x=42, x=0, X=19801, y=0, Y=100] [L45] x++ VAL [counter=43, v=-11001, x=4200, x=43, x=0, X=19801, y=0, Y=100] [L31] EXPR counter++ VAL [counter=44, counter++=43, v=-11001, X=19801, x=0, x=4200, x=43, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=44, v=-11001, x=43, X=19801, x=4300, x=0, Y=100, 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=-11001, X=19801, x=43, x=4300, x=0, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=44, v=-11001, x=43, x=4300, x=0, X=19801, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=44, v=-10801, x=43, x=0, X=19801, x=4300, Y=100, y=0] [L45] x++ VAL [counter=44, v=-10801, X=19801, x=0, x=4300, x=44, Y=100, y=0] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=-10801, x=4300, X=19801, x=0, x=44, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=45, v=-10801, x=44, x=0, x=4400, X=19801, Y=100, y=0] [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=-10801, x=0, x=44, X=19801, x=4400, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=45, v=-10801, x=44, x=4400, x=0, X=19801, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=45, v=-10601, x=4400, x=44, X=19801, x=0, Y=100, y=0] [L45] x++ VAL [counter=45, v=-10601, x=4400, X=19801, x=0, x=45, Y=100, y=0] [L31] EXPR counter++ VAL [counter=46, counter++=45, v=-10601, x=0, X=19801, x=4400, x=45, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=46, v=-10601, x=0, x=45, x=4500, X=19801, y=0, Y=100] [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=-10601, X=19801, x=45, x=4500, x=0, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=46, v=-10601, x=0, x=4500, X=19801, x=45, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=46, v=-10401, x=0, x=45, X=19801, x=4500, Y=100, y=0] [L45] x++ VAL [counter=46, v=-10401, X=19801, x=4500, x=46, x=0, y=0, Y=100] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=-10401, x=0, X=19801, x=46, x=4500, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=47, v=-10401, x=46, x=0, X=19801, x=4600, y=0, Y=100] [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=-10401, x=0, x=4600, X=19801, x=46, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=47, v=-10401, x=0, x=4600, X=19801, x=46, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=47, v=-10201, x=0, x=46, X=19801, x=4600, y=0, Y=100] [L45] x++ VAL [counter=47, v=-10201, X=19801, x=47, x=4600, x=0, Y=100, y=0] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=-10201, x=4600, x=0, X=19801, x=47, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=48, v=-10201, X=19801, x=47, x=0, x=4700, Y=100, 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=-10201, x=0, x=47, x=4700, X=19801, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=48, v=-10201, x=0, x=47, X=19801, x=4700, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=48, v=-10001, x=47, X=19801, x=4700, x=0, y=0, Y=100] [L45] x++ VAL [counter=48, v=-10001, x=4700, X=19801, x=48, x=0, y=0, Y=100] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=-10001, x=0, X=19801, x=48, x=4700, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=49, v=-10001, x=4800, x=0, x=48, X=19801, Y=100, y=0] [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=-10001, x=0, X=19801, x=48, x=4800, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=49, v=-10001, x=4800, X=19801, x=48, x=0, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=49, v=-9801, x=0, x=4800, X=19801, x=48, Y=100, y=0] [L45] x++ VAL [counter=49, v=-9801, x=0, x=4800, x=49, X=19801, Y=100, y=0] [L31] EXPR counter++ VAL [counter=50, counter++=49, v=-9801, x=4800, x=49, X=19801, x=0, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=50, v=-9801, x=49, x=0, x=4900, X=19801, y=0, Y=100] [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=-9801, X=19801, x=0, x=49, x=4900, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=50, v=-9801, X=19801, x=49, x=4900, x=0, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=50, v=-9601, x=49, x=4900, X=19801, x=0, y=0, Y=100] [L45] x++ VAL [counter=50, v=-9601, x=4900, x=0, X=19801, x=50, y=0, Y=100] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=-9601, x=0, x=50, X=19801, x=4900, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=51, v=-9601, x=5000, x=0, x=50, X=19801, y=0, Y=100] [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=-9601, x=0, x=5000, X=19801, x=50, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=51, v=-9601, x=5000, x=50, X=19801, x=0, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=51, v=-9401, x=0, x=50, X=19801, x=5000, y=0, Y=100] [L45] x++ VAL [counter=51, v=-9401, x=51, x=0, X=19801, x=5000, y=0, Y=100] [L31] EXPR counter++ VAL [counter=52, counter++=51, v=-9401, x=5000, X=19801, x=51, x=0, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=52, v=-9401, x=51, X=19801, x=0, x=5100, Y=100, y=0] [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=-9401, X=19801, x=5100, x=51, x=0, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=52, v=-9401, x=5100, x=51, X=19801, x=0, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=52, v=-9201, x=5100, x=51, X=19801, x=0, Y=100, y=0] [L45] x++ VAL [counter=52, v=-9201, x=52, X=19801, x=0, x=5100, y=0, Y=100] [L31] EXPR counter++ VAL [counter=53, counter++=52, v=-9201, x=0, X=19801, x=5100, x=52, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=53, v=-9201, x=0, x=52, X=19801, x=5200, Y=100, 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=-9201, x=5200, X=19801, x=0, x=52, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=53, v=-9201, x=0, X=19801, x=5200, x=52, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=53, v=-9001, x=5200, x=0, X=19801, x=52, Y=100, y=0] [L45] x++ VAL [counter=53, v=-9001, x=0, x=53, x=5200, X=19801, Y=100, y=0] [L31] EXPR counter++ VAL [counter=54, counter++=53, v=-9001, X=19801, x=5200, x=0, x=53, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=54, v=-9001, x=5300, x=53, x=0, X=19801, Y=100, 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=-9001, x=0, x=5300, x=53, X=19801, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=54, v=-9001, X=19801, x=53, x=5300, x=0, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=54, v=-8801, X=19801, x=5300, x=0, x=53, y=0, Y=100] [L45] x++ VAL [counter=54, v=-8801, X=19801, x=5300, x=54, x=0, Y=100, y=0] [L31] EXPR counter++ VAL [counter=55, counter++=54, v=-8801, X=19801, x=5300, x=0, x=54, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=55, v=-8801, x=54, x=0, x=5400, X=19801, Y=100, 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=-8801, X=19801, x=54, x=0, x=5400, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=55, v=-8801, X=19801, x=0, x=5400, x=54, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=55, v=-8601, x=0, x=54, x=5400, X=19801, y=0, Y=100] [L45] x++ VAL [counter=55, v=-8601, x=5400, x=55, x=0, X=19801, y=0, Y=100] [L31] EXPR counter++ VAL [counter=56, counter++=55, v=-8601, x=0, x=5400, X=19801, x=55, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=56, v=-8601, x=5500, x=55, X=19801, x=0, y=0, Y=100] [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=-8601, X=19801, x=0, x=5500, x=55, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=56, v=-8601, x=0, x=55, x=5500, X=19801, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=56, v=-8401, x=55, X=19801, x=0, x=5500, Y=100, y=0] [L45] x++ VAL [counter=56, v=-8401, x=5500, x=0, X=19801, x=56, y=0, Y=100] [L31] EXPR counter++ VAL [counter=57, counter++=56, v=-8401, x=5500, x=0, x=56, X=19801, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=57, v=-8401, x=5600, X=19801, x=56, x=0, y=0, Y=100] [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=-8401, X=19801, x=56, x=0, x=5600, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=57, v=-8401, X=19801, x=5600, x=56, x=0, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=57, v=-8201, X=19801, x=5600, x=0, x=56, Y=100, y=0] [L45] x++ VAL [counter=57, v=-8201, x=57, x=5600, X=19801, x=0, y=0, Y=100] [L31] EXPR counter++ VAL [counter=58, counter++=57, v=-8201, X=19801, x=57, x=0, x=5600, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=58, v=-8201, x=5700, x=57, X=19801, x=0, y=0, Y=100] [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=-8201, x=5700, x=57, X=19801, x=0, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=58, v=-8201, x=57, x=5700, x=0, X=19801, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=58, v=-8001, x=5700, x=0, X=19801, x=57, Y=100, y=0] [L45] x++ VAL [counter=58, v=-8001, x=0, x=5700, x=58, X=19801, y=0, Y=100] [L31] EXPR counter++ VAL [counter=59, counter++=58, v=-8001, x=5700, X=19801, x=0, x=58, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=59, v=-8001, x=5800, x=58, X=19801, x=0, Y=100, 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=-8001, x=5800, x=58, x=0, X=19801, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=59, v=-8001, X=19801, x=0, x=5800, x=58, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=59, v=-7801, x=0, X=19801, x=5800, x=58, y=0, Y=100] [L45] x++ VAL [counter=59, v=-7801, x=59, x=0, x=5800, X=19801, Y=100, y=0] [L31] EXPR counter++ VAL [counter=60, counter++=59, v=-7801, x=0, x=59, x=5800, X=19801, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=60, v=-7801, X=19801, x=59, x=0, x=5900, Y=100, y=0] [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=-7801, x=0, x=5900, X=19801, x=59, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=60, v=-7801, x=0, x=59, X=19801, x=5900, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=60, v=-7601, x=5900, x=59, x=0, X=19801, Y=100, y=0] [L45] x++ VAL [counter=60, v=-7601, x=0, x=5900, X=19801, x=60, y=0, Y=100] [L31] EXPR counter++ VAL [counter=61, counter++=60, v=-7601, x=0, X=19801, x=60, x=5900, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=61, v=-7601, x=60, x=6000, X=19801, x=0, y=0, Y=100] [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=-7601, x=6000, x=60, x=0, X=19801, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=61, v=-7601, X=19801, x=0, x=6000, x=60, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=61, v=-7401, x=6000, x=0, x=60, X=19801, Y=100, y=0] [L45] x++ VAL [counter=61, v=-7401, X=19801, x=0, x=6000, x=61, Y=100, y=0] [L31] EXPR counter++ VAL [counter=62, counter++=61, v=-7401, X=19801, x=61, x=0, x=6000, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=62, v=-7401, x=0, X=19801, x=6100, x=61, Y=100, y=0] [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=-7401, x=0, X=19801, x=61, x=6100, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=62, v=-7401, x=6100, x=0, X=19801, x=61, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=62, v=-7201, x=61, x=6100, X=19801, x=0, Y=100, y=0] [L45] x++ VAL [counter=62, v=-7201, x=62, x=6100, X=19801, x=0, Y=100, y=0] [L31] EXPR counter++ VAL [counter=63, counter++=62, v=-7201, X=19801, x=0, x=6100, x=62, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=63, v=-7201, X=19801, x=0, x=6200, x=62, Y=100, 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=-7201, x=6200, X=19801, x=62, x=0, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=63, v=-7201, X=19801, x=0, x=6200, x=62, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=63, v=-7001, x=0, X=19801, x=6200, x=62, Y=100, y=0] [L45] x++ VAL [counter=63, v=-7001, X=19801, x=63, x=6200, x=0, y=0, Y=100] [L31] EXPR counter++ VAL [counter=64, counter++=63, v=-7001, X=19801, x=0, x=63, x=6200, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=64, v=-7001, X=19801, x=63, x=0, x=6300, y=0, Y=100] [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=-7001, x=0, x=63, x=6300, X=19801, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=64, v=-7001, x=63, x=6300, x=0, X=19801, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=64, v=-6801, x=0, X=19801, x=63, x=6300, y=0, Y=100] [L45] x++ VAL [counter=64, v=-6801, X=19801, x=64, x=6300, x=0, y=0, Y=100] [L31] EXPR counter++ VAL [counter=65, counter++=64, v=-6801, x=6300, x=0, x=64, X=19801, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=65, v=-6801, x=6400, x=64, X=19801, x=0, Y=100, y=0] [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=-6801, x=0, x=64, X=19801, x=6400, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=65, v=-6801, x=0, X=19801, x=6400, x=64, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=65, v=-6601, X=19801, x=64, x=0, x=6400, Y=100, y=0] [L45] x++ VAL [counter=65, v=-6601, X=19801, x=65, x=6400, x=0, y=0, Y=100] [L31] EXPR counter++ VAL [counter=66, counter++=65, v=-6601, x=0, x=6400, x=65, X=19801, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=66, v=-6601, x=65, x=0, X=19801, x=6500, y=0, Y=100] [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=-6601, X=19801, x=65, x=0, x=6500, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=66, v=-6601, X=19801, x=65, x=0, x=6500, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=66, v=-6401, x=6500, X=19801, x=65, x=0, y=0, Y=100] [L45] x++ VAL [counter=66, v=-6401, X=19801, x=66, x=6500, x=0, Y=100, y=0] [L31] EXPR counter++ VAL [counter=67, counter++=66, v=-6401, X=19801, x=6500, x=66, x=0, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=67, v=-6401, x=0, x=66, X=19801, x=6600, Y=100, y=0] [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=-6401, x=66, x=0, x=6600, X=19801, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=67, v=-6401, x=66, x=0, x=6600, X=19801, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=67, v=-6201, x=0, x=6600, X=19801, x=66, y=0, Y=100] [L45] x++ VAL [counter=67, v=-6201, X=19801, x=0, x=6600, x=67, Y=100, y=0] [L31] EXPR counter++ VAL [counter=68, counter++=67, v=-6201, X=19801, x=0, x=6600, x=67, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=68, v=-6201, x=6700, X=19801, x=0, x=67, y=0, Y=100] [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=-6201, X=19801, x=0, x=67, x=6700, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=68, v=-6201, x=6700, x=0, X=19801, x=67, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=68, v=-6001, x=0, x=67, X=19801, x=6700, y=0, Y=100] [L45] x++ VAL [counter=68, v=-6001, x=68, x=6700, x=0, X=19801, Y=100, y=0] [L31] EXPR counter++ VAL [counter=69, counter++=68, v=-6001, x=68, X=19801, x=6700, x=0, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=69, v=-6001, x=68, x=6800, x=0, X=19801, y=0, Y=100] [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=-6001, x=68, x=0, X=19801, x=6800, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=69, v=-6001, X=19801, x=0, x=6800, x=68, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=69, v=-5801, x=6800, x=0, x=68, X=19801, Y=100, y=0] [L45] x++ VAL [counter=69, v=-5801, x=6800, x=0, X=19801, x=69, Y=100, y=0] [L31] EXPR counter++ VAL [counter=70, counter++=69, v=-5801, x=6800, X=19801, x=69, x=0, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=70, v=-5801, x=0, x=6900, x=69, X=19801, Y=100, y=0] [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=-5801, X=19801, x=6900, x=69, x=0, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=70, v=-5801, x=0, x=6900, x=69, X=19801, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=70, v=-5601, x=0, X=19801, x=6900, x=69, Y=100, y=0] [L45] x++ VAL [counter=70, v=-5601, x=70, x=6900, x=0, X=19801, Y=100, y=0] [L31] EXPR counter++ VAL [counter=71, counter++=70, v=-5601, x=70, X=19801, x=0, x=6900, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=71, v=-5601, x=7000, x=0, X=19801, x=70, Y=100, y=0] [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=-5601, x=70, X=19801, x=7000, x=0, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=71, v=-5601, x=0, x=70, x=7000, X=19801, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=71, v=-5401, x=70, x=7000, X=19801, x=0, y=0, Y=100] [L45] x++ VAL [counter=71, v=-5401, x=0, x=71, X=19801, x=7000, y=0, Y=100] [L31] EXPR counter++ VAL [counter=72, counter++=71, v=-5401, x=7000, x=0, X=19801, x=71, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=72, v=-5401, x=7100, x=71, X=19801, x=0, Y=100, 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=-5401, x=71, x=7100, x=0, X=19801, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=72, v=-5401, X=19801, x=7100, x=71, x=0, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=72, v=-5201, x=7100, x=71, X=19801, x=0, y=0, Y=100] [L45] x++ VAL [counter=72, v=-5201, x=72, x=7100, x=0, X=19801, Y=100, y=0] [L31] EXPR counter++ VAL [counter=73, counter++=72, v=-5201, X=19801, x=72, x=7100, x=0, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=73, v=-5201, x=72, x=7200, X=19801, x=0, Y=100, 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=-5201, x=7200, X=19801, x=72, x=0, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=73, v=-5201, x=0, X=19801, x=72, x=7200, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=73, v=-5001, X=19801, x=0, x=72, x=7200, y=0, Y=100] [L45] x++ VAL [counter=73, v=-5001, x=7200, x=73, x=0, X=19801, Y=100, y=0] [L31] EXPR counter++ VAL [counter=74, counter++=73, v=-5001, x=0, x=7200, x=73, X=19801, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=74, v=-5001, x=73, X=19801, x=7300, x=0, y=0, Y=100] [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=-5001, X=19801, x=7300, x=73, x=0, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=74, v=-5001, x=7300, x=73, x=0, X=19801, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=74, v=-4801, x=0, x=73, X=19801, x=7300, Y=100, y=0] [L45] x++ VAL [counter=74, v=-4801, X=19801, x=0, x=74, x=7300, Y=100, y=0] [L31] EXPR counter++ VAL [counter=75, counter++=74, v=-4801, x=74, x=7300, x=0, X=19801, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=75, v=-4801, X=19801, x=74, x=0, x=7400, Y=100, y=0] [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=-4801, x=0, X=19801, x=74, x=7400, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=75, v=-4801, x=7400, x=74, x=0, X=19801, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=75, v=-4601, X=19801, x=7400, x=74, x=0, Y=100, y=0] [L45] x++ VAL [counter=75, v=-4601, x=7400, x=0, X=19801, x=75, y=0, Y=100] [L31] EXPR counter++ VAL [counter=76, counter++=75, v=-4601, X=19801, x=0, x=75, x=7400, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=76, v=-4601, x=0, x=75, X=19801, x=7500, y=0, Y=100] [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=-4601, X=19801, x=0, x=7500, x=75, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=76, v=-4601, X=19801, x=0, x=75, x=7500, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=76, v=-4401, x=75, x=7500, x=0, X=19801, Y=100, y=0] [L45] x++ VAL [counter=76, v=-4401, x=0, x=76, x=7500, X=19801, Y=100, y=0] [L31] EXPR counter++ VAL [counter=77, counter++=76, v=-4401, X=19801, x=0, x=7500, x=76, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=77, v=-4401, x=7600, x=76, x=0, X=19801, Y=100, 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=-4401, x=76, x=7600, X=19801, x=0, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=77, v=-4401, x=0, x=76, x=7600, X=19801, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=77, v=-4201, x=0, x=7600, X=19801, x=76, y=0, Y=100] [L45] x++ VAL [counter=77, v=-4201, x=7600, x=77, x=0, X=19801, Y=100, y=0] [L31] EXPR counter++ VAL [counter=78, counter++=77, v=-4201, x=0, x=7600, x=77, X=19801, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=78, v=-4201, X=19801, x=0, x=7700, x=77, Y=100, y=0] [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=-4201, x=77, x=0, x=7700, X=19801, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=78, v=-4201, x=0, x=77, x=7700, X=19801, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=78, v=-4001, x=0, X=19801, x=77, x=7700, Y=100, y=0] [L45] x++ VAL [counter=78, v=-4001, X=19801, x=0, x=78, x=7700, Y=100, y=0] [L31] EXPR counter++ VAL [counter=79, counter++=78, v=-4001, x=0, x=7700, x=78, X=19801, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=79, v=-4001, X=19801, x=7800, x=78, x=0, Y=100, 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=-4001, x=0, x=78, x=7800, X=19801, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=79, v=-4001, x=0, x=7800, x=78, X=19801, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=79, v=-3801, X=19801, x=0, x=7800, x=78, Y=100, y=0] [L45] x++ VAL [counter=79, v=-3801, X=19801, x=0, x=79, x=7800, Y=100, y=0] [L31] EXPR counter++ VAL [counter=80, counter++=79, v=-3801, X=19801, x=7800, x=79, x=0, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=80, v=-3801, x=79, x=7900, X=19801, x=0, Y=100, y=0] [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=-3801, x=79, x=0, X=19801, x=7900, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=80, v=-3801, X=19801, x=0, x=7900, x=79, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=80, v=-3601, x=79, x=0, x=7900, X=19801, Y=100, y=0] [L45] x++ VAL [counter=80, v=-3601, x=80, x=0, x=7900, X=19801, y=0, Y=100] [L31] EXPR counter++ VAL [counter=81, counter++=80, v=-3601, X=19801, x=80, x=0, x=7900, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=81, v=-3601, x=80, X=19801, x=8000, x=0, Y=100, y=0] [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=-3601, x=0, X=19801, x=80, x=8000, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=81, v=-3601, x=80, x=0, x=8000, X=19801, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=81, v=-3401, x=80, x=8000, x=0, X=19801, y=0, Y=100] [L45] x++ VAL [counter=81, v=-3401, X=19801, x=81, x=8000, x=0, Y=100, y=0] [L31] EXPR counter++ VAL [counter=82, counter++=81, v=-3401, x=81, x=0, X=19801, x=8000, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=82, v=-3401, x=0, x=8100, x=81, X=19801, Y=100, 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=-3401, x=0, X=19801, x=81, x=8100, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=82, v=-3401, x=81, x=0, X=19801, x=8100, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=82, v=-3201, x=81, x=0, x=8100, X=19801, Y=100, y=0] [L45] x++ VAL [counter=82, v=-3201, x=0, x=82, x=8100, X=19801, Y=100, y=0] [L31] EXPR counter++ VAL [counter=83, counter++=82, v=-3201, x=82, x=8100, X=19801, x=0, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=83, v=-3201, x=82, x=8200, x=0, X=19801, y=0, Y=100] [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=-3201, x=0, X=19801, x=8200, x=82, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=83, v=-3201, x=82, x=8200, X=19801, x=0, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=83, v=-3001, X=19801, x=8200, x=0, x=82, y=0, Y=100] [L45] x++ VAL [counter=83, v=-3001, x=8200, x=0, X=19801, x=83, Y=100, y=0] [L31] EXPR counter++ VAL [counter=84, counter++=83, v=-3001, x=8200, x=0, x=83, X=19801, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=84, v=-3001, x=8300, x=0, x=83, X=19801, y=0, Y=100] [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=-3001, x=0, X=19801, x=8300, x=83, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=84, v=-3001, X=19801, x=8300, x=83, x=0, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=84, v=-2801, x=83, X=19801, x=8300, x=0, Y=100, y=0] [L45] x++ VAL [counter=84, v=-2801, x=8300, X=19801, x=84, x=0, Y=100, y=0] [L31] EXPR counter++ VAL [counter=85, counter++=84, v=-2801, x=0, X=19801, x=84, x=8300, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=85, v=-2801, x=8400, x=0, x=84, X=19801, y=0, Y=100] [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=-2801, x=8400, X=19801, x=84, x=0, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=85, v=-2801, x=8400, x=84, x=0, X=19801, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=85, v=-2601, x=8400, x=0, x=84, X=19801, y=0, Y=100] [L45] x++ VAL [counter=85, v=-2601, x=8400, X=19801, x=85, x=0, y=0, Y=100] [L31] EXPR counter++ VAL [counter=86, counter++=85, v=-2601, x=8400, x=0, X=19801, x=85, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=86, v=-2601, X=19801, x=8500, x=85, x=0, Y=100, y=0] [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=-2601, X=19801, x=0, x=8500, x=85, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=86, v=-2601, x=0, x=8500, X=19801, x=85, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=86, v=-2401, x=85, X=19801, x=8500, x=0, Y=100, y=0] [L45] x++ VAL [counter=86, v=-2401, x=8500, x=86, X=19801, x=0, y=0, Y=100] [L31] EXPR counter++ VAL [counter=87, counter++=86, v=-2401, x=86, X=19801, x=8500, x=0, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=87, v=-2401, x=0, x=8600, X=19801, x=86, y=0, Y=100] [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=-2401, X=19801, x=0, x=86, x=8600, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=87, v=-2401, x=0, X=19801, x=86, x=8600, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=87, v=-2201, x=86, x=0, x=8600, X=19801, y=0, Y=100] [L45] x++ VAL [counter=87, v=-2201, X=19801, x=0, x=87, x=8600, y=0, Y=100] [L31] EXPR counter++ VAL [counter=88, counter++=87, v=-2201, x=0, x=87, x=8600, X=19801, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=88, v=-2201, x=8700, X=19801, x=87, x=0, y=0, Y=100] [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=-2201, X=19801, x=0, x=8700, x=87, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=88, v=-2201, X=19801, x=8700, x=0, x=87, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=88, v=-2001, x=0, X=19801, x=87, x=8700, y=0, Y=100] [L45] x++ VAL [counter=88, v=-2001, x=88, x=8700, x=0, X=19801, Y=100, y=0] [L31] EXPR counter++ VAL [counter=89, counter++=88, v=-2001, x=0, X=19801, x=8700, x=88, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=89, v=-2001, x=0, X=19801, x=88, x=8800, Y=100, y=0] [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=-2001, x=88, x=8800, X=19801, x=0, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=89, v=-2001, X=19801, x=0, x=8800, x=88, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=89, v=-1801, x=8800, x=88, X=19801, x=0, y=0, Y=100] [L45] x++ VAL [counter=89, v=-1801, x=8800, x=0, X=19801, x=89, y=0, Y=100] [L31] EXPR counter++ VAL [counter=90, counter++=89, v=-1801, x=89, X=19801, x=0, x=8800, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=90, v=-1801, X=19801, x=0, x=8900, x=89, y=0, Y=100] [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=-1801, x=89, x=8900, x=0, X=19801, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=90, v=-1801, x=8900, X=19801, x=89, x=0, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=90, v=-1601, x=89, X=19801, x=0, x=8900, y=0, Y=100] [L45] x++ VAL [counter=90, v=-1601, x=90, x=8900, x=0, X=19801, Y=100, y=0] [L31] EXPR counter++ VAL [counter=91, counter++=90, v=-1601, x=0, X=19801, x=90, x=8900, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=91, v=-1601, x=0, X=19801, x=9000, x=90, Y=100, y=0] [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=-1601, x=90, x=0, x=9000, X=19801, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=91, v=-1601, X=19801, x=9000, x=0, x=90, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=91, v=-1401, x=9000, x=90, X=19801, x=0, y=0, Y=100] [L45] x++ VAL [counter=91, v=-1401, X=19801, x=0, x=91, x=9000, Y=100, y=0] [L31] EXPR counter++ VAL [counter=92, counter++=91, v=-1401, X=19801, x=0, x=91, x=9000, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=92, v=-1401, x=0, x=91, x=9100, X=19801, Y=100, y=0] [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=-1401, x=91, X=19801, x=0, x=9100, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=92, v=-1401, x=0, X=19801, x=9100, x=91, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=92, v=-1201, X=19801, x=91, x=9100, x=0, Y=100, y=0] [L45] x++ VAL [counter=92, v=-1201, x=9100, X=19801, x=92, x=0, Y=100, y=0] [L31] EXPR counter++ VAL [counter=93, counter++=92, v=-1201, x=92, X=19801, x=9100, x=0, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=93, v=-1201, x=0, x=92, X=19801, x=9200, y=0, Y=100] [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=-1201, x=92, x=9200, X=19801, x=0, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=93, v=-1201, X=19801, x=0, x=9200, x=92, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=93, v=-1001, x=9200, x=0, x=92, X=19801, Y=100, y=0] [L45] x++ VAL [counter=93, v=-1001, x=0, x=93, x=9200, X=19801, y=0, Y=100] [L31] EXPR counter++ VAL [counter=94, counter++=93, v=-1001, x=0, X=19801, x=93, x=9200, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=94, v=-1001, x=9300, X=19801, x=93, x=0, Y=100, y=0] [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=-1001, x=9300, x=0, X=19801, x=93, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=94, v=-1001, x=0, x=93, x=9300, X=19801, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=94, v=-801, x=9300, X=19801, x=0, x=93, Y=100, y=0] [L45] x++ VAL [counter=94, v=-801, x=9300, x=0, X=19801, x=94, y=0, Y=100] [L31] EXPR counter++ VAL [counter=95, counter++=94, v=-801, X=19801, x=0, x=94, x=9300, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=95, v=-801, X=19801, x=94, x=9400, x=0, y=0, Y=100] [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=-801, X=19801, x=9400, x=0, x=94, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=95, v=-801, x=0, x=9400, x=94, X=19801, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=95, v=-601, x=94, x=9400, X=19801, x=0, Y=100, y=0] [L45] x++ VAL [counter=95, v=-601, x=95, x=0, x=9400, X=19801, Y=100, y=0] [L31] EXPR counter++ VAL [counter=96, counter++=95, v=-601, x=9400, X=19801, x=95, x=0, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=96, v=-601, x=95, x=9500, X=19801, x=0, Y=100, y=0] [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=-601, X=19801, x=0, x=9500, x=95, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=96, v=-601, x=95, x=0, x=9500, X=19801, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=96, v=-401, X=19801, x=9500, x=95, x=0, Y=100, y=0] [L45] x++ VAL [counter=96, v=-401, X=19801, x=9500, x=96, x=0, Y=100, y=0] [L31] EXPR counter++ VAL [counter=97, counter++=96, v=-401, x=96, x=0, X=19801, x=9500, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=97, v=-401, x=96, X=19801, x=0, x=9600, y=0, Y=100] [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=-401, x=0, X=19801, x=9600, x=96, Y=100, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=97, v=-401, x=0, X=19801, x=9600, x=96, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=97, v=-201, x=96, x=9600, X=19801, x=0, y=0, Y=100] [L45] x++ VAL [counter=97, v=-201, x=0, x=9600, x=97, X=19801, y=0, Y=100] [L31] EXPR counter++ VAL [counter=98, counter++=97, v=-201, x=97, X=19801, x=0, x=9600, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=98, v=-201, x=97, X=19801, x=0, x=9700, y=0, Y=100] [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=-201, x=97, X=19801, x=0, x=9700, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=98, v=-201, x=97, x=0, X=19801, x=9700, y=0, Y=100] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=98, v=-1, x=97, X=19801, x=9700, x=0, y=0, Y=100] [L45] x++ VAL [counter=98, v=-1, X=19801, x=98, x=9700, x=0, y=0, Y=100] [L31] EXPR counter++ VAL [counter=99, counter++=98, v=-1, x=98, x=9700, X=19801, x=0, Y=100, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=99, v=-1, x=98, x=9800, x=0, X=19801, y=0, Y=100] [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=-1, x=0, x=9800, X=19801, x=98, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=99, v=-1, X=19801, x=0, x=98, x=9800, Y=100, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=99, v=199, x=98, x=9800, x=0, X=19801, Y=100, y=0] [L45] x++ VAL [counter=99, v=199, x=99, X=19801, x=9800, x=0, Y=100, y=0] [L31] EXPR counter++ VAL [counter=100, counter++=99, v=199, X=19801, x=9800, x=99, x=0, y=0, Y=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=100, v=199, x=9900, x=99, X=19801, x=0, y=0, Y=100] [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=199, X=19801, x=99, x=9900, x=0, y=0, Y=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=100, v=199, x=9900, x=99, x=0, X=19801, Y=100, y=0] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=100, v=-39203, x=99, x=0, x=9900, X=19801, Y=100, y=1] [L45] x++ VAL [counter=100, v=-39203, x=9900, x=100, x=0, X=19801, Y=100, y=1] [L31] EXPR counter++ VAL [counter=101, counter++=100, v=-39203, x=0, X=19801, x=100, x=9900, y=1, Y=100] [L31] COND FALSE !(counter++<100) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=101, v=-39203, x=100, x=10000, x=100, X=19801, Y=100, y=1] [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: 24.8s, OverallIterations: 11, TraceHistogramMax: 101, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1934 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1932 mSDsluCounter, 3118 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2708 mSDsCounter, 250 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2614 IncrementalHoareTripleChecker+Invalid, 2864 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 250 mSolverCounterUnsat, 410 mSDtfsCounter, 2614 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4480 GetRequests, 3742 SyntacticMatches, 95 SemanticMatches, 643 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17058 ImplicationChecksByTransitivity, 13.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2000occurred in iteration=10, InterpolantAutomatonStates: 622, 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, 35 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 3113 NumberOfCodeBlocks, 2903 NumberOfCodeBlocksAsserted, 109 NumberOfCheckSat, 4181 ConstructedInterpolants, 1 QuantifiedInterpolants, 17590 SizeOfPredicates, 209 NumberOfNonLiveVariables, 4894 ConjunctsInSsa, 476 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 28147/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-18 01:15:41,350 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