./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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_unwindbound50.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 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 15:31:35,310 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 15:31:35,312 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 15:31:35,351 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 15:31:35,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 15:31:35,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 15:31:35,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 15:31:35,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 15:31:35,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 15:31:35,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 15:31:35,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 15:31:35,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 15:31:35,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 15:31:35,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 15:31:35,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 15:31:35,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 15:31:35,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 15:31:35,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 15:31:35,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 15:31:35,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 15:31:35,378 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 15:31:35,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 15:31:35,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 15:31:35,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 15:31:35,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 15:31:35,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 15:31:35,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 15:31:35,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 15:31:35,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 15:31:35,385 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 15:31:35,386 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 15:31:35,386 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 15:31:35,387 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 15:31:35,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 15:31:35,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 15:31:35,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 15:31:35,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 15:31:35,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 15:31:35,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 15:31:35,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 15:31:35,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 15:31:35,391 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 15:31:35,392 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 15:31:35,419 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 15:31:35,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 15:31:35,419 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 15:31:35,419 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 15:31:35,420 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 15:31:35,420 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 15:31:35,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 15:31:35,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 15:31:35,421 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 15:31:35,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 15:31:35,421 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 15:31:35,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 15:31:35,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 15:31:35,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 15:31:35,422 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 15:31:35,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 15:31:35,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 15:31:35,422 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 15:31:35,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 15:31:35,423 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 15:31:35,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 15:31:35,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 15:31:35,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 15:31:35,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 15:31:35,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 15:31:35,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 15:31:35,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 15:31:35,425 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 15:31:35,425 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 15:31:35,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 15:31:35,425 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 15:31:35,425 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 15:31:35,425 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 15:31:35,426 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c [2022-07-19 15:31:35,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 15:31:35,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 15:31:35,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 15:31:35,637 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 15:31:35,637 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 15:31:35,638 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2022-07-19 15:31:35,686 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b882d7be/67989e0f1a524a7a9ef5fcaa5863246f/FLAG8e77ffd44 [2022-07-19 15:31:36,063 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 15:31:36,063 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2022-07-19 15:31:36,069 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b882d7be/67989e0f1a524a7a9ef5fcaa5863246f/FLAG8e77ffd44 [2022-07-19 15:31:36,083 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b882d7be/67989e0f1a524a7a9ef5fcaa5863246f [2022-07-19 15:31:36,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 15:31:36,085 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 15:31:36,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 15:31:36,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 15:31:36,088 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 15:31:36,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 03:31:36" (1/1) ... [2022-07-19 15:31:36,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@228c384d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:31:36, skipping insertion in model container [2022-07-19 15:31:36,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 03:31:36" (1/1) ... [2022-07-19 15:31:36,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 15:31:36,102 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 15:31:36,286 WARN L230 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_unwindbound50.c[597,610] [2022-07-19 15:31:36,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 15:31:36,313 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 15:31:36,323 WARN L230 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_unwindbound50.c[597,610] [2022-07-19 15:31:36,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 15:31:36,347 INFO L208 MainTranslator]: Completed translation [2022-07-19 15:31:36,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:31:36 WrapperNode [2022-07-19 15:31:36,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 15:31:36,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 15:31:36,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 15:31:36,349 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 15:31:36,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:31:36" (1/1) ... [2022-07-19 15:31:36,359 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:31:36" (1/1) ... [2022-07-19 15:31:36,374 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-07-19 15:31:36,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 15:31:36,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 15:31:36,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 15:31:36,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 15:31:36,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:31:36" (1/1) ... [2022-07-19 15:31:36,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:31:36" (1/1) ... [2022-07-19 15:31:36,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:31:36" (1/1) ... [2022-07-19 15:31:36,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:31:36" (1/1) ... [2022-07-19 15:31:36,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:31:36" (1/1) ... [2022-07-19 15:31:36,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:31:36" (1/1) ... [2022-07-19 15:31:36,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:31:36" (1/1) ... [2022-07-19 15:31:36,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 15:31:36,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 15:31:36,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 15:31:36,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 15:31:36,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:31:36" (1/1) ... [2022-07-19 15:31:36,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 15:31:36,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:31:36,413 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) [2022-07-19 15:31:36,415 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 [2022-07-19 15:31:36,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 15:31:36,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 15:31:36,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 15:31:36,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 15:31:36,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 15:31:36,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 15:31:36,481 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 15:31:36,483 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 15:31:36,596 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 15:31:36,600 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 15:31:36,600 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 15:31:36,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 03:31:36 BoogieIcfgContainer [2022-07-19 15:31:36,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 15:31:36,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 15:31:36,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 15:31:36,606 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 15:31:36,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 03:31:36" (1/3) ... [2022-07-19 15:31:36,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f815736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 03:31:36, skipping insertion in model container [2022-07-19 15:31:36,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:31:36" (2/3) ... [2022-07-19 15:31:36,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f815736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 03:31:36, skipping insertion in model container [2022-07-19 15:31:36,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 03:31:36" (3/3) ... [2022-07-19 15:31:36,609 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2022-07-19 15:31:36,620 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 15:31:36,620 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 15:31:36,650 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 15:31:36,655 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1f2b64b1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@52a99b01 [2022-07-19 15:31:36,655 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 15:31:36,658 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) [2022-07-19 15:31:36,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-19 15:31:36,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:31:36,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:31:36,663 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:31:36,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:31:36,667 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2022-07-19 15:31:36,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:31:36,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881868365] [2022-07-19 15:31:36,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:31:36,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:31:36,772 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:31:36,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1179689244] [2022-07-19 15:31:36,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:31:36,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:31:36,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:31:36,775 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) [2022-07-19 15:31:36,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 15:31:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:31:36,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 15:31:36,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:31:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:31:37,040 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 15:31:37,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:31:37,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881868365] [2022-07-19 15:31:37,041 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:31:37,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179689244] [2022-07-19 15:31:37,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179689244] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:31:37,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:31:37,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 15:31:37,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788442886] [2022-07-19 15:31:37,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:31:37,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 15:31:37,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:31:37,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 15:31:37,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 15:31:37,080 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) [2022-07-19 15:31:37,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:31:37,224 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-07-19 15:31:37,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 15:31:37,226 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 [2022-07-19 15:31:37,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:31:37,231 INFO L225 Difference]: With dead ends: 54 [2022-07-19 15:31:37,231 INFO L226 Difference]: Without dead ends: 25 [2022-07-19 15:31:37,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 15:31:37,238 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:31:37,239 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] [2022-07-19 15:31:37,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-19 15:31:37,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-07-19 15:31:37,264 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) [2022-07-19 15:31:37,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-07-19 15:31:37,266 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2022-07-19 15:31:37,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:31:37,267 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-19 15:31:37,267 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) [2022-07-19 15:31:37,267 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-07-19 15:31:37,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 15:31:37,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:31:37,268 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:31:37,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 15:31:37,485 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 [2022-07-19 15:31:37,486 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:31:37,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:31:37,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2022-07-19 15:31:37,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:31:37,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201995877] [2022-07-19 15:31:37,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:31:37,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:31:37,496 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:31:37,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [643965046] [2022-07-19 15:31:37,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:31:37,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:31:37,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:31:37,504 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) [2022-07-19 15:31:37,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 15:31:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:31:37,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-19 15:31:37,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:31:37,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:31:37,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:31:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 15:31:37,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:31:37,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201995877] [2022-07-19 15:31:37,735 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:31:37,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643965046] [2022-07-19 15:31:37,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643965046] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:31:37,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:31:37,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-07-19 15:31:37,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415950224] [2022-07-19 15:31:37,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:31:37,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 15:31:37,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:31:37,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 15:31:37,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-19 15:31:37,739 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 15:31:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:31:37,950 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-07-19 15:31:37,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 15:31:37,951 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 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 [2022-07-19 15:31:37,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:31:37,952 INFO L225 Difference]: With dead ends: 41 [2022-07-19 15:31:37,953 INFO L226 Difference]: Without dead ends: 34 [2022-07-19 15:31:37,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-19 15:31:37,954 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 15:31:37,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 64 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 15:31:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-19 15:31:37,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-07-19 15:31:37,961 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) [2022-07-19 15:31:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-07-19 15:31:37,962 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2022-07-19 15:31:37,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:31:37,963 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-07-19 15:31:37,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 15:31:37,963 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-07-19 15:31:37,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 15:31:37,965 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:31:37,965 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:31:37,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 15:31:38,166 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 [2022-07-19 15:31:38,166 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:31:38,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:31:38,167 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2022-07-19 15:31:38,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:31:38,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537942014] [2022-07-19 15:31:38,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:31:38,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:31:38,175 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:31:38,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [201120205] [2022-07-19 15:31:38,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:31:38,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:31:38,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:31:38,196 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) [2022-07-19 15:31:38,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 15:31:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:31:38,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 15:31:38,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:31:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:31:38,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:31:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:31:38,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:31:38,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537942014] [2022-07-19 15:31:38,300 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:31:38,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201120205] [2022-07-19 15:31:38,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201120205] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:31:38,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:31:38,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-07-19 15:31:38,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852104019] [2022-07-19 15:31:38,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:31:38,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 15:31:38,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:31:38,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 15:31:38,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-19 15:31:38,302 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) [2022-07-19 15:31:38,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:31:38,362 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2022-07-19 15:31:38,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 15:31:38,362 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 [2022-07-19 15:31:38,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:31:38,363 INFO L225 Difference]: With dead ends: 73 [2022-07-19 15:31:38,364 INFO L226 Difference]: Without dead ends: 67 [2022-07-19 15:31:38,364 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 [2022-07-19 15:31:38,365 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 45 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:31:38,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 100 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:31:38,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-19 15:31:38,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-07-19 15:31:38,377 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) [2022-07-19 15:31:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-07-19 15:31:38,378 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2022-07-19 15:31:38,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:31:38,378 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-07-19 15:31:38,379 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) [2022-07-19 15:31:38,379 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-07-19 15:31:38,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 15:31:38,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:31:38,379 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:31:38,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 15:31:38,596 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 [2022-07-19 15:31:38,597 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:31:38,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:31:38,598 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2022-07-19 15:31:38,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:31:38,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180450982] [2022-07-19 15:31:38,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:31:38,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:31:38,605 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:31:38,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [302092247] [2022-07-19 15:31:38,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:31:38,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:31:38,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:31:38,607 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) [2022-07-19 15:31:38,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 15:31:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:31:38,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-19 15:31:38,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:31:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 15:31:38,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:31:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 15:31:39,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:31:39,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180450982] [2022-07-19 15:31:39,195 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:31:39,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302092247] [2022-07-19 15:31:39,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302092247] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:31:39,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:31:39,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-07-19 15:31:39,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128131185] [2022-07-19 15:31:39,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:31:39,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 15:31:39,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:31:39,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 15:31:39,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-07-19 15:31:39,198 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-19 15:31:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:31:39,748 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2022-07-19 15:31:39,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-19 15:31:39,749 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 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 [2022-07-19 15:31:39,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:31:39,750 INFO L225 Difference]: With dead ends: 81 [2022-07-19 15:31:39,750 INFO L226 Difference]: Without dead ends: 73 [2022-07-19 15:31:39,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=216, Invalid=1116, Unknown=0, NotChecked=0, Total=1332 [2022-07-19 15:31:39,752 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 39 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 15:31:39,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 106 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 271 Invalid, 0 Unknown, 90 Unchecked, 0.2s Time] [2022-07-19 15:31:39,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-19 15:31:39,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2022-07-19 15:31:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 15:31:39,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-07-19 15:31:39,764 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 25 [2022-07-19 15:31:39,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:31:39,764 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-07-19 15:31:39,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-19 15:31:39,765 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-07-19 15:31:39,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 15:31:39,765 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:31:39,765 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:31:39,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 15:31:39,983 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 [2022-07-19 15:31:39,983 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:31:39,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:31:39,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2021783820, now seen corresponding path program 1 times [2022-07-19 15:31:39,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:31:39,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721229563] [2022-07-19 15:31:39,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:31:39,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:31:40,002 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:31:40,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [392891000] [2022-07-19 15:31:40,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:31:40,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:31:40,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:31:40,004 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) [2022-07-19 15:31:40,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 15:31:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:31:40,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-19 15:31:40,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:31:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 15:31:45,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:31:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 15:31:45,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:31:45,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721229563] [2022-07-19 15:31:45,729 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:31:45,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392891000] [2022-07-19 15:31:45,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392891000] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:31:45,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:31:45,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-07-19 15:31:45,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13724037] [2022-07-19 15:31:45,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:31:45,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 15:31:45,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:31:45,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 15:31:45,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-19 15:31:45,731 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 15:31:47,738 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:31:51,780 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:31:53,784 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:31:55,818 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:31:57,832 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:32:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:32:00,041 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2022-07-19 15:32:00,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 15:32:00,041 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 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 35 [2022-07-19 15:32:00,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:32:00,042 INFO L225 Difference]: With dead ends: 92 [2022-07-19 15:32:00,042 INFO L226 Difference]: Without dead ends: 86 [2022-07-19 15:32:00,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=66, Invalid=238, Unknown=2, NotChecked=0, Total=306 [2022-07-19 15:32:00,043 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 13 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:32:00,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 59 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 116 Invalid, 5 Unknown, 0 Unchecked, 10.1s Time] [2022-07-19 15:32:00,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-19 15:32:00,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2022-07-19 15:32:00,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.173913043478261) internal successors, (81), 69 states have internal predecessors, (81), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-19 15:32:00,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2022-07-19 15:32:00,053 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 35 [2022-07-19 15:32:00,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:32:00,053 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2022-07-19 15:32:00,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 15:32:00,054 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2022-07-19 15:32:00,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 15:32:00,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:32:00,055 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:32:00,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 15:32:00,255 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 [2022-07-19 15:32:00,256 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:32:00,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:32:00,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2132634866, now seen corresponding path program 1 times [2022-07-19 15:32:00,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:32:00,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861331812] [2022-07-19 15:32:00,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:32:00,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:32:00,270 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:32:00,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [592271688] [2022-07-19 15:32:00,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:32:00,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:32:00,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:32:00,275 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) [2022-07-19 15:32:00,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 15:32:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:32:00,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 15:32:00,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:32:00,465 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 15:32:00,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:32:00,565 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 15:32:00,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:32:00,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861331812] [2022-07-19 15:32:00,566 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:32:00,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592271688] [2022-07-19 15:32:00,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592271688] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:32:00,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:32:00,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-19 15:32:00,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584160152] [2022-07-19 15:32:00,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:32:00,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 15:32:00,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:32:00,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 15:32:00,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-19 15:32:00,569 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 15:32:00,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:32:00,705 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-07-19 15:32:00,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 15:32:00,706 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2022-07-19 15:32:00,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:32:00,707 INFO L225 Difference]: With dead ends: 93 [2022-07-19 15:32:00,707 INFO L226 Difference]: Without dead ends: 87 [2022-07-19 15:32:00,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-07-19 15:32:00,708 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:32:00,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 77 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:32:00,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-19 15:32:00,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2022-07-19 15:32:00,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-19 15:32:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2022-07-19 15:32:00,724 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 35 [2022-07-19 15:32:00,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:32:00,725 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2022-07-19 15:32:00,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 15:32:00,726 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2022-07-19 15:32:00,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 15:32:00,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:32:00,730 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:32:00,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 15:32:00,948 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 [2022-07-19 15:32:00,949 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:32:00,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:32:00,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1410392757, now seen corresponding path program 2 times [2022-07-19 15:32:00,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:32:00,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232414968] [2022-07-19 15:32:00,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:32:00,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:32:00,960 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:32:00,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [370570766] [2022-07-19 15:32:00,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 15:32:00,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:32:00,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:32:00,962 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) [2022-07-19 15:32:00,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 15:32:01,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 15:32:01,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:32:01,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 15:32:01,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:32:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 15:32:01,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:32:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 15:32:01,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:32:01,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232414968] [2022-07-19 15:32:01,234 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:32:01,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370570766] [2022-07-19 15:32:01,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370570766] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:32:01,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:32:01,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-19 15:32:01,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876610670] [2022-07-19 15:32:01,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:32:01,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 15:32:01,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:32:01,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 15:32:01,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-07-19 15:32:01,236 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-19 15:32:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:32:01,464 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2022-07-19 15:32:01,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 15:32:01,464 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 45 [2022-07-19 15:32:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:32:01,465 INFO L225 Difference]: With dead ends: 104 [2022-07-19 15:32:01,465 INFO L226 Difference]: Without dead ends: 98 [2022-07-19 15:32:01,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-07-19 15:32:01,466 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:32:01,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 79 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:32:01,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-19 15:32:01,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2022-07-19 15:32:01,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 70 states have internal predecessors, (82), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-19 15:32:01,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2022-07-19 15:32:01,482 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 45 [2022-07-19 15:32:01,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:32:01,482 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2022-07-19 15:32:01,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-19 15:32:01,482 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2022-07-19 15:32:01,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 15:32:01,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:32:01,484 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:32:01,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 15:32:01,684 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 [2022-07-19 15:32:01,685 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:32:01,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:32:01,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1900020427, now seen corresponding path program 3 times [2022-07-19 15:32:01,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:32:01,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823588120] [2022-07-19 15:32:01,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:32:01,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:32:01,691 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:32:01,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1259262445] [2022-07-19 15:32:01,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 15:32:01,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:32:01,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:32:01,700 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) [2022-07-19 15:32:01,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 15:32:02,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-19 15:32:02,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:32:02,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-19 15:32:02,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:32:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-19 15:32:20,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:32:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-19 15:32:25,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:32:25,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823588120] [2022-07-19 15:32:25,266 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:32:25,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259262445] [2022-07-19 15:32:25,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259262445] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:32:25,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:32:25,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2022-07-19 15:32:25,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525232299] [2022-07-19 15:32:25,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:32:25,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 15:32:25,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:32:25,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 15:32:25,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=219, Unknown=5, NotChecked=0, Total=272 [2022-07-19 15:32:25,267 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 15:32:27,274 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:32:30,105 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:32:32,197 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:32:34,213 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:32:36,239 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:32:40,272 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:32:42,373 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~X~0#1| 1)) (.cse7 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~X~0#1|))) (and (let ((.cse5 (= |c_ULTIMATE.start_main_~Y~0#1| 0)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~X~0#1| |c_ULTIMATE.start_main_~v~0#1| (* |c_ULTIMATE.start_main_~y~0#1| (- 2) |c_ULTIMATE.start_main_~X~0#1|)) 2) 0)) (.cse3 (+ (* (- 1) |c_ULTIMATE.start_main_~Y~0#1|) .cse7 (div (+ (* (- 1) |c_ULTIMATE.start_main_~v~0#1|) (* (- 1) |c_ULTIMATE.start_main_~X~0#1|)) (- 2))))) (or (and (let ((.cse2 (= |c_ULTIMATE.start_main_~y~0#1| 0))) (or (let ((.cse0 (div |c_ULTIMATE.start_main_~xy~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (and (= |c_ULTIMATE.start_main_~yx~0#1| (* |c_ULTIMATE.start_main_~Y~0#1| .cse0)) (= (mod |c_ULTIMATE.start_main_~xy~0#1| |c_ULTIMATE.start_main_~y~0#1|) 0) (<= .cse0 .cse1) (not (<= .cse0 |c_ULTIMATE.start_main_~X~0#1|)) (not .cse2))) (and (= |c_ULTIMATE.start_main_~xy~0#1| 0) (= |c_ULTIMATE.start_main_~yx~0#1| 0) .cse2))) (= .cse3 0) .cse4 .cse5) (let ((.cse6 (div .cse3 |c_ULTIMATE.start_main_~Y~0#1|))) (and (<= .cse6 .cse1) (not .cse5) (= |c_ULTIMATE.start_main_~xy~0#1| (* |c_ULTIMATE.start_main_~y~0#1| .cse6)) (= |c_ULTIMATE.start_main_~yx~0#1| (* |c_ULTIMATE.start_main_~Y~0#1| .cse6)) (not (<= .cse6 |c_ULTIMATE.start_main_~X~0#1|)) .cse4 (= (mod .cse3 |c_ULTIMATE.start_main_~Y~0#1|) 0))))) (<= |c_ULTIMATE.start_main_~x~0#1| .cse1) (not (<= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~X~0#1|)) (= (+ |c_ULTIMATE.start_main_~X~0#1| (* 2 .cse7) |c_ULTIMATE.start_main_~v~0#1|) (+ (* |c_ULTIMATE.start_main_~Y~0#1| 2) (* 2 (* |c_ULTIMATE.start_main_~Y~0#1| |c_ULTIMATE.start_main_~x~0#1|)))))) is different from false [2022-07-19 15:32:42,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:32:42,472 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2022-07-19 15:32:42,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 15:32:42,472 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 5 states have call successors, (5), 2 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 45 [2022-07-19 15:32:42,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:32:42,473 INFO L225 Difference]: With dead ends: 93 [2022-07-19 15:32:42,473 INFO L226 Difference]: Without dead ends: 87 [2022-07-19 15:32:42,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=111, Invalid=487, Unknown=6, NotChecked=46, Total=650 [2022-07-19 15:32:42,474 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 17 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2022-07-19 15:32:42,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 83 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 195 Invalid, 6 Unknown, 1 Unchecked, 12.5s Time] [2022-07-19 15:32:42,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-19 15:32:42,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 50. [2022-07-19 15:32:42,480 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) [2022-07-19 15:32:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-07-19 15:32:42,481 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 45 [2022-07-19 15:32:42,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:32:42,481 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-07-19 15:32:42,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 15:32:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-07-19 15:32:42,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-19 15:32:42,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:32:42,481 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:32:42,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 15:32:42,682 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 [2022-07-19 15:32:42,682 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:32:42,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:32:42,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 1 times [2022-07-19 15:32:42,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:32:42,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142931897] [2022-07-19 15:32:42,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:32:42,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:32:42,689 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:32:42,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1212282814] [2022-07-19 15:32:42,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:32:42,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:32:42,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:32:42,706 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) [2022-07-19 15:32:42,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 15:32:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:32:42,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 15:32:42,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:32:42,810 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:32:42,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:32:42,890 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 15:32:42,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:32:42,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142931897] [2022-07-19 15:32:42,890 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:32:42,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212282814] [2022-07-19 15:32:42,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212282814] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:32:42,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:32:42,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-07-19 15:32:42,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481839560] [2022-07-19 15:32:42,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:32:42,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 15:32:42,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:32:42,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 15:32:42,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-07-19 15:32:42,892 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) [2022-07-19 15:32:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:32:43,043 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-07-19 15:32:43,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-19 15:32:43,043 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 [2022-07-19 15:32:43,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:32:43,045 INFO L225 Difference]: With dead ends: 116 [2022-07-19 15:32:43,045 INFO L226 Difference]: Without dead ends: 110 [2022-07-19 15:32:43,045 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 [2022-07-19 15:32:43,047 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 111 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:32:43,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 154 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:32:43,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-19 15:32:43,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-07-19 15:32:43,073 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) [2022-07-19 15:32:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2022-07-19 15:32:43,074 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 49 [2022-07-19 15:32:43,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:32:43,074 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2022-07-19 15:32:43,074 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) [2022-07-19 15:32:43,074 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2022-07-19 15:32:43,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-19 15:32:43,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:32:43,075 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:32:43,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 15:32:43,275 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 [2022-07-19 15:32:43,276 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:32:43,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:32:43,276 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 2 times [2022-07-19 15:32:43,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:32:43,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841870921] [2022-07-19 15:32:43,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:32:43,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:32:43,284 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:32:43,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [37225465] [2022-07-19 15:32:43,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 15:32:43,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:32:43,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:32:43,289 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) [2022-07-19 15:32:43,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-19 15:32:43,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 15:32:43,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:32:43,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-19 15:32:43,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:32:43,605 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:32:43,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:32:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-19 15:32:43,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:32:43,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841870921] [2022-07-19 15:32:43,857 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:32:43,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37225465] [2022-07-19 15:32:43,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37225465] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:32:43,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:32:43,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-07-19 15:32:43,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891466778] [2022-07-19 15:32:43,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:32:43,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-19 15:32:43,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:32:43,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-19 15:32:43,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-07-19 15:32:43,859 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) [2022-07-19 15:32:44,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:32:44,220 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2022-07-19 15:32:44,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-19 15:32:44,221 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 [2022-07-19 15:32:44,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:32:44,222 INFO L225 Difference]: With dead ends: 236 [2022-07-19 15:32:44,222 INFO L226 Difference]: Without dead ends: 230 [2022-07-19 15:32:44,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-07-19 15:32:44,223 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 329 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:32:44,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 298 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:32:44,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-19 15:32:44,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2022-07-19 15:32:44,257 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) [2022-07-19 15:32:44,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2022-07-19 15:32:44,259 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 109 [2022-07-19 15:32:44,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:32:44,260 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2022-07-19 15:32:44,260 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) [2022-07-19 15:32:44,261 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2022-07-19 15:32:44,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-07-19 15:32:44,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:32:44,266 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:32:44,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 15:32:44,479 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 [2022-07-19 15:32:44,480 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:32:44,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:32:44,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1294150550, now seen corresponding path program 3 times [2022-07-19 15:32:44,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:32:44,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990073484] [2022-07-19 15:32:44,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:32:44,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:32:44,490 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:32:44,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1398126061] [2022-07-19 15:32:44,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 15:32:44,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:32:44,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:32:44,495 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) [2022-07-19 15:32:44,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-19 15:32:44,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-19 15:32:44,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:32:44,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-19 15:32:44,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:32:48,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 234 proven. 1 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2022-07-19 15:32:48,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:32:49,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:32:49,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990073484] [2022-07-19 15:32:49,207 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:32:49,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398126061] [2022-07-19 15:32:49,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398126061] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:32:49,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-19 15:32:49,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-07-19 15:32:49,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821068734] [2022-07-19 15:32:49,208 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-19 15:32:49,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 15:32:49,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:32:49,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 15:32:49,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=254, Unknown=1, NotChecked=0, Total=306 [2022-07-19 15:32:49,209 INFO L87 Difference]: Start difference. First operand 230 states and 252 transitions. Second operand has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 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) [2022-07-19 15:32:51,215 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:32:55,247 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:32:57,251 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:32:59,258 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:33:01,277 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:33:03,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:33:03,529 INFO L93 Difference]: Finished difference Result 449 states and 492 transitions. [2022-07-19 15:33:03,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 15:33:03,530 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 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) Word has length 229 [2022-07-19 15:33:03,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:33:03,531 INFO L225 Difference]: With dead ends: 449 [2022-07-19 15:33:03,532 INFO L226 Difference]: Without dead ends: 443 [2022-07-19 15:33:03,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 231 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=94, Invalid=409, Unknown=3, NotChecked=0, Total=506 [2022-07-19 15:33:03,532 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:33:03,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 43 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 5 Unknown, 0 Unchecked, 10.1s Time] [2022-07-19 15:33:03,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-07-19 15:33:03,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2022-07-19 15:33:03,559 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) [2022-07-19 15:33:03,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 483 transitions. [2022-07-19 15:33:03,561 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 483 transitions. Word has length 229 [2022-07-19 15:33:03,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:33:03,561 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 483 transitions. [2022-07-19 15:33:03,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 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) [2022-07-19 15:33:03,561 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 483 transitions. [2022-07-19 15:33:03,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-07-19 15:33:03,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:33:03,563 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:33:03,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-19 15:33:03,776 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 [2022-07-19 15:33:03,776 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:33:03,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:33:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash -614092180, now seen corresponding path program 1 times [2022-07-19 15:33:03,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:33:03,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563261278] [2022-07-19 15:33:03,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:03,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:33:03,793 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:33:03,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [956260134] [2022-07-19 15:33:03,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:03,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:33:03,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:33:03,794 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 15:33:03,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-19 15:33:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:33:03,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-19 15:33:03,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:33:04,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:33:04,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:33:05,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 1430 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-07-19 15:33:05,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:33:05,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563261278] [2022-07-19 15:33:05,012 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:33:05,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956260134] [2022-07-19 15:33:05,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956260134] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:33:05,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:33:05,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-07-19 15:33:05,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819702075] [2022-07-19 15:33:05,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:33:05,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-19 15:33:05,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:33:05,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-19 15:33:05,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-07-19 15:33:05,014 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) [2022-07-19 15:33:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:33:06,164 INFO L93 Difference]: Finished difference Result 929 states and 1043 transitions. [2022-07-19 15:33:06,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-07-19 15:33:06,164 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 [2022-07-19 15:33:06,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:33:06,167 INFO L225 Difference]: With dead ends: 929 [2022-07-19 15:33:06,167 INFO L226 Difference]: Without dead ends: 923 [2022-07-19 15:33:06,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-07-19 15:33:06,170 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 658 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 15:33:06,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 532 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 15:33:06,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2022-07-19 15:33:06,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2022-07-19 15:33:06,220 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) [2022-07-19 15:33:06,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1011 transitions. [2022-07-19 15:33:06,223 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1011 transitions. Word has length 229 [2022-07-19 15:33:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:33:06,223 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 1011 transitions. [2022-07-19 15:33:06,223 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) [2022-07-19 15:33:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1011 transitions. [2022-07-19 15:33:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2022-07-19 15:33:06,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:33:06,228 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:33:06,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-19 15:33:06,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-19 15:33:06,455 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:33:06,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:33:06,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1651100380, now seen corresponding path program 2 times [2022-07-19 15:33:06,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:33:06,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27778810] [2022-07-19 15:33:06,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:06,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:33:06,474 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:33:06,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2003183286] [2022-07-19 15:33:06,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 15:33:06,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:33:06,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:33:06,488 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 15:33:06,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-19 15:33:06,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 15:33:06,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:33:06,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-19 15:33:06,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:33:07,888 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:33:07,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:33:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 6302 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2022-07-19 15:33:08,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:33:08,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27778810] [2022-07-19 15:33:08,373 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:33:08,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003183286] [2022-07-19 15:33:08,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003183286] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:33:08,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:33:08,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2022-07-19 15:33:08,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525849787] [2022-07-19 15:33:08,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:33:08,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-19 15:33:08,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:33:08,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-19 15:33:08,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-07-19 15:33:08,375 INFO L87 Difference]: Start difference. First operand 920 states and 1011 transitions. Second operand has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) [2022-07-19 15:33:09,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:33:09,592 INFO L93 Difference]: Finished difference Result 1009 states and 1111 transitions. [2022-07-19 15:33:09,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-07-19 15:33:09,593 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) Word has length 469 [2022-07-19 15:33:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:33:09,596 INFO L225 Difference]: With dead ends: 1009 [2022-07-19 15:33:09,597 INFO L226 Difference]: Without dead ends: 1003 [2022-07-19 15:33:09,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 985 GetRequests, 883 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2022-07-19 15:33:09,600 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 532 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 15:33:09,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 491 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 15:33:09,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-07-19 15:33:09,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1000. [2022-07-19 15:33:09,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 800 states have (on average 1.125) internal successors, (900), 800 states have internal predecessors, (900), 100 states have call successors, (100), 100 states have call predecessors, (100), 99 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2022-07-19 15:33:09,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1099 transitions. [2022-07-19 15:33:09,656 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1099 transitions. Word has length 469 [2022-07-19 15:33:09,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:33:09,657 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 1099 transitions. [2022-07-19 15:33:09,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) [2022-07-19 15:33:09,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1099 transitions. [2022-07-19 15:33:09,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2022-07-19 15:33:09,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:33:09,664 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:33:09,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-19 15:33:09,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-19 15:33:09,880 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:33:09,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:33:09,880 INFO L85 PathProgramCache]: Analyzing trace with hash -234739816, now seen corresponding path program 3 times [2022-07-19 15:33:09,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:33:09,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088678482] [2022-07-19 15:33:09,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:09,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:33:09,893 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:33:09,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [687637554] [2022-07-19 15:33:09,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 15:33:09,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:33:09,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:33:09,895 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 15:33:09,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-19 15:33:10,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2022-07-19 15:33:10,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-19 15:33:10,381 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 15:33:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 15:33:10,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 15:33:10,776 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 15:33:10,777 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 15:33:10,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-19 15:33:10,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:33:10,989 INFO L356 BasicCegarLoop]: Path program histogram: [3, 3, 3, 1, 1, 1, 1, 1] [2022-07-19 15:33:10,992 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 15:33:11,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 03:33:11 BoogieIcfgContainer [2022-07-19 15:33:11,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 15:33:11,137 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 15:33:11,137 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 15:33:11,137 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 15:33:11,138 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 03:31:36" (3/4) ... [2022-07-19 15:33:11,139 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 15:33:11,260 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 15:33:11,260 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 15:33:11,261 INFO L158 Benchmark]: Toolchain (without parser) took 95175.52ms. Allocated memory was 90.2MB in the beginning and 159.4MB in the end (delta: 69.2MB). Free memory was 52.5MB in the beginning and 123.9MB in the end (delta: -71.4MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. [2022-07-19 15:33:11,261 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 90.2MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 15:33:11,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.50ms. Allocated memory is still 90.2MB. Free memory was 52.3MB in the beginning and 65.1MB in the end (delta: -12.7MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-07-19 15:33:11,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.78ms. Allocated memory is still 90.2MB. Free memory was 64.8MB in the beginning and 63.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 15:33:11,262 INFO L158 Benchmark]: Boogie Preprocessor took 13.13ms. Allocated memory is still 90.2MB. Free memory was 63.5MB in the beginning and 62.5MB in the end (delta: 959.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 15:33:11,262 INFO L158 Benchmark]: RCFGBuilder took 212.24ms. Allocated memory is still 90.2MB. Free memory was 62.3MB in the beginning and 52.8MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 15:33:11,262 INFO L158 Benchmark]: TraceAbstraction took 94532.93ms. Allocated memory was 90.2MB in the beginning and 159.4MB in the end (delta: 69.2MB). Free memory was 52.3MB in the beginning and 58.8MB in the end (delta: -6.5MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. [2022-07-19 15:33:11,263 INFO L158 Benchmark]: Witness Printer took 123.24ms. Allocated memory is still 159.4MB. Free memory was 58.8MB in the beginning and 123.9MB in the end (delta: -65.1MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2022-07-19 15:33:11,268 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.15ms. Allocated memory is still 90.2MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.50ms. Allocated memory is still 90.2MB. Free memory was 52.3MB in the beginning and 65.1MB in the end (delta: -12.7MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.78ms. Allocated memory is still 90.2MB. Free memory was 64.8MB in the beginning and 63.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 13.13ms. Allocated memory is still 90.2MB. Free memory was 63.5MB in the beginning and 62.5MB in the end (delta: 959.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 212.24ms. Allocated memory is still 90.2MB. Free memory was 62.3MB in the beginning and 52.8MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 94532.93ms. Allocated memory was 90.2MB in the beginning and 159.4MB in the end (delta: 69.2MB). Free memory was 52.3MB in the beginning and 58.8MB in the end (delta: -6.5MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. * Witness Printer took 123.24ms. Allocated memory is still 159.4MB. Free memory was 58.8MB in the beginning and 123.9MB in the end (delta: -65.1MB). Peak memory consumption was 21.9MB. 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=-193, x=0, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=-193, X=197, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=-193, x=0, x=0, x=0, X=197, Y=2, 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=-193, x=0, x=0, x=0, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=1, v=-193, x=0, X=197, x=0, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=1, v=-189, x=0, X=197, x=0, x=0, y=0, Y=2] [L45] x++ VAL [counter=1, v=-189, X=197, x=0, x=1, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-189, x=0, X=197, x=0, x=1, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=-189, x=1, x=2, x=0, X=197, y=0, Y=2] [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=-189, x=2, X=197, x=0, x=1, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=2, v=-189, x=1, X=197, x=2, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=2, v=-185, X=197, x=0, x=1, x=2, Y=2, y=0] [L45] x++ VAL [counter=2, v=-185, x=0, x=2, X=197, x=2, y=0, Y=2] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=-185, x=0, X=197, x=2, x=2, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=-185, x=2, x=0, X=197, x=4, y=0, Y=2] [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=-185, X=197, x=0, x=2, x=4, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=3, v=-185, x=2, X=197, x=0, x=4, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=3, v=-181, x=4, x=0, x=2, X=197, y=0, Y=2] [L45] x++ VAL [counter=3, v=-181, x=0, x=4, X=197, x=3, Y=2, y=0] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=-181, x=3, x=4, X=197, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=-181, x=3, x=0, x=6, X=197, y=0, Y=2] [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=-181, x=3, x=0, X=197, x=6, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=4, v=-181, x=6, x=3, x=0, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=4, v=-177, x=6, x=3, x=0, X=197, y=0, Y=2] [L45] x++ VAL [counter=4, v=-177, x=0, X=197, x=4, x=6, y=0, Y=2] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=-177, X=197, x=4, x=0, x=6, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=-177, x=8, X=197, x=0, x=4, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=5, v=-177, X=197, x=4, x=0, x=8, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=5, v=-177, x=0, x=4, X=197, x=8, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=5, v=-173, x=8, x=4, x=0, X=197, y=0, Y=2] [L45] x++ VAL [counter=5, v=-173, X=197, x=5, x=0, x=8, y=0, Y=2] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-173, x=8, x=0, X=197, x=5, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=-173, x=0, x=5, x=10, X=197, y=0, Y=2] [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=-173, X=197, x=0, x=5, x=10, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=6, v=-173, x=5, x=0, X=197, x=10, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=6, v=-169, x=5, x=0, x=10, X=197, y=0, Y=2] [L45] x++ VAL [counter=6, v=-169, x=6, X=197, x=10, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-169, x=10, x=6, X=197, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=-169, x=12, x=0, x=6, X=197, Y=2, 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=-169, X=197, x=6, x=12, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=7, v=-169, x=6, x=12, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=7, v=-165, x=0, x=6, x=12, X=197, y=0, Y=2] [L45] x++ VAL [counter=7, v=-165, x=0, x=12, x=7, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=-165, x=0, x=12, X=197, x=7, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=-165, x=14, X=197, x=0, x=7, Y=2, 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=-165, x=7, X=197, x=0, x=14, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=8, v=-165, X=197, x=14, x=0, x=7, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=8, v=-161, x=0, x=7, x=14, X=197, y=0, Y=2] [L45] x++ VAL [counter=8, v=-161, x=0, X=197, x=14, x=8, Y=2, y=0] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-161, X=197, x=0, x=8, x=14, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-161, x=0, X=197, x=16, x=8, y=0, Y=2] [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=-161, x=16, x=0, x=8, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=9, v=-161, x=16, x=0, x=8, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=9, v=-157, x=0, x=16, x=8, X=197, Y=2, y=0] [L45] x++ VAL [counter=9, v=-157, X=197, x=16, x=0, x=9, y=0, Y=2] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=-157, x=9, x=16, x=0, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=-157, X=197, x=0, x=9, x=18, Y=2, 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=-157, x=18, x=9, X=197, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=10, v=-157, x=9, x=0, x=18, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=10, v=-153, X=197, x=18, x=0, x=9, y=0, Y=2] [L45] x++ VAL [counter=10, v=-153, x=18, x=10, x=0, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=-153, x=10, x=0, X=197, x=18, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=-153, x=0, X=197, x=20, x=10, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=11, v=-153, x=0, X=197, x=10, x=20, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=11, v=-153, X=197, x=10, x=20, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=11, v=-149, x=20, x=10, x=0, X=197, Y=2, y=0] [L45] x++ VAL [counter=11, v=-149, x=20, X=197, x=0, x=11, y=0, Y=2] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=-149, x=0, x=20, X=197, x=11, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=-149, x=22, x=0, X=197, x=11, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=12, v=-149, x=22, X=197, x=0, x=11, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=12, v=-149, x=0, x=11, x=22, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=12, v=-145, X=197, x=0, x=11, x=22, Y=2, y=0] [L45] x++ VAL [counter=12, v=-145, x=22, x=0, x=12, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=-145, x=22, x=0, X=197, x=12, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=-145, X=197, x=24, x=12, x=0, Y=2, 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=-145, x=24, x=12, X=197, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=13, v=-145, x=24, X=197, x=0, x=12, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=13, v=-141, X=197, x=12, x=24, x=0, Y=2, y=0] [L45] x++ VAL [counter=13, v=-141, x=24, x=0, x=13, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=-141, x=0, x=24, X=197, x=13, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=-141, X=197, x=0, x=13, x=26, y=0, Y=2] [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=-141, x=0, x=26, X=197, x=13, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=14, v=-141, x=26, x=13, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=14, v=-137, x=0, x=26, x=13, X=197, y=0, Y=2] [L45] x++ VAL [counter=14, v=-137, x=0, x=14, X=197, x=26, y=0, Y=2] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=-137, x=14, X=197, x=26, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=-137, x=28, X=197, x=0, x=14, y=0, Y=2] [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=-137, x=28, x=14, X=197, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=15, v=-137, x=0, x=28, x=14, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=15, v=-133, x=28, X=197, x=0, x=14, Y=2, y=0] [L45] x++ VAL [counter=15, v=-133, x=0, X=197, x=15, x=28, Y=2, y=0] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=-133, x=0, x=28, x=15, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=-133, x=0, X=197, x=15, x=30, y=0, Y=2] [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=-133, x=30, x=0, x=15, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=16, v=-133, x=30, x=15, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=16, v=-129, x=30, x=15, x=0, X=197, Y=2, y=0] [L45] x++ VAL [counter=16, v=-129, x=30, x=16, x=0, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=-129, X=197, x=30, x=16, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=-129, x=0, x=16, X=197, x=32, Y=2, y=0] [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=-129, x=16, X=197, x=32, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=17, v=-129, x=0, x=16, X=197, x=32, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=17, v=-125, X=197, x=16, x=32, x=0, y=0, Y=2] [L45] x++ VAL [counter=17, v=-125, x=0, X=197, x=17, x=32, y=0, Y=2] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=-125, X=197, x=17, x=32, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=-125, x=34, x=17, X=197, x=0, y=0, Y=2] [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=-125, x=34, x=0, x=17, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=18, v=-125, x=17, X=197, x=34, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=18, v=-121, x=17, X=197, x=0, x=34, Y=2, y=0] [L45] x++ VAL [counter=18, v=-121, x=34, x=0, x=18, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=-121, x=34, X=197, x=18, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=-121, X=197, x=0, x=18, x=36, y=0, Y=2] [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=-121, X=197, x=0, x=18, x=36, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=19, v=-121, x=18, x=0, X=197, x=36, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=19, v=-117, x=0, X=197, x=18, x=36, y=0, Y=2] [L45] x++ VAL [counter=19, v=-117, X=197, x=0, x=19, x=36, y=0, Y=2] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=-117, x=36, x=0, x=19, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=-117, x=0, x=19, x=38, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=20, v=-117, x=0, x=38, x=19, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=20, v=-117, x=38, x=0, x=19, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=20, v=-113, x=38, X=197, x=0, x=19, Y=2, y=0] [L45] x++ VAL [counter=20, v=-113, x=38, X=197, x=20, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=-113, X=197, x=38, x=20, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=21, v=-113, x=20, X=197, x=0, x=40, Y=2, y=0] [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=-113, x=40, x=0, x=20, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=21, v=-113, x=20, X=197, x=0, x=40, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=21, v=-109, x=40, x=0, x=20, X=197, y=0, Y=2] [L45] x++ VAL [counter=21, v=-109, x=21, X=197, x=40, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=-109, X=197, x=0, x=40, x=21, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=22, v=-109, x=0, x=42, X=197, x=21, Y=2, 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=-109, x=0, x=21, X=197, x=42, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=22, v=-109, x=42, x=21, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=22, v=-105, x=0, x=21, X=197, x=42, Y=2, y=0] [L45] x++ VAL [counter=22, v=-105, x=22, X=197, x=42, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=23, counter++=22, v=-105, X=197, x=42, x=22, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=23, v=-105, x=44, x=0, x=22, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=23] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=23, v=-105, X=197, x=0, x=22, x=44, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=23, v=-105, x=0, x=44, X=197, x=22, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=23, v=-101, x=44, X=197, x=22, x=0, y=0, Y=2] [L45] x++ VAL [counter=23, v=-101, x=23, x=0, x=44, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=-101, x=0, x=44, X=197, x=23, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=24, v=-101, x=23, x=46, x=0, X=197, Y=2, 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=-101, x=0, x=23, x=46, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=24, v=-101, x=46, x=23, x=0, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=24, v=-97, x=46, x=0, x=23, X=197, Y=2, y=0] [L45] x++ VAL [counter=24, v=-97, x=46, x=24, x=0, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=-97, x=46, X=197, x=0, x=24, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=25, v=-97, x=0, X=197, x=24, x=48, Y=2, 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=-97, x=48, x=24, X=197, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=25, v=-97, X=197, x=0, x=48, x=24, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=25, v=-93, x=0, x=48, X=197, x=24, y=0, Y=2] [L45] x++ VAL [counter=25, v=-93, X=197, x=48, x=25, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=26, counter++=25, v=-93, X=197, x=0, x=48, x=25, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=26, v=-93, x=0, x=50, X=197, x=25, Y=2, y=0] [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=-93, X=197, x=50, x=25, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=26, v=-93, x=25, x=0, x=50, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=26, v=-89, X=197, x=0, x=50, x=25, y=0, Y=2] [L45] x++ VAL [counter=26, v=-89, x=0, x=26, X=197, x=50, Y=2, y=0] [L31] EXPR counter++ VAL [counter=27, counter++=26, v=-89, x=50, x=26, X=197, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=27, v=-89, x=0, x=26, x=52, X=197, Y=2, 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=-89, x=52, x=26, X=197, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=27, v=-89, X=197, x=0, x=52, x=26, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=27, v=-85, x=0, x=26, x=52, X=197, Y=2, y=0] [L45] x++ VAL [counter=27, v=-85, x=52, X=197, x=0, x=27, Y=2, y=0] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=-85, X=197, x=52, x=27, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=28, v=-85, X=197, x=27, x=0, x=54, Y=2, y=0] [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=-85, x=0, x=54, X=197, x=27, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=28, v=-85, X=197, x=27, x=0, x=54, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=28, v=-81, x=54, X=197, x=27, x=0, y=0, Y=2] [L45] x++ VAL [counter=28, v=-81, x=28, x=54, x=0, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=-81, x=54, x=0, x=28, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=29, v=-81, x=28, x=0, x=56, X=197, y=0, Y=2] [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=-81, x=0, x=28, X=197, x=56, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=29, v=-81, x=56, X=197, x=28, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=29, v=-77, x=28, X=197, x=0, x=56, Y=2, y=0] [L45] x++ VAL [counter=29, v=-77, x=56, x=0, X=197, x=29, Y=2, y=0] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=-77, x=0, X=197, x=29, x=56, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=30, v=-77, x=58, X=197, x=29, x=0, Y=2, y=0] [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=-77, X=197, x=0, x=29, x=58, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=30, v=-77, x=29, x=58, X=197, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=30, v=-73, X=197, x=58, x=0, x=29, y=0, Y=2] [L45] x++ VAL [counter=30, v=-73, X=197, x=58, x=30, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=-73, x=58, x=30, X=197, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=31, v=-73, x=0, x=60, x=30, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=31] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=31, v=-73, X=197, x=60, x=30, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=31, v=-73, x=60, x=30, X=197, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=31, v=-69, x=60, x=30, X=197, x=0, Y=2, y=0] [L45] x++ VAL [counter=31, v=-69, X=197, x=60, x=31, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=-69, x=60, x=0, X=197, x=31, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=32, v=-69, x=62, x=0, X=197, x=31, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=32] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=32, v=-69, x=0, X=197, x=62, x=31, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=32, v=-69, x=0, x=31, x=62, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=32, v=-65, x=62, X=197, x=31, x=0, y=0, Y=2] [L45] x++ VAL [counter=32, v=-65, x=32, x=62, x=0, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=-65, x=0, X=197, x=62, x=32, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=33, v=-65, X=197, x=32, x=64, x=0, Y=2, 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=-65, x=0, x=64, X=197, x=32, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=33, v=-65, x=32, x=64, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=33, v=-61, X=197, x=32, x=64, x=0, y=0, Y=2] [L45] x++ VAL [counter=33, v=-61, X=197, x=33, x=64, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=-61, x=33, x=0, X=197, x=64, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=34, v=-61, x=0, X=197, x=33, x=66, Y=2, y=0] [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=-61, x=66, x=0, X=197, x=33, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=34, v=-61, x=66, x=33, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=34, v=-57, x=66, x=33, X=197, x=0, Y=2, y=0] [L45] x++ VAL [counter=34, v=-57, x=34, x=66, X=197, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=-57, x=34, x=66, x=0, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=35, v=-57, x=34, X=197, x=68, x=0, y=0, Y=2] [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=-57, x=0, x=68, x=34, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=35, v=-57, X=197, x=0, x=68, x=34, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=35, v=-53, x=0, X=197, x=34, x=68, Y=2, y=0] [L45] x++ VAL [counter=35, v=-53, X=197, x=35, x=0, x=68, y=0, Y=2] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=-53, x=0, x=68, X=197, x=35, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=36, v=-53, X=197, x=0, x=70, x=35, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=36] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=36, v=-53, x=35, X=197, x=0, x=70, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=36, v=-53, x=35, x=70, X=197, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=36, v=-49, x=70, x=0, X=197, x=35, Y=2, y=0] [L45] x++ VAL [counter=36, v=-49, x=70, x=0, x=36, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=-49, x=70, x=36, x=0, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=37, v=-49, x=72, X=197, x=0, x=36, y=0, Y=2] [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=-49, X=197, x=36, x=0, x=72, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=37, v=-49, X=197, x=36, x=72, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=37, v=-45, x=72, X=197, x=36, x=0, Y=2, y=0] [L45] x++ VAL [counter=37, v=-45, X=197, x=0, x=37, x=72, y=0, Y=2] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=-45, x=72, x=0, X=197, x=37, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=38, v=-45, X=197, x=74, x=0, x=37, Y=2, 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=-45, x=0, x=37, x=74, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=38, v=-45, x=74, x=37, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=38, v=-41, X=197, x=0, x=37, x=74, y=0, Y=2] [L45] x++ VAL [counter=38, v=-41, X=197, x=0, x=74, x=38, Y=2, y=0] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=-41, x=38, x=0, x=74, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=39, v=-41, x=0, x=38, x=76, X=197, y=0, Y=2] [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=-41, x=0, x=38, x=76, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=39, v=-41, x=0, x=38, x=76, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=39, v=-37, x=38, X=197, x=76, x=0, Y=2, y=0] [L45] x++ VAL [counter=39, v=-37, x=39, x=76, x=0, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=-37, x=39, x=76, X=197, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=40, v=-37, x=39, x=0, x=78, X=197, Y=2, 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=-37, x=39, X=197, x=78, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=40, v=-37, x=78, x=0, x=39, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=40, v=-33, X=197, x=0, x=78, x=39, y=0, Y=2] [L45] x++ VAL [counter=40, v=-33, X=197, x=0, x=78, x=40, Y=2, y=0] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=-33, x=0, x=40, X=197, x=78, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=41, v=-33, x=0, x=80, x=40, X=197, Y=2, 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=-33, x=40, X=197, x=0, x=80, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=41, v=-33, X=197, x=80, x=40, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=41, v=-29, x=0, x=40, X=197, x=80, y=0, Y=2] [L45] x++ VAL [counter=41, v=-29, X=197, x=80, x=41, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=-29, x=0, x=80, X=197, x=41, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=42, v=-29, x=41, x=0, X=197, x=82, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=42] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=42, v=-29, x=82, x=0, x=41, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=42, v=-29, x=41, x=82, x=0, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=42, v=-25, x=41, X=197, x=82, x=0, y=0, Y=2] [L45] x++ VAL [counter=42, v=-25, x=42, x=0, X=197, x=82, y=0, Y=2] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=-25, x=42, x=0, x=82, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=43, v=-25, x=84, X=197, x=0, x=42, y=0, Y=2] [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=-25, X=197, x=0, x=84, x=42, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=43, v=-25, x=84, x=0, X=197, x=42, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=43, v=-21, x=84, X=197, x=42, x=0, y=0, Y=2] [L45] x++ VAL [counter=43, v=-21, X=197, x=84, x=0, x=43, Y=2, y=0] [L31] EXPR counter++ VAL [counter=44, counter++=43, v=-21, x=43, X=197, x=0, x=84, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=44, v=-21, x=0, x=43, X=197, x=86, Y=2, 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=-21, X=197, x=43, x=86, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=44, v=-21, x=43, x=0, X=197, x=86, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=44, v=-17, X=197, x=43, x=0, x=86, y=0, Y=2] [L45] x++ VAL [counter=44, v=-17, X=197, x=44, x=86, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=-17, x=44, X=197, x=86, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=45, v=-17, X=197, x=0, x=88, x=44, Y=2, 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=-17, x=44, x=0, X=197, x=88, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=45, v=-17, x=44, X=197, x=88, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=45, v=-13, X=197, x=0, x=88, x=44, Y=2, y=0] [L45] x++ VAL [counter=45, v=-13, x=88, x=0, x=45, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=46, counter++=45, v=-13, x=0, x=45, x=88, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=46, v=-13, X=197, x=90, x=0, x=45, Y=2, y=0] [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=-13, x=90, x=0, x=45, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=46, v=-13, X=197, x=45, x=0, x=90, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=46, v=-9, x=45, x=0, x=90, X=197, Y=2, y=0] [L45] x++ VAL [counter=46, v=-9, x=46, x=0, x=90, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=-9, X=197, x=0, x=46, x=90, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=47, v=-9, X=197, x=0, x=46, x=92, y=0, Y=2] [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=-9, x=92, x=46, x=0, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=47, v=-9, x=92, x=0, X=197, x=46, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=47, v=-5, X=197, x=46, x=0, x=92, Y=2, y=0] [L45] x++ VAL [counter=47, v=-5, x=92, X=197, x=47, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=-5, x=47, X=197, x=0, x=92, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=48, v=-5, X=197, x=94, x=0, x=47, Y=2, 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=-5, x=0, X=197, x=47, x=94, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=48, v=-5, x=0, x=94, x=47, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=48, v=-1, x=0, x=94, x=47, X=197, y=0, Y=2] [L45] x++ VAL [counter=48, v=-1, x=94, x=0, x=48, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=-1, x=0, X=197, x=94, x=48, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=49, v=-1, x=96, X=197, x=48, x=0, y=0, Y=2] [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=-1, x=0, x=96, x=48, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=49, v=-1, x=0, X=197, x=96, x=48, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=49, v=3, x=48, x=96, x=0, X=197, y=0, Y=2] [L45] x++ VAL [counter=49, v=3, x=0, x=49, X=197, x=96, y=0, Y=2] [L31] EXPR counter++ VAL [counter=50, counter++=49, v=3, x=0, x=96, x=49, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=50, v=3, x=49, x=98, x=0, X=197, Y=2, y=0] [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=3, x=0, x=49, X=197, x=98, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=50, v=3, x=98, X=197, x=0, x=49, y=0, Y=2] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=50, v=-387, x=0, X=197, x=49, x=98, Y=2, y=1] [L45] x++ VAL [counter=50, v=-387, x=0, x=98, x=50, X=197, y=1, Y=2] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=-387, x=98, x=0, x=50, X=197, Y=2, y=1] [L31] COND FALSE !(counter++<50) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=51, v=-387, x=50, x=50, x=100, X=197, Y=2, y=1] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=51] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L16] reach_error() VAL [\old(cond)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 94.3s, OverallIterations: 14, TraceHistogramMax: 51, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 50.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16 mSolverCounterUnknown, 1834 SdHoareTripleChecker+Valid, 34.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1829 mSDsluCounter, 2150 SdHoareTripleChecker+Invalid, 33.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 91 IncrementalHoareTripleChecker+Unchecked, 1832 mSDsCounter, 518 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1986 IncrementalHoareTripleChecker+Invalid, 2611 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 518 mSolverCounterUnsat, 318 mSDtfsCounter, 1986 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2565 GetRequests, 2142 SyntacticMatches, 10 SemanticMatches, 413 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3500 ImplicationChecksByTransitivity, 36.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1000occurred in iteration=13, InterpolantAutomatonStates: 378, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 94 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 37.6s InterpolantComputationTime, 1824 NumberOfCodeBlocks, 1594 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 2369 ConstructedInterpolants, 4 QuantifiedInterpolants, 8004 SizeOfPredicates, 126 NumberOfNonLiveVariables, 3053 ConjunctsInSsa, 316 ConjunctsInUnsatCore, 24 InterpolantComputations, 1 PerfectInterpolantSequences, 8301/29812 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! [2022-07-19 15:33:11,339 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