./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound2.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 72cd0a4215707a62376e213156123902caf611a87605e41064b672632b6ef1f9 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 01:27:13,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 01:27:13,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 01:27:13,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 01:27:13,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 01:27:13,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 01:27:13,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 01:27:13,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 01:27:13,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 01:27:13,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 01:27:13,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 01:27:13,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 01:27:13,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 01:27:13,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 01:27:13,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 01:27:13,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 01:27:13,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 01:27:13,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 01:27:13,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 01:27:13,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 01:27:13,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 01:27:13,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 01:27:13,425 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 01:27:13,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 01:27:13,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 01:27:13,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 01:27:13,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 01:27:13,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 01:27:13,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 01:27:13,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 01:27:13,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 01:27:13,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 01:27:13,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 01:27:13,436 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 01:27:13,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 01:27:13,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 01:27:13,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 01:27:13,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 01:27:13,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 01:27:13,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 01:27:13,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 01:27:13,442 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 01:27:13,468 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 01:27:13,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 01:27:13,468 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 01:27:13,469 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 01:27:13,469 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 01:27:13,469 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 01:27:13,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 01:27:13,470 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 01:27:13,470 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 01:27:13,470 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 01:27:13,471 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 01:27:13,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 01:27:13,471 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 01:27:13,471 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 01:27:13,471 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 01:27:13,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 01:27:13,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 01:27:13,471 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 01:27:13,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 01:27:13,471 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 01:27:13,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 01:27:13,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 01:27:13,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 01:27:13,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 01:27:13,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 01:27:13,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 01:27:13,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 01:27:13,472 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 01:27:13,472 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 01:27:13,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 01:27:13,473 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 01:27:13,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 01:27:13,473 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 01:27:13,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 01:27:13,473 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 01:27:13,473 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 72cd0a4215707a62376e213156123902caf611a87605e41064b672632b6ef1f9 [2023-02-17 01:27:13,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 01:27:13,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 01:27:13,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 01:27:13,687 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 01:27:13,687 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 01:27:13,688 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound2.c [2023-02-17 01:27:14,671 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 01:27:14,809 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 01:27:14,810 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound2.c [2023-02-17 01:27:14,815 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b08e39b0/4eb4c10325aa4ad8bf31d43b8cc20085/FLAG3fed60bd5 [2023-02-17 01:27:14,830 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b08e39b0/4eb4c10325aa4ad8bf31d43b8cc20085 [2023-02-17 01:27:14,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 01:27:14,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 01:27:14,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 01:27:14,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 01:27:14,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 01:27:14,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 01:27:14" (1/1) ... [2023-02-17 01:27:14,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47745850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:14, skipping insertion in model container [2023-02-17 01:27:14,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 01:27:14" (1/1) ... [2023-02-17 01:27:14,843 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 01:27:14,858 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 01:27:14,953 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound2.c[597,610] [2023-02-17 01:27:14,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 01:27:14,968 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 01:27:14,974 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound2.c[597,610] [2023-02-17 01:27:14,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 01:27:14,986 INFO L208 MainTranslator]: Completed translation [2023-02-17 01:27:14,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:14 WrapperNode [2023-02-17 01:27:14,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 01:27:14,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 01:27:14,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 01:27:14,988 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 01:27:14,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:14" (1/1) ... [2023-02-17 01:27:14,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:14" (1/1) ... [2023-02-17 01:27:15,006 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2023-02-17 01:27:15,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 01:27:15,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 01:27:15,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 01:27:15,007 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 01:27:15,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:14" (1/1) ... [2023-02-17 01:27:15,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:14" (1/1) ... [2023-02-17 01:27:15,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:14" (1/1) ... [2023-02-17 01:27:15,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:14" (1/1) ... [2023-02-17 01:27:15,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:14" (1/1) ... [2023-02-17 01:27:15,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:14" (1/1) ... [2023-02-17 01:27:15,018 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:14" (1/1) ... [2023-02-17 01:27:15,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:14" (1/1) ... [2023-02-17 01:27:15,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 01:27:15,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 01:27:15,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 01:27:15,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 01:27:15,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:14" (1/1) ... [2023-02-17 01:27:15,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 01:27:15,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:27:15,059 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 01:27:15,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 01:27:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 01:27:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-17 01:27:15,093 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-17 01:27:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 01:27:15,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 01:27:15,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 01:27:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 01:27:15,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 01:27:15,150 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 01:27:15,153 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 01:27:15,271 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 01:27:15,275 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 01:27:15,275 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 01:27:15,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:27:15 BoogieIcfgContainer [2023-02-17 01:27:15,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 01:27:15,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 01:27:15,286 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 01:27:15,293 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 01:27:15,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 01:27:14" (1/3) ... [2023-02-17 01:27:15,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6adf4bca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 01:27:15, skipping insertion in model container [2023-02-17 01:27:15,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:14" (2/3) ... [2023-02-17 01:27:15,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6adf4bca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 01:27:15, skipping insertion in model container [2023-02-17 01:27:15,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:27:15" (3/3) ... [2023-02-17 01:27:15,295 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_valuebound2.c [2023-02-17 01:27:15,306 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 01:27:15,306 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 01:27:15,361 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 01:27:15,366 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6ee1621f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 01:27:15,366 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 01:27:15,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 01:27:15,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 01:27:15,374 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:27:15,375 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:27:15,375 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:27:15,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:27:15,379 INFO L85 PathProgramCache]: Analyzing trace with hash 689891435, now seen corresponding path program 1 times [2023-02-17 01:27:15,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:27:15,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923213170] [2023-02-17 01:27:15,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:15,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:27:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:27:15,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:27:15,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923213170] [2023-02-17 01:27:15,496 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 01:27:15,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485736373] [2023-02-17 01:27:15,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:15,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:27:15,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:27:15,516 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:27:15,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 01:27:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:27:15,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 01:27:15,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:27:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 01:27:15,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 01:27:15,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485736373] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:27:15,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:27:15,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 01:27:15,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253452702] [2023-02-17 01:27:15,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:27:15,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 01:27:15,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:27:15,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 01:27:15,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 01:27:15,634 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:27:15,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:27:15,663 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2023-02-17 01:27:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 01:27:15,664 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-02-17 01:27:15,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:27:15,693 INFO L225 Difference]: With dead ends: 51 [2023-02-17 01:27:15,694 INFO L226 Difference]: Without dead ends: 23 [2023-02-17 01:27:15,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 01:27:15,698 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 01:27:15,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 01:27:15,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-17 01:27:15,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-17 01:27:15,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 01:27:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-02-17 01:27:15,737 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 19 [2023-02-17 01:27:15,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:27:15,738 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-02-17 01:27:15,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:27:15,739 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-02-17 01:27:15,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 01:27:15,740 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:27:15,740 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:27:15,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 01:27:15,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-17 01:27:15,956 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:27:15,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:27:15,957 INFO L85 PathProgramCache]: Analyzing trace with hash 90086127, now seen corresponding path program 1 times [2023-02-17 01:27:15,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:27:15,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804578725] [2023-02-17 01:27:15,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:15,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:27:15,976 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:27:15,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [940975850] [2023-02-17 01:27:15,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:15,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:27:15,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:27:15,981 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:27:15,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 01:27:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:27:16,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 01:27:16,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:27:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 01:27:16,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 01:27:16,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:27:16,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804578725] [2023-02-17 01:27:16,074 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:27:16,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940975850] [2023-02-17 01:27:16,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940975850] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:27:16,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:27:16,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 01:27:16,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272950500] [2023-02-17 01:27:16,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:27:16,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 01:27:16,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:27:16,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 01:27:16,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 01:27:16,077 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 01:27:16,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:27:16,159 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2023-02-17 01:27:16,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 01:27:16,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-02-17 01:27:16,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:27:16,161 INFO L225 Difference]: With dead ends: 35 [2023-02-17 01:27:16,162 INFO L226 Difference]: Without dead ends: 31 [2023-02-17 01:27:16,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-17 01:27:16,164 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:27:16,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 71 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:27:16,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-17 01:27:16,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2023-02-17 01:27:16,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 01:27:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-02-17 01:27:16,171 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 19 [2023-02-17 01:27:16,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:27:16,172 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-02-17 01:27:16,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 01:27:16,173 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-02-17 01:27:16,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-17 01:27:16,173 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:27:16,173 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:27:16,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 01:27:16,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-17 01:27:16,378 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:27:16,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:27:16,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1522625704, now seen corresponding path program 1 times [2023-02-17 01:27:16,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:27:16,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483986439] [2023-02-17 01:27:16,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:16,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:27:16,388 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:27:16,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1314645209] [2023-02-17 01:27:16,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:16,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:27:16,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:27:16,397 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:27:16,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 01:27:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:27:16,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-17 01:27:16,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:27:16,666 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 01:27:16,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:27:16,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:27:16,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483986439] [2023-02-17 01:27:16,840 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:27:16,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314645209] [2023-02-17 01:27:16,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314645209] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 01:27:16,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:27:16,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2023-02-17 01:27:16,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925766555] [2023-02-17 01:27:16,841 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 01:27:16,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 01:27:16,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:27:16,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 01:27:16,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2023-02-17 01:27:16,845 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 01:27:17,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:27:17,027 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2023-02-17 01:27:17,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 01:27:17,027 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2023-02-17 01:27:17,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:27:17,028 INFO L225 Difference]: With dead ends: 57 [2023-02-17 01:27:17,028 INFO L226 Difference]: Without dead ends: 31 [2023-02-17 01:27:17,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2023-02-17 01:27:17,032 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:27:17,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 107 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:27:17,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-17 01:27:17,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-02-17 01:27:17,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 01:27:17,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2023-02-17 01:27:17,044 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 28 [2023-02-17 01:27:17,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:27:17,045 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2023-02-17 01:27:17,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 01:27:17,045 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2023-02-17 01:27:17,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-17 01:27:17,046 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:27:17,046 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:27:17,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-17 01:27:17,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:27:17,251 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:27:17,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:27:17,252 INFO L85 PathProgramCache]: Analyzing trace with hash 252381658, now seen corresponding path program 1 times [2023-02-17 01:27:17,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:27:17,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751947651] [2023-02-17 01:27:17,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:17,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:27:17,261 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:27:17,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1927073134] [2023-02-17 01:27:17,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:17,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:27:17,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:27:17,262 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:27:17,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 01:27:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:27:17,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-17 01:27:17,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:27:17,386 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 01:27:17,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:27:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 01:27:17,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:27:17,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751947651] [2023-02-17 01:27:17,567 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:27:17,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927073134] [2023-02-17 01:27:17,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927073134] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:27:17,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:27:17,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2023-02-17 01:27:17,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995438001] [2023-02-17 01:27:17,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:27:17,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-17 01:27:17,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:27:17,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-17 01:27:17,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2023-02-17 01:27:17,569 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-17 01:27:17,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:27:17,819 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2023-02-17 01:27:17,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-17 01:27:17,820 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 28 [2023-02-17 01:27:17,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:27:17,820 INFO L225 Difference]: With dead ends: 44 [2023-02-17 01:27:17,820 INFO L226 Difference]: Without dead ends: 40 [2023-02-17 01:27:17,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2023-02-17 01:27:17,821 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 01:27:17,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 95 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 01:27:17,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-17 01:27:17,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2023-02-17 01:27:17,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 01:27:17,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2023-02-17 01:27:17,827 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 28 [2023-02-17 01:27:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:27:17,827 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2023-02-17 01:27:17,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-17 01:27:17,828 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2023-02-17 01:27:17,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-17 01:27:17,828 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:27:17,828 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:27:17,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 01:27:18,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:27:18,033 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:27:18,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:27:18,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1035193378, now seen corresponding path program 1 times [2023-02-17 01:27:18,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:27:18,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289645729] [2023-02-17 01:27:18,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:18,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:27:18,042 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:27:18,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [213212114] [2023-02-17 01:27:18,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:18,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:27:18,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:27:18,045 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:27:18,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 01:27:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:27:18,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-17 01:27:18,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:27:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 01:27:18,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:27:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-17 01:27:18,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:27:18,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289645729] [2023-02-17 01:27:18,395 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:27:18,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213212114] [2023-02-17 01:27:18,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213212114] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:27:18,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:27:18,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2023-02-17 01:27:18,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51600538] [2023-02-17 01:27:18,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:27:18,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-17 01:27:18,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:27:18,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-17 01:27:18,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2023-02-17 01:27:18,398 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 25 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 states have internal predecessors, (39), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-17 01:27:18,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:27:18,956 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2023-02-17 01:27:18,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-17 01:27:18,957 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 states have internal predecessors, (39), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 35 [2023-02-17 01:27:18,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:27:18,957 INFO L225 Difference]: With dead ends: 41 [2023-02-17 01:27:18,957 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 01:27:18,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=268, Invalid=1372, Unknown=0, NotChecked=0, Total=1640 [2023-02-17 01:27:18,958 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 50 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 01:27:18,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 101 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 01:27:18,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 01:27:18,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 01:27:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 01:27:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 01:27:18,959 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2023-02-17 01:27:18,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:27:18,959 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 01:27:18,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 states have internal predecessors, (39), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-17 01:27:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 01:27:18,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 01:27:18,961 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 01:27:18,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 01:27:19,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:27:19,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 01:27:19,176 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 01:27:19,176 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (>= |ULTIMATE.start_main_~X~0#1| 0) (<= |ULTIMATE.start_main_~X~0#1| 2)) [2023-02-17 01:27:19,176 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2023-02-17 01:27:19,176 INFO L902 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2023-02-17 01:27:19,176 INFO L899 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2023-02-17 01:27:19,177 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse22 (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse18 (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2)) (.cse11 (- (* .cse22 2))) (.cse9 (- |ULTIMATE.start_main_~v~0#1|)) (.cse12 (- |ULTIMATE.start_main_~X~0#1|)) (.cse3 (* 2 |ULTIMATE.start_main_~Y~0#1|))) (let ((.cse2 (+ .cse12 .cse3)) (.cse13 (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0)) (.cse0 (>= |ULTIMATE.start_main_~X~0#1| 0)) (.cse1 (<= |ULTIMATE.start_main_~X~0#1| 2)) (.cse14 (= (+ (+ (+ (+ .cse18 .cse11) .cse12) .cse3) .cse9) 0)) (.cse5 (<= |ULTIMATE.start_main_~Y~0#1| 2)) (.cse6 (>= |ULTIMATE.start_main_~Y~0#1| 0))) (let ((.cse16 (or (let ((.cse23 (+ (- 1) |ULTIMATE.start_main_~x~0#1|)) (.cse24 (+ (* (- 2) |ULTIMATE.start_main_~Y~0#1|) |ULTIMATE.start_main_~v~0#1| (* 2 |ULTIMATE.start_main_~X~0#1|)))) (and (<= .cse23 |ULTIMATE.start_main_~X~0#1|) .cse0 .cse1 (= .cse23 0) (= .cse2 .cse24) .cse13 (not (< .cse24 0)) .cse5 .cse6)) (and .cse0 .cse1 .cse14 .cse5 .cse6))) (.cse15 (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|)) (.cse4 (= |ULTIMATE.start_main_~y~0#1| 0)) (.cse7 (= |ULTIMATE.start_main_~xy~0#1| (* |ULTIMATE.start_main_~X~0#1| 0)))) (or (and .cse0 .cse1 (= (+ .cse2 .cse3) |ULTIMATE.start_main_~v~0#1|) .cse4 (exists ((|ULTIMATE.start_main_~x~0#1| Int)) (= (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~yx~0#1|)) (< .cse2 0) .cse5 .cse6 .cse7) (let ((.cse8 (+ 0 1))) (let ((.cse10 (* |ULTIMATE.start_main_~Y~0#1| .cse8))) (and (not (<= .cse8 |ULTIMATE.start_main_~X~0#1|)) .cse0 .cse1 (= |ULTIMATE.start_main_~x~0#1| .cse8) (= (+ .cse9 (+ .cse3 (+ (+ (* 2 .cse10) .cse11) .cse12))) 0) (= |ULTIMATE.start_main_~xy~0#1| (* |ULTIMATE.start_main_~y~0#1| .cse8)) (= |ULTIMATE.start_main_~yx~0#1| .cse10) .cse13 .cse14 (not .cse15) .cse16))) (let ((.cse17 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse19 (- (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))))) (and .cse0 .cse1 (= (+ .cse17 (+ .cse9 (+ (+ .cse12 (+ (* 2 |ULTIMATE.start_main_~yx~0#1|) (- (* 2 |ULTIMATE.start_main_~xy~0#1|)))) .cse3))) 0) .cse16 (= (+ .cse17 (+ (+ (+ .cse12 (+ .cse18 .cse19)) .cse3) .cse9)) 0) (or .cse15 (forall ((|ULTIMATE.start_main_~Y~0#1| Int)) (= (+ .cse17 (let ((.cse21 (* 2 |ULTIMATE.start_main_~Y~0#1|)) (.cse20 (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2))) (+ (+ (+ .cse12 (+ .cse20 .cse19)) .cse21) (+ (- (* (- 1) |ULTIMATE.start_main_~X~0#1|)) (- (* (- 2) .cse22)) (- .cse21) (- .cse20))))) 0))))) (and (= |ULTIMATE.start_main_~v~0#1| .cse2) .cse4 (= |ULTIMATE.start_main_~yx~0#1| (* |ULTIMATE.start_main_~Y~0#1| 0)) (= |ULTIMATE.start_main_~x~0#1| 0) .cse7)))))) [2023-02-17 01:27:19,177 INFO L899 garLoopResultBuilder]: For program point L50-1(line 50) no Hoare annotation was computed. [2023-02-17 01:27:19,177 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 01:27:19,178 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 21 53) the Hoare annotation is: true [2023-02-17 01:27:19,178 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 45) no Hoare annotation was computed. [2023-02-17 01:27:19,178 INFO L899 garLoopResultBuilder]: For program point L40-2(lines 40 45) no Hoare annotation was computed. [2023-02-17 01:27:19,178 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 01:27:19,178 INFO L895 garLoopResultBuilder]: At program point L32-2(lines 32 47) the Hoare annotation is: (let ((.cse9 (- |ULTIMATE.start_main_~X~0#1|)) (.cse12 (* 2 |ULTIMATE.start_main_~Y~0#1|))) (let ((.cse7 (+ .cse9 .cse12)) (.cse18 (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0)) (.cse0 (>= |ULTIMATE.start_main_~X~0#1| 0)) (.cse1 (<= |ULTIMATE.start_main_~X~0#1| 2)) (.cse10 (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2)) (.cse17 (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse13 (- |ULTIMATE.start_main_~v~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~Y~0#1| 2)) (.cse6 (>= |ULTIMATE.start_main_~Y~0#1| 0))) (let ((.cse8 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse11 (- (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)))) (.cse14 (or (let ((.cse19 (+ (- 1) |ULTIMATE.start_main_~x~0#1|)) (.cse20 (+ (* (- 2) |ULTIMATE.start_main_~Y~0#1|) |ULTIMATE.start_main_~v~0#1| (* 2 |ULTIMATE.start_main_~X~0#1|)))) (and (<= .cse19 |ULTIMATE.start_main_~X~0#1|) .cse0 .cse1 (= .cse19 0) (= .cse7 .cse20) .cse18 (not (< .cse20 0)) .cse5 .cse6)) (and .cse0 .cse1 (= (+ (+ (+ (+ .cse10 (- (* .cse17 2))) .cse9) .cse12) .cse13) 0) .cse5 .cse6))) (.cse2 (= (+ .cse7 .cse12) |ULTIMATE.start_main_~v~0#1|)) (.cse3 (= |ULTIMATE.start_main_~y~0#1| 0)) (.cse4 (< .cse7 0))) (or (and .cse0 .cse1 .cse2 .cse3 (exists ((|ULTIMATE.start_main_~x~0#1| Int)) (= (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~yx~0#1|)) .cse4 .cse5 .cse6 (= |ULTIMATE.start_main_~xy~0#1| (* |ULTIMATE.start_main_~X~0#1| 0))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~v~0#1| .cse7) .cse3 .cse5 (= |ULTIMATE.start_main_~x~0#1| 0) (= (+ .cse8 (+ (+ (+ .cse9 (+ .cse10 .cse11)) .cse12) .cse13)) 0) .cse6) (and .cse0 .cse1 .cse14 (or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (forall ((|ULTIMATE.start_main_~Y~0#1| Int)) (= (+ .cse8 (let ((.cse16 (* 2 |ULTIMATE.start_main_~Y~0#1|)) (.cse15 (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2))) (+ (+ (+ .cse9 (+ .cse15 .cse11)) .cse16) (+ (- (* (- 1) |ULTIMATE.start_main_~X~0#1|)) (- (* (- 2) .cse17)) (- .cse16) (- .cse15))))) 0)))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~x~0#1| (+ 0 1)) .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))))) [2023-02-17 01:27:19,178 INFO L899 garLoopResultBuilder]: For program point L32-3(lines 32 47) no Hoare annotation was computed. [2023-02-17 01:27:19,179 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 01:27:19,179 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse23 (- |ULTIMATE.start_main_~v~0#1|)) (.cse17 (- |ULTIMATE.start_main_~X~0#1|)) (.cse15 (* 2 |ULTIMATE.start_main_~yx~0#1|)) (.cse3 (* 2 |ULTIMATE.start_main_~Y~0#1|))) (let ((.cse11 (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse22 (+ .cse23 (+ (+ .cse17 (+ .cse15 (- (* 2 |ULTIMATE.start_main_~xy~0#1|)))) .cse3)))) (let ((.cse19 (- (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)))) (.cse21 (= .cse22 0)) (.cse24 (* .cse11 2)) (.cse8 (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse0 (>= |ULTIMATE.start_main_~X~0#1| 0)) (.cse1 (<= |ULTIMATE.start_main_~X~0#1| 2)) (.cse2 (+ .cse17 .cse3)) (.cse10 (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0)) (.cse5 (<= |ULTIMATE.start_main_~Y~0#1| 2)) (.cse6 (>= |ULTIMATE.start_main_~Y~0#1| 0))) (let ((.cse9 (or (and .cse0 .cse1 .cse21 (= (+ (+ (+ (+ .cse24 (- (* .cse8 2))) .cse17) .cse3) .cse23) 0) .cse5 .cse6) (let ((.cse25 (+ (- 1) |ULTIMATE.start_main_~x~0#1|)) (.cse26 (+ (* (- 2) |ULTIMATE.start_main_~Y~0#1|) |ULTIMATE.start_main_~v~0#1| (* 2 |ULTIMATE.start_main_~X~0#1|)))) (and (= (* |ULTIMATE.start_main_~Y~0#1| 1) |ULTIMATE.start_main_~yx~0#1|) (<= .cse25 |ULTIMATE.start_main_~X~0#1|) .cse0 (<= (+ (- 1) 1) |ULTIMATE.start_main_~X~0#1|) .cse1 (= .cse25 0) (= .cse2 .cse26) .cse10 (= |ULTIMATE.start_main_~xy~0#1| (* |ULTIMATE.start_main_~X~0#1| 1)) (not (< .cse26 0)) .cse5 .cse6)))) (.cse4 (= |ULTIMATE.start_main_~y~0#1| 0)) (.cse13 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse16 (+ (+ .cse17 (+ .cse24 .cse19)) .cse3)) (.cse7 (= |ULTIMATE.start_main_~xy~0#1| (* |ULTIMATE.start_main_~X~0#1| 0)))) (or (and .cse0 .cse1 (= (+ .cse2 .cse3) |ULTIMATE.start_main_~v~0#1|) .cse4 (exists ((|ULTIMATE.start_main_~x~0#1| Int)) (= (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~yx~0#1|)) (< .cse2 0) .cse5 .cse6 .cse7) (and (= .cse8 |ULTIMATE.start_main_~xy~0#1|) .cse0 .cse9 .cse1 (= |ULTIMATE.start_main_~x~0#1| (+ 0 1)) .cse10 (= .cse11 |ULTIMATE.start_main_~yx~0#1|)) (let ((.cse12 (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|)) (.cse14 (- (* (- 1) |ULTIMATE.start_main_~X~0#1|)))) (and (or .cse12 (= (+ .cse13 (+ (+ (- (* (- 2) |ULTIMATE.start_main_~xy~0#1|)) .cse14 (- .cse3) (- .cse15)) .cse16)) 0)) .cse0 .cse9 .cse1 (or .cse12 (forall ((|ULTIMATE.start_main_~Y~0#1| Int)) (= (+ .cse13 (let ((.cse20 (* 2 |ULTIMATE.start_main_~Y~0#1|)) (.cse18 (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2))) (+ (+ (+ .cse17 (+ .cse18 .cse19)) .cse20) (+ .cse14 (- (* (- 2) .cse8)) (- .cse20) (- .cse18))))) 0))))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~v~0#1| .cse2) .cse21 .cse4 (= |ULTIMATE.start_main_~yx~0#1| (* |ULTIMATE.start_main_~Y~0#1| 0)) .cse5 (= (+ .cse13 .cse22) 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= (+ .cse13 (+ .cse16 .cse23)) 0) .cse6 .cse7)))))) [2023-02-17 01:27:19,179 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 32 47) no Hoare annotation was computed. [2023-02-17 01:27:19,179 INFO L899 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2023-02-17 01:27:19,179 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 10 12) the Hoare annotation is: true [2023-02-17 01:27:19,179 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 12) no Hoare annotation was computed. [2023-02-17 01:27:19,180 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 10 12) no Hoare annotation was computed. [2023-02-17 01:27:19,180 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 16) no Hoare annotation was computed. [2023-02-17 01:27:19,180 INFO L899 garLoopResultBuilder]: For program point L14(lines 14 17) no Hoare annotation was computed. [2023-02-17 01:27:19,180 INFO L899 garLoopResultBuilder]: For program point L14-2(lines 13 19) no Hoare annotation was computed. [2023-02-17 01:27:19,180 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 13 19) no Hoare annotation was computed. [2023-02-17 01:27:19,180 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 13 19) the Hoare annotation is: true [2023-02-17 01:27:19,180 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2023-02-17 01:27:19,182 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-02-17 01:27:19,184 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 01:27:19,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-17 01:27:19,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] [2023-02-17 01:27:19,190 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] [2023-02-17 01:27:19,190 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] [2023-02-17 01:27:19,190 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] [2023-02-17 01:27:19,196 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-17 01:27:19,196 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] [2023-02-17 01:27:19,196 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] [2023-02-17 01:27:19,196 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] [2023-02-17 01:27:19,197 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] [2023-02-17 01:27:19,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 01:27:19 BoogieIcfgContainer [2023-02-17 01:27:19,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 01:27:19,199 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 01:27:19,199 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 01:27:19,199 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 01:27:19,199 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:27:15" (3/4) ... [2023-02-17 01:27:19,201 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 01:27:19,205 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-17 01:27:19,206 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-17 01:27:19,208 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-17 01:27:19,208 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 01:27:19,208 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 01:27:19,208 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 01:27:19,223 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((X >= 0 && X <= 2) && -X + 2 * Y + 2 * Y == v) && y == 0) && (\exists ULTIMATE.start_main_~x~0#1 : int :: Y * ULTIMATE.start_main_~x~0#1 == yx)) && -X + 2 * Y < 0) && Y <= 2) && Y >= 0) && xy == X * 0) || (((((((X >= 0 && X <= 2) && v == -X + 2 * Y) && y == 0) && Y <= 2) && x == 0) && 2 * y + (-X + (Y * x * 2 + -(2 * (x * y))) + 2 * Y + -v) == 0) && Y >= 0)) || (((X >= 0 && X <= 2) && (((((((((-1 + x <= X && X >= 0) && X <= 2) && -1 + x == 0) && -X + 2 * Y == -2 * Y + v + 2 * X) && -1 + y == 0) && !(-2 * Y + v + 2 * X < 0)) && Y <= 2) && Y >= 0) || ((((X >= 0 && X <= 2) && Y * x * 2 + -(X * y * 2) + -X + 2 * Y + -v == 0) && Y <= 2) && Y >= 0))) && (x <= X || (forall ULTIMATE.start_main_~Y~0#1 : int :: 2 * y + (-X + (ULTIMATE.start_main_~Y~0#1 * x * 2 + -(2 * (x * y))) + 2 * ULTIMATE.start_main_~Y~0#1 + (-(-1 * X) + -(-2 * (X * y)) + -(2 * ULTIMATE.start_main_~Y~0#1) + -(ULTIMATE.start_main_~Y~0#1 * x * 2))) == 0)))) || ((((X >= 0 && X <= 2) && x == 0 + 1) && -1 + y == 0) && (((((((((-1 + x <= X && X >= 0) && X <= 2) && -1 + x == 0) && -X + 2 * Y == -2 * Y + v + 2 * X) && -1 + y == 0) && !(-2 * Y + v + 2 * X < 0)) && Y <= 2) && Y >= 0) || ((((X >= 0 && X <= 2) && Y * x * 2 + -(X * y * 2) + -X + 2 * Y + -v == 0) && Y <= 2) && Y >= 0)))) || ((((((X >= 0 && X <= 2) && -X + 2 * Y + 2 * Y == v) && y == 0) && -X + 2 * Y < 0) && Y <= 2) && Y >= 0) [2023-02-17 01:27:19,227 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 01:27:19,228 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 01:27:19,228 INFO L158 Benchmark]: Toolchain (without parser) took 4395.05ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 67.3MB in the beginning and 97.5MB in the end (delta: -30.2MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2023-02-17 01:27:19,228 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 107.0MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:27:19,228 INFO L158 Benchmark]: CACSL2BoogieTranslator took 152.12ms. Allocated memory is still 107.0MB. Free memory was 66.9MB in the beginning and 56.6MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 01:27:19,229 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.00ms. Allocated memory is still 107.0MB. Free memory was 56.6MB in the beginning and 55.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 01:27:19,229 INFO L158 Benchmark]: Boogie Preprocessor took 12.66ms. Allocated memory is still 107.0MB. Free memory was 55.1MB in the beginning and 54.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:27:19,229 INFO L158 Benchmark]: RCFGBuilder took 256.71ms. Allocated memory is still 107.0MB. Free memory was 53.7MB in the beginning and 43.6MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 01:27:19,229 INFO L158 Benchmark]: TraceAbstraction took 3919.79ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 43.2MB in the beginning and 99.6MB in the end (delta: -56.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:27:19,230 INFO L158 Benchmark]: Witness Printer took 28.83ms. Allocated memory is still 157.3MB. Free memory was 99.6MB in the beginning and 97.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 01:27:19,231 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.09ms. Allocated memory is still 107.0MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 152.12ms. Allocated memory is still 107.0MB. Free memory was 66.9MB in the beginning and 56.6MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.00ms. Allocated memory is still 107.0MB. Free memory was 56.6MB in the beginning and 55.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.66ms. Allocated memory is still 107.0MB. Free memory was 55.1MB in the beginning and 54.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 256.71ms. Allocated memory is still 107.0MB. Free memory was 53.7MB in the beginning and 43.6MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3919.79ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 43.2MB in the beginning and 99.6MB in the end (delta: -56.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 28.83ms. Allocated memory is still 157.3MB. Free memory was 99.6MB in the beginning and 97.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] * 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 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 404 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 317 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 968 IncrementalHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 87 mSDtfsCounter, 968 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 128 SyntacticMatches, 4 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=4, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 21 PreInvPairs, 36 NumberOfFragments, 1413 HoareAnnotationTreeSize, 21 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 185 ConstructedInterpolants, 4 QuantifiedInterpolants, 1618 SizeOfPredicates, 32 NumberOfNonLiveVariables, 415 ConjunctsInSsa, 119 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 47/62 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant [2023-02-17 01:27:19,245 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-17 01:27:19,245 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] [2023-02-17 01:27:19,246 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] [2023-02-17 01:27:19,247 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] [2023-02-17 01:27:19,247 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] [2023-02-17 01:27:19,248 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-17 01:27:19,250 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] [2023-02-17 01:27:19,250 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] [2023-02-17 01:27:19,250 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] [2023-02-17 01:27:19,251 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~Y~0#1,QUANTIFIED] Derived loop invariant: (((((((((((X >= 0 && X <= 2) && -X + 2 * Y + 2 * Y == v) && y == 0) && (\exists ULTIMATE.start_main_~x~0#1 : int :: Y * ULTIMATE.start_main_~x~0#1 == yx)) && -X + 2 * Y < 0) && Y <= 2) && Y >= 0) && xy == X * 0) || (((((((X >= 0 && X <= 2) && v == -X + 2 * Y) && y == 0) && Y <= 2) && x == 0) && 2 * y + (-X + (Y * x * 2 + -(2 * (x * y))) + 2 * Y + -v) == 0) && Y >= 0)) || (((X >= 0 && X <= 2) && (((((((((-1 + x <= X && X >= 0) && X <= 2) && -1 + x == 0) && -X + 2 * Y == -2 * Y + v + 2 * X) && -1 + y == 0) && !(-2 * Y + v + 2 * X < 0)) && Y <= 2) && Y >= 0) || ((((X >= 0 && X <= 2) && Y * x * 2 + -(X * y * 2) + -X + 2 * Y + -v == 0) && Y <= 2) && Y >= 0))) && (x <= X || (forall ULTIMATE.start_main_~Y~0#1 : int :: 2 * y + (-X + (ULTIMATE.start_main_~Y~0#1 * x * 2 + -(2 * (x * y))) + 2 * ULTIMATE.start_main_~Y~0#1 + (-(-1 * X) + -(-2 * (X * y)) + -(2 * ULTIMATE.start_main_~Y~0#1) + -(ULTIMATE.start_main_~Y~0#1 * x * 2))) == 0)))) || ((((X >= 0 && X <= 2) && x == 0 + 1) && -1 + y == 0) && (((((((((-1 + x <= X && X >= 0) && X <= 2) && -1 + x == 0) && -X + 2 * Y == -2 * Y + v + 2 * X) && -1 + y == 0) && !(-2 * Y + v + 2 * X < 0)) && Y <= 2) && Y >= 0) || ((((X >= 0 && X <= 2) && Y * x * 2 + -(X * y * 2) + -X + 2 * Y + -v == 0) && Y <= 2) && Y >= 0)))) || ((((((X >= 0 && X <= 2) && -X + 2 * Y + 2 * Y == v) && y == 0) && -X + 2 * Y < 0) && Y <= 2) && Y >= 0) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-17 01:27:19,271 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 Result: TRUE