./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench/prod4br-ll.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/prod4br-ll.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 9fc373a278835802938e4c08f2544f1651ce1de6dc177c0a58501e43687c477d --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 01:13:35,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 01:13:35,388 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 01:13:35,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 01:13:35,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 01:13:35,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 01:13:35,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 01:13:35,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 01:13:35,449 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 01:13:35,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 01:13:35,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 01:13:35,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 01:13:35,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 01:13:35,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 01:13:35,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 01:13:35,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 01:13:35,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 01:13:35,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 01:13:35,460 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 01:13:35,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 01:13:35,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 01:13:35,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 01:13:35,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 01:13:35,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 01:13:35,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 01:13:35,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 01:13:35,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 01:13:35,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 01:13:35,480 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 01:13:35,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 01:13:35,481 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 01:13:35,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 01:13:35,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 01:13:35,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 01:13:35,483 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 01:13:35,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 01:13:35,484 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 01:13:35,484 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 01:13:35,484 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 01:13:35,485 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 01:13:35,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 01:13:35,486 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 01:13:35,508 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 01:13:35,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 01:13:35,508 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 01:13:35,508 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 01:13:35,509 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 01:13:35,509 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 01:13:35,510 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 01:13:35,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 01:13:35,510 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 01:13:35,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 01:13:35,510 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 01:13:35,511 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 01:13:35,511 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 01:13:35,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 01:13:35,511 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 01:13:35,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 01:13:35,511 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 01:13:35,511 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 01:13:35,511 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 01:13:35,512 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 01:13:35,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 01:13:35,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 01:13:35,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 01:13:35,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 01:13:35,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 01:13:35,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 01:13:35,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 01:13:35,513 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 01:13:35,513 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 01:13:35,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 01:13:35,513 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 01:13:35,513 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 01:13:35,513 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 01:13:35,514 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 01:13:35,514 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 01:13:35,514 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 -> 9fc373a278835802938e4c08f2544f1651ce1de6dc177c0a58501e43687c477d [2023-02-18 01:13:35,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 01:13:35,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 01:13:35,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 01:13:35,725 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 01:13:35,726 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 01:13:35,726 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/prod4br-ll.c [2023-02-18 01:13:36,700 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 01:13:36,856 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 01:13:36,856 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/prod4br-ll.c [2023-02-18 01:13:36,860 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb9e96276/941bb33f6d544f03ae85dcccfe291036/FLAG5e5f0cec0 [2023-02-18 01:13:36,870 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb9e96276/941bb33f6d544f03ae85dcccfe291036 [2023-02-18 01:13:36,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 01:13:36,872 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 01:13:36,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 01:13:36,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 01:13:36,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 01:13:36,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:13:36" (1/1) ... [2023-02-18 01:13:36,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319bafbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:13:36, skipping insertion in model container [2023-02-18 01:13:36,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:13:36" (1/1) ... [2023-02-18 01:13:36,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 01:13:36,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 01:13:37,002 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/prod4br-ll.c[524,537] [2023-02-18 01:13:37,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 01:13:37,017 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 01:13:37,023 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/prod4br-ll.c[524,537] [2023-02-18 01:13:37,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 01:13:37,035 INFO L208 MainTranslator]: Completed translation [2023-02-18 01:13:37,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:13:37 WrapperNode [2023-02-18 01:13:37,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 01:13:37,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 01:13:37,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 01:13:37,037 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 01:13:37,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:13:37" (1/1) ... [2023-02-18 01:13:37,045 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:13:37" (1/1) ... [2023-02-18 01:13:37,056 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2023-02-18 01:13:37,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 01:13:37,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 01:13:37,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 01:13:37,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 01:13:37,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:13:37" (1/1) ... [2023-02-18 01:13:37,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:13:37" (1/1) ... [2023-02-18 01:13:37,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:13:37" (1/1) ... [2023-02-18 01:13:37,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:13:37" (1/1) ... [2023-02-18 01:13:37,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:13:37" (1/1) ... [2023-02-18 01:13:37,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:13:37" (1/1) ... [2023-02-18 01:13:37,068 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:13:37" (1/1) ... [2023-02-18 01:13:37,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:13:37" (1/1) ... [2023-02-18 01:13:37,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 01:13:37,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 01:13:37,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 01:13:37,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 01:13:37,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:13:37" (1/1) ... [2023-02-18 01:13:37,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 01:13:37,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:13:37,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-18 01:13:37,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-18 01:13:37,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 01:13:37,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 01:13:37,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 01:13:37,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 01:13:37,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 01:13:37,120 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 01:13:37,162 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 01:13:37,163 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 01:13:37,334 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 01:13:37,338 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 01:13:37,338 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 01:13:37,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:13:37 BoogieIcfgContainer [2023-02-18 01:13:37,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 01:13:37,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 01:13:37,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 01:13:37,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 01:13:37,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 01:13:36" (1/3) ... [2023-02-18 01:13:37,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b15252b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:13:37, skipping insertion in model container [2023-02-18 01:13:37,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:13:37" (2/3) ... [2023-02-18 01:13:37,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b15252b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:13:37, skipping insertion in model container [2023-02-18 01:13:37,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:13:37" (3/3) ... [2023-02-18 01:13:37,346 INFO L112 eAbstractionObserver]: Analyzing ICFG prod4br-ll.c [2023-02-18 01:13:37,357 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 01:13:37,357 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 01:13:37,387 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 01:13:37,394 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;@1f47a70e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 01:13:37,408 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 01:13:37,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 01:13:37,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 01:13:37,416 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:13:37,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:13:37,417 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:13:37,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:13:37,421 INFO L85 PathProgramCache]: Analyzing trace with hash -588943746, now seen corresponding path program 1 times [2023-02-18 01:13:37,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:13:37,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292939158] [2023-02-18 01:13:37,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:13:37,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:13:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:13:37,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:13:37,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292939158] [2023-02-18 01:13:37,537 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-18 01:13:37,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917044488] [2023-02-18 01:13:37,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:13:37,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:13:37,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:13:37,540 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:13:37,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 01:13:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:13:37,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 01:13:37,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:13:37,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:13:37,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 01:13:37,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917044488] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 01:13:37,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 01:13:37,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 01:13:37,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610576039] [2023-02-18 01:13:37,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:13:37,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 01:13:37,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:13:37,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 01:13:37,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 01:13:37,629 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 01:13:37,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:13:37,642 INFO L93 Difference]: Finished difference Result 41 states and 61 transitions. [2023-02-18 01:13:37,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 01:13:37,643 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 01:13:37,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:13:37,647 INFO L225 Difference]: With dead ends: 41 [2023-02-18 01:13:37,647 INFO L226 Difference]: Without dead ends: 18 [2023-02-18 01:13:37,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-18 01:13:37,652 INFO L413 NwaCegarLoop]: 27 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, 27 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-18 01:13:37,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 01:13:37,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-18 01:13:37,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-18 01:13:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 01:13:37,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2023-02-18 01:13:37,673 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 9 [2023-02-18 01:13:37,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:13:37,674 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2023-02-18 01:13:37,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 01:13:37,674 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2023-02-18 01:13:37,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 01:13:37,675 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:13:37,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:13:37,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 01:13:37,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-18 01:13:37,880 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:13:37,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:13:37,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1187851076, now seen corresponding path program 1 times [2023-02-18 01:13:37,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:13:37,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229492607] [2023-02-18 01:13:37,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:13:37,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:13:37,891 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:13:37,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1025126430] [2023-02-18 01:13:37,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:13:37,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:13:37,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:13:37,895 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:13:37,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 01:13:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:13:37,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-18 01:13:37,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:13:37,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:13:37,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 01:13:37,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:13:37,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229492607] [2023-02-18 01:13:37,999 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:13:37,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025126430] [2023-02-18 01:13:37,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025126430] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 01:13:37,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 01:13:37,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 01:13:38,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988927911] [2023-02-18 01:13:38,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:13:38,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 01:13:38,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:13:38,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 01:13:38,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 01:13:38,002 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 01:13:38,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:13:38,091 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2023-02-18 01:13:38,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 01:13:38,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 01:13:38,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:13:38,093 INFO L225 Difference]: With dead ends: 32 [2023-02-18 01:13:38,093 INFO L226 Difference]: Without dead ends: 30 [2023-02-18 01:13:38,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 01:13:38,094 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:13:38,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 44 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:13:38,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-18 01:13:38,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2023-02-18 01:13:38,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 01:13:38,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-02-18 01:13:38,103 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 9 [2023-02-18 01:13:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:13:38,103 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-02-18 01:13:38,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 01:13:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-02-18 01:13:38,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-18 01:13:38,104 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:13:38,104 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:13:38,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 01:13:38,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-18 01:13:38,309 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:13:38,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:13:38,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1831703089, now seen corresponding path program 1 times [2023-02-18 01:13:38,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:13:38,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884970236] [2023-02-18 01:13:38,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:13:38,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:13:38,321 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:13:38,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1285428024] [2023-02-18 01:13:38,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:13:38,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:13:38,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:13:38,339 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:13:38,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 01:13:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:13:38,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-18 01:13:38,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:13:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:13:38,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:13:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:13:38,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:13:38,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884970236] [2023-02-18 01:13:38,591 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:13:38,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285428024] [2023-02-18 01:13:38,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285428024] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:13:38,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:13:38,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2023-02-18 01:13:38,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324745095] [2023-02-18 01:13:38,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:13:38,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 01:13:38,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:13:38,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 01:13:38,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-02-18 01:13:38,611 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 01:13:38,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:13:38,835 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2023-02-18 01:13:38,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 01:13:38,835 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2023-02-18 01:13:38,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:13:38,838 INFO L225 Difference]: With dead ends: 40 [2023-02-18 01:13:38,838 INFO L226 Difference]: Without dead ends: 38 [2023-02-18 01:13:38,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2023-02-18 01:13:38,841 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 65 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:13:38,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 55 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:13:38,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-18 01:13:38,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2023-02-18 01:13:38,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 01:13:38,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-02-18 01:13:38,858 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2023-02-18 01:13:38,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:13:38,859 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-02-18 01:13:38,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 01:13:38,859 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-02-18 01:13:38,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 01:13:38,860 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:13:38,860 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:13:38,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 01:13:39,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:13:39,066 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:13:39,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:13:39,067 INFO L85 PathProgramCache]: Analyzing trace with hash 45117644, now seen corresponding path program 1 times [2023-02-18 01:13:39,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:13:39,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705510500] [2023-02-18 01:13:39,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:13:39,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:13:39,076 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:13:39,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1087299767] [2023-02-18 01:13:39,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:13:39,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:13:39,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:13:39,094 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:13:39,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 01:13:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:13:39,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-18 01:13:39,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:13:39,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:13:39,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:13:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:13:40,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:13:40,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705510500] [2023-02-18 01:13:40,788 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:13:40,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087299767] [2023-02-18 01:13:40,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087299767] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:13:40,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:13:40,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2023-02-18 01:13:40,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109121237] [2023-02-18 01:13:40,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:13:40,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 01:13:40,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:13:40,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 01:13:40,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2023-02-18 01:13:40,790 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 01:13:43,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:13:43,354 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2023-02-18 01:13:43,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 01:13:43,354 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-02-18 01:13:43,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:13:43,355 INFO L225 Difference]: With dead ends: 54 [2023-02-18 01:13:43,355 INFO L226 Difference]: Without dead ends: 50 [2023-02-18 01:13:43,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2023-02-18 01:13:43,356 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 125 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-02-18 01:13:43,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 57 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-02-18 01:13:43,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-18 01:13:43,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 24. [2023-02-18 01:13:43,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 01:13:43,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-02-18 01:13:43,365 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2023-02-18 01:13:43,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:13:43,366 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-02-18 01:13:43,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 01:13:43,366 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-02-18 01:13:43,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-18 01:13:43,367 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:13:43,367 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:13:43,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-18 01:13:43,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:13:43,572 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:13:43,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:13:43,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1388754562, now seen corresponding path program 1 times [2023-02-18 01:13:43,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:13:43,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91187017] [2023-02-18 01:13:43,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:13:43,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:13:43,592 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:13:43,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [693783266] [2023-02-18 01:13:43,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:13:43,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:13:43,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:13:43,611 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:13:43,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 01:13:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:13:43,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 01:13:43,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:13:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 01:13:43,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 01:13:43,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:13:43,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91187017] [2023-02-18 01:13:43,677 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:13:43,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693783266] [2023-02-18 01:13:43,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693783266] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 01:13:43,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 01:13:43,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 01:13:43,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121511990] [2023-02-18 01:13:43,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:13:43,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 01:13:43,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:13:43,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 01:13:43,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-18 01:13:43,680 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 01:13:43,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:13:43,750 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2023-02-18 01:13:43,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 01:13:43,750 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2023-02-18 01:13:43,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:13:43,751 INFO L225 Difference]: With dead ends: 36 [2023-02-18 01:13:43,751 INFO L226 Difference]: Without dead ends: 30 [2023-02-18 01:13:43,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-02-18 01:13:43,752 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 44 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 01:13:43,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 57 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 01:13:43,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-18 01:13:43,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2023-02-18 01:13:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 01:13:43,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-02-18 01:13:43,768 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 20 [2023-02-18 01:13:43,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:13:43,769 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-02-18 01:13:43,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 01:13:43,770 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-02-18 01:13:43,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 01:13:43,770 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:13:43,771 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:13:43,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-18 01:13:43,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:13:43,975 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:13:43,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:13:43,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2048567935, now seen corresponding path program 1 times [2023-02-18 01:13:43,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:13:43,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207509038] [2023-02-18 01:13:43,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:13:43,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:13:43,986 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:13:43,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [360895807] [2023-02-18 01:13:43,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:13:43,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:13:43,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:13:43,988 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:13:43,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 01:13:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:13:44,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-18 01:13:44,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:13:44,077 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 01:13:44,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 01:13:44,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:13:44,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207509038] [2023-02-18 01:13:44,078 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:13:44,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360895807] [2023-02-18 01:13:44,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360895807] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 01:13:44,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 01:13:44,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 01:13:44,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683518184] [2023-02-18 01:13:44,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:13:44,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 01:13:44,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:13:44,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 01:13:44,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-18 01:13:44,079 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 01:13:44,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:13:44,393 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2023-02-18 01:13:44,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 01:13:44,393 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2023-02-18 01:13:44,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:13:44,394 INFO L225 Difference]: With dead ends: 73 [2023-02-18 01:13:44,394 INFO L226 Difference]: Without dead ends: 49 [2023-02-18 01:13:44,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-18 01:13:44,395 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 01:13:44,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 116 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 01:13:44,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-02-18 01:13:44,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2023-02-18 01:13:44,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 01:13:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2023-02-18 01:13:44,411 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 30 [2023-02-18 01:13:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:13:44,412 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2023-02-18 01:13:44,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 01:13:44,412 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2023-02-18 01:13:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 01:13:44,413 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:13:44,413 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:13:44,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-18 01:13:44,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:13:44,618 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:13:44,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:13:44,618 INFO L85 PathProgramCache]: Analyzing trace with hash 460220033, now seen corresponding path program 1 times [2023-02-18 01:13:44,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:13:44,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891374333] [2023-02-18 01:13:44,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:13:44,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:13:44,625 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:13:44,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2131531308] [2023-02-18 01:13:44,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:13:44,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:13:44,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:13:44,627 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:13:44,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 01:13:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:13:44,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-18 01:13:44,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:13:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 01:13:44,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:13:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 01:13:44,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:13:44,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891374333] [2023-02-18 01:13:44,743 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:13:44,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131531308] [2023-02-18 01:13:44,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131531308] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 01:13:44,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:13:44,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2023-02-18 01:13:44,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700574918] [2023-02-18 01:13:44,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:13:44,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 01:13:44,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:13:44,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 01:13:44,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:13:44,745 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 01:13:44,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:13:44,826 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2023-02-18 01:13:44,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 01:13:44,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2023-02-18 01:13:44,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:13:44,826 INFO L225 Difference]: With dead ends: 39 [2023-02-18 01:13:44,827 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 01:13:44,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-02-18 01:13:44,827 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:13:44,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 63 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:13:44,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 01:13:44,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 01:13:44,828 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-18 01:13:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 01:13:44,829 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2023-02-18 01:13:44,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:13:44,829 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 01:13:44,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 01:13:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 01:13:44,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 01:13:44,831 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 01:13:44,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-18 01:13:45,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:13:45,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 01:13:45,052 INFO L895 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (let ((.cse37 (mod |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse6 (= (mod |ULTIMATE.start_main_~a~0#1| 2) 0)) (.cse27 (= .cse37 0))) (let ((.cse1 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse7 (not .cse27)) (.cse38 (< |ULTIMATE.start_main_~b~0#1| 0)) (.cse8 (not .cse6)) (.cse41 (< |ULTIMATE.start_main_~a~0#1| 0))) (let ((.cse5 (not .cse41)) (.cse10 (and .cse8 .cse41)) (.cse9 (and .cse7 .cse38)) (.cse3 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse1) (and (not .cse1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse4 (not (= |ULTIMATE.start_main_~a~0#1| 0)))) (let ((.cse2 (<= 1 |ULTIMATE.start_main_~b~0#1|)) (.cse0 (let ((.cse40 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse39 (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse20 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse19 (or (and .cse1 .cse3) (and .cse1 .cse39 .cse3) (and .cse1 .cse3 (or (= |ULTIMATE.start_main_~q~0#1| .cse20) (and (not (= |ULTIMATE.start_main_~b~0#1| 0)) .cse4))))) (.cse30 (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse40) |ULTIMATE.start_main_~q~0#1|) .cse20))) (or (let ((.cse21 (mod |ULTIMATE.start_main_~y~0#1| 2))) (let ((.cse22 (= .cse21 0)) (.cse13 (< |ULTIMATE.start_main_~y~0#1| 0)) (.cse18 (< |ULTIMATE.start_main_~x~0#1| 0)) (.cse17 (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0))) (let ((.cse16 (or (not .cse18) .cse17)) (.cse11 (or .cse22 (not .cse13))) (.cse14 (not .cse22))) (and (let ((.cse12 (div |ULTIMATE.start_main_~y~0#1| 2))) (or (and .cse11 (= |ULTIMATE.start_main_~b~0#1| .cse12)) (and (= |ULTIMATE.start_main_~b~0#1| (+ 1 .cse12)) .cse13 .cse14))) (let ((.cse15 (div |ULTIMATE.start_main_~x~0#1| 2))) (or (and (= .cse15 |ULTIMATE.start_main_~a~0#1|) .cse16) (and (not .cse17) .cse18 (= (+ .cse15 1) |ULTIMATE.start_main_~a~0#1|)))) .cse19 .cse1 (= (+ (* .cse20 1) |ULTIMATE.start_main_~q~0#1|) .cse20) .cse17 .cse3 (= (* 4 1) |ULTIMATE.start_main_~p~0#1|) .cse16 (or (and .cse11 (<= .cse21 0)) (and .cse13 (<= (+ (- 2) .cse21) 0) .cse14)))))) (let ((.cse35 (div |ULTIMATE.start_main_~a~0#1| 2)) (.cse36 (div |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse33 (+ 1 .cse36)) (.cse32 (+ .cse35 1)) (.cse34 (* |ULTIMATE.start_main_~p~0#1| 4)) (.cse24 (not .cse38))) (let ((.cse23 (and (or (not (<= .cse37 0)) .cse9) (or .cse24 (not (<= (+ (- 2) .cse37) 0)) .cse27))) (.cse29 (* (* .cse35 .cse36) .cse34)) (.cse28 (* (* .cse32 .cse36) .cse34)) (.cse26 (* .cse34 (* .cse35 .cse33))) (.cse25 (* (* .cse32 .cse33) .cse34))) (and (or .cse8 .cse23 (and (or .cse24 (and (or .cse5 (= (+ .cse25 |ULTIMATE.start_main_~q~0#1|) .cse20) .cse6) (or (= (+ |ULTIMATE.start_main_~q~0#1| .cse26) .cse20) .cse10)) .cse27) (or (and (or .cse5 (= (+ |ULTIMATE.start_main_~q~0#1| .cse28) .cse20) .cse6) (or (= (+ .cse29 |ULTIMATE.start_main_~q~0#1|) .cse20) .cse10)) .cse9)) .cse10) .cse19 .cse1 .cse30 (or .cse8 .cse23 (let ((.cse31 (+ (* (- 1) |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~p~0#1|) .cse20))) (and (or (and (or (= (+ .cse29 .cse31) .cse20) .cse10) (or (= .cse20 (+ .cse28 .cse31)) .cse5 .cse6)) .cse9) (or .cse24 (and (or (= (+ .cse26 .cse31) .cse20) .cse10) (or .cse5 .cse6 (= (+ .cse25 .cse31) .cse20))) .cse27))) .cse10) .cse3)))) (and .cse19 .cse1 .cse30 .cse3) (and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse1 .cse39 (= |ULTIMATE.start_main_~q~0#1| 0) .cse30 .cse3 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse40) |ULTIMATE.start_main_~q~0#1|) .cse20)))))))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse3) (and (<= 0 1) .cse0 (or .cse5 .cse6) .cse1 .cse4 .cse6 .cse3 (< 1 2)) (and .cse0 .cse1 .cse4 (or .cse7 .cse8 .cse9 .cse10) .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse3) (and .cse0 .cse1 .cse3))))))) [2023-02-18 01:13:45,052 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 01:13:45,052 INFO L899 garLoopResultBuilder]: For program point L33-1(lines 32 53) no Hoare annotation was computed. [2023-02-18 01:13:45,053 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-02-18 01:13:45,053 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 52) no Hoare annotation was computed. [2023-02-18 01:13:45,053 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 01:13:45,053 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2023-02-18 01:13:45,053 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 19 58) the Hoare annotation is: true [2023-02-18 01:13:45,053 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 52) no Hoare annotation was computed. [2023-02-18 01:13:45,053 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 01:13:45,054 INFO L895 garLoopResultBuilder]: At program point L32-2(lines 32 53) the Hoare annotation is: (let ((.cse39 (mod |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse11 (= (mod |ULTIMATE.start_main_~a~0#1| 2) 0)) (.cse29 (= .cse39 0))) (let ((.cse2 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse5 (not .cse29)) (.cse40 (< |ULTIMATE.start_main_~b~0#1| 0)) (.cse6 (not .cse11)) (.cse42 (< |ULTIMATE.start_main_~a~0#1| 0))) (let ((.cse10 (not .cse42)) (.cse8 (and .cse6 .cse42)) (.cse7 (and .cse5 .cse40)) (.cse9 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse3 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse2) (and (not .cse2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse12 (= |ULTIMATE.start_main_~a~0#1| 0))) (let ((.cse0 (or (= |ULTIMATE.start_main_~b~0#1| 0) .cse12)) (.cse1 (let ((.cse22 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse13 (let ((.cse41 (or (and (<= |ULTIMATE.start_main_~y~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~p~0#1| Int)) (= (+ (* (* |ULTIMATE.start_main_~a~0#1| 0) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) .cse22))) (exists ((|ULTIMATE.start_main_~b~0#1| Int)) (and (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (= (+ (* (* |ULTIMATE.start_main_~b~0#1| 0) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) .cse22)) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)))))) (or (and .cse2 (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) .cse41 .cse3 (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse9) |ULTIMATE.start_main_~q~0#1|) .cse22))) (and .cse2 .cse41 .cse3)))) (.cse32 (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse9) |ULTIMATE.start_main_~q~0#1|) .cse22))) (or (let ((.cse23 (mod |ULTIMATE.start_main_~y~0#1| 2))) (let ((.cse24 (= .cse23 0)) (.cse16 (< |ULTIMATE.start_main_~y~0#1| 0)) (.cse21 (< |ULTIMATE.start_main_~x~0#1| 0)) (.cse20 (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0))) (let ((.cse19 (or (not .cse21) .cse20)) (.cse14 (or .cse24 (not .cse16))) (.cse17 (not .cse24))) (and .cse13 (let ((.cse15 (div |ULTIMATE.start_main_~y~0#1| 2))) (or (and .cse14 (= |ULTIMATE.start_main_~b~0#1| .cse15)) (and (= |ULTIMATE.start_main_~b~0#1| (+ 1 .cse15)) .cse16 .cse17))) (let ((.cse18 (div |ULTIMATE.start_main_~x~0#1| 2))) (or (and (= .cse18 |ULTIMATE.start_main_~a~0#1|) .cse19) (and (not .cse20) .cse21 (= (+ .cse18 1) |ULTIMATE.start_main_~a~0#1|)))) .cse2 (= (+ (* .cse22 1) |ULTIMATE.start_main_~q~0#1|) .cse22) .cse20 .cse3 (= (* 4 1) |ULTIMATE.start_main_~p~0#1|) .cse19 (or (and .cse14 (<= .cse23 0)) (and .cse16 (<= (+ (- 2) .cse23) 0) .cse17)))))) (let ((.cse37 (div |ULTIMATE.start_main_~a~0#1| 2)) (.cse38 (div |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse35 (+ 1 .cse38)) (.cse34 (+ .cse37 1)) (.cse36 (* |ULTIMATE.start_main_~p~0#1| 4)) (.cse26 (not .cse40))) (let ((.cse25 (and (or (not (<= .cse39 0)) .cse7) (or .cse26 (not (<= (+ (- 2) .cse39) 0)) .cse29))) (.cse31 (* (* .cse37 .cse38) .cse36)) (.cse30 (* (* .cse34 .cse38) .cse36)) (.cse28 (* .cse36 (* .cse37 .cse35))) (.cse27 (* (* .cse34 .cse35) .cse36))) (and .cse13 (or .cse6 .cse25 (and (or .cse26 (and (or .cse10 (= (+ .cse27 |ULTIMATE.start_main_~q~0#1|) .cse22) .cse11) (or (= (+ |ULTIMATE.start_main_~q~0#1| .cse28) .cse22) .cse8)) .cse29) (or (and (or .cse10 (= (+ |ULTIMATE.start_main_~q~0#1| .cse30) .cse22) .cse11) (or (= (+ .cse31 |ULTIMATE.start_main_~q~0#1|) .cse22) .cse8)) .cse7)) .cse8) .cse2 .cse32 (or .cse6 .cse25 (let ((.cse33 (+ (* (- 1) |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~p~0#1|) .cse22))) (and (or (and (or (= (+ .cse31 .cse33) .cse22) .cse8) (or (= .cse22 (+ .cse30 .cse33)) .cse10 .cse11)) .cse7) (or .cse26 (and (or (= (+ .cse28 .cse33) .cse22) .cse8) (or .cse10 .cse11 (= (+ .cse27 .cse33) .cse22))) .cse29))) .cse8) .cse3)))) (and (= |ULTIMATE.start_main_~p~0#1| 1) .cse13 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse2 .cse32 .cse3 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)))))) (.cse4 (not .cse12))) (or (and .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_main_~b~0#1|) .cse3) (and (or (and .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and .cse1 .cse2 .cse4 (or .cse5 .cse6 .cse7 .cse8) .cse3)) (= .cse9 0)) (and (<= 0 1) .cse0 .cse1 (or .cse10 .cse11) .cse2 .cse4 .cse11 .cse3 (< 1 2)))))))) [2023-02-18 01:13:45,054 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 01:13:45,054 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse39 (mod |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse11 (= (mod |ULTIMATE.start_main_~a~0#1| 2) 0)) (.cse29 (= .cse39 0))) (let ((.cse2 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse5 (not .cse29)) (.cse40 (< |ULTIMATE.start_main_~b~0#1| 0)) (.cse6 (not .cse11)) (.cse42 (< |ULTIMATE.start_main_~a~0#1| 0))) (let ((.cse10 (not .cse42)) (.cse8 (and .cse6 .cse42)) (.cse7 (and .cse5 .cse40)) (.cse9 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse3 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse2) (and (not .cse2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse12 (= |ULTIMATE.start_main_~a~0#1| 0))) (let ((.cse0 (or (= |ULTIMATE.start_main_~b~0#1| 0) .cse12)) (.cse1 (let ((.cse22 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse13 (let ((.cse41 (or (and (<= |ULTIMATE.start_main_~y~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~p~0#1| Int)) (= (+ (* (* |ULTIMATE.start_main_~a~0#1| 0) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) .cse22))) (exists ((|ULTIMATE.start_main_~b~0#1| Int)) (and (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (= (+ (* (* |ULTIMATE.start_main_~b~0#1| 0) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) .cse22)) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)))))) (or (and .cse2 (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) .cse41 .cse3 (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse9) |ULTIMATE.start_main_~q~0#1|) .cse22))) (and .cse2 .cse41 .cse3)))) (.cse32 (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse9) |ULTIMATE.start_main_~q~0#1|) .cse22))) (or (let ((.cse23 (mod |ULTIMATE.start_main_~y~0#1| 2))) (let ((.cse24 (= .cse23 0)) (.cse16 (< |ULTIMATE.start_main_~y~0#1| 0)) (.cse21 (< |ULTIMATE.start_main_~x~0#1| 0)) (.cse20 (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0))) (let ((.cse19 (or (not .cse21) .cse20)) (.cse14 (or .cse24 (not .cse16))) (.cse17 (not .cse24))) (and .cse13 (let ((.cse15 (div |ULTIMATE.start_main_~y~0#1| 2))) (or (and .cse14 (= |ULTIMATE.start_main_~b~0#1| .cse15)) (and (= |ULTIMATE.start_main_~b~0#1| (+ 1 .cse15)) .cse16 .cse17))) (let ((.cse18 (div |ULTIMATE.start_main_~x~0#1| 2))) (or (and (= .cse18 |ULTIMATE.start_main_~a~0#1|) .cse19) (and (not .cse20) .cse21 (= (+ .cse18 1) |ULTIMATE.start_main_~a~0#1|)))) .cse2 (= (+ (* .cse22 1) |ULTIMATE.start_main_~q~0#1|) .cse22) .cse20 .cse3 (= (* 4 1) |ULTIMATE.start_main_~p~0#1|) .cse19 (or (and .cse14 (<= .cse23 0)) (and .cse16 (<= (+ (- 2) .cse23) 0) .cse17)))))) (let ((.cse37 (div |ULTIMATE.start_main_~a~0#1| 2)) (.cse38 (div |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse35 (+ 1 .cse38)) (.cse34 (+ .cse37 1)) (.cse36 (* |ULTIMATE.start_main_~p~0#1| 4)) (.cse26 (not .cse40))) (let ((.cse25 (and (or (not (<= .cse39 0)) .cse7) (or .cse26 (not (<= (+ (- 2) .cse39) 0)) .cse29))) (.cse31 (* (* .cse37 .cse38) .cse36)) (.cse30 (* (* .cse34 .cse38) .cse36)) (.cse28 (* .cse36 (* .cse37 .cse35))) (.cse27 (* (* .cse34 .cse35) .cse36))) (and .cse13 (or .cse6 .cse25 (and (or .cse26 (and (or .cse10 (= (+ .cse27 |ULTIMATE.start_main_~q~0#1|) .cse22) .cse11) (or (= (+ |ULTIMATE.start_main_~q~0#1| .cse28) .cse22) .cse8)) .cse29) (or (and (or .cse10 (= (+ |ULTIMATE.start_main_~q~0#1| .cse30) .cse22) .cse11) (or (= (+ .cse31 |ULTIMATE.start_main_~q~0#1|) .cse22) .cse8)) .cse7)) .cse8) .cse2 .cse32 (or .cse6 .cse25 (let ((.cse33 (+ (* (- 1) |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~p~0#1|) .cse22))) (and (or (and (or (= (+ .cse31 .cse33) .cse22) .cse8) (or (= .cse22 (+ .cse30 .cse33)) .cse10 .cse11)) .cse7) (or .cse26 (and (or (= (+ .cse28 .cse33) .cse22) .cse8) (or .cse10 .cse11 (= (+ .cse27 .cse33) .cse22))) .cse29))) .cse8) .cse3)))) (and (= |ULTIMATE.start_main_~p~0#1| 1) .cse13 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse2 .cse32 .cse3 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)))))) (.cse4 (not .cse12))) (or (and .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_main_~b~0#1|) .cse3) (and (or (and .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and .cse1 .cse2 .cse4 (or .cse5 .cse6 .cse7 .cse8) .cse3)) (= .cse9 0)) (and (<= 0 1) .cse0 .cse1 (or .cse10 .cse11) .cse2 .cse4 .cse11 .cse3 (< 1 2)))))))) [2023-02-18 01:13:45,055 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 52) no Hoare annotation was computed. [2023-02-18 01:13:45,055 INFO L895 garLoopResultBuilder]: At program point L45-2(lines 32 53) the Hoare annotation is: (let ((.cse37 (mod |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse6 (= (mod |ULTIMATE.start_main_~a~0#1| 2) 0)) (.cse27 (= .cse37 0))) (let ((.cse1 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse7 (not .cse27)) (.cse38 (< |ULTIMATE.start_main_~b~0#1| 0)) (.cse8 (not .cse6)) (.cse41 (< |ULTIMATE.start_main_~a~0#1| 0))) (let ((.cse5 (not .cse41)) (.cse10 (and .cse8 .cse41)) (.cse9 (and .cse7 .cse38)) (.cse3 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse1) (and (not .cse1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse4 (not (= |ULTIMATE.start_main_~a~0#1| 0)))) (let ((.cse2 (<= 1 |ULTIMATE.start_main_~b~0#1|)) (.cse0 (let ((.cse40 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse39 (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse20 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse19 (or (and .cse1 .cse3) (and .cse1 .cse39 .cse3) (and .cse1 .cse3 (or (= |ULTIMATE.start_main_~q~0#1| .cse20) (and (not (= |ULTIMATE.start_main_~b~0#1| 0)) .cse4))))) (.cse30 (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse40) |ULTIMATE.start_main_~q~0#1|) .cse20))) (or (let ((.cse21 (mod |ULTIMATE.start_main_~y~0#1| 2))) (let ((.cse22 (= .cse21 0)) (.cse13 (< |ULTIMATE.start_main_~y~0#1| 0)) (.cse18 (< |ULTIMATE.start_main_~x~0#1| 0)) (.cse17 (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0))) (let ((.cse16 (or (not .cse18) .cse17)) (.cse11 (or .cse22 (not .cse13))) (.cse14 (not .cse22))) (and (let ((.cse12 (div |ULTIMATE.start_main_~y~0#1| 2))) (or (and .cse11 (= |ULTIMATE.start_main_~b~0#1| .cse12)) (and (= |ULTIMATE.start_main_~b~0#1| (+ 1 .cse12)) .cse13 .cse14))) (let ((.cse15 (div |ULTIMATE.start_main_~x~0#1| 2))) (or (and (= .cse15 |ULTIMATE.start_main_~a~0#1|) .cse16) (and (not .cse17) .cse18 (= (+ .cse15 1) |ULTIMATE.start_main_~a~0#1|)))) .cse19 .cse1 (= (+ (* .cse20 1) |ULTIMATE.start_main_~q~0#1|) .cse20) .cse17 .cse3 (= (* 4 1) |ULTIMATE.start_main_~p~0#1|) .cse16 (or (and .cse11 (<= .cse21 0)) (and .cse13 (<= (+ (- 2) .cse21) 0) .cse14)))))) (let ((.cse35 (div |ULTIMATE.start_main_~a~0#1| 2)) (.cse36 (div |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse33 (+ 1 .cse36)) (.cse32 (+ .cse35 1)) (.cse34 (* |ULTIMATE.start_main_~p~0#1| 4)) (.cse24 (not .cse38))) (let ((.cse23 (and (or (not (<= .cse37 0)) .cse9) (or .cse24 (not (<= (+ (- 2) .cse37) 0)) .cse27))) (.cse29 (* (* .cse35 .cse36) .cse34)) (.cse28 (* (* .cse32 .cse36) .cse34)) (.cse26 (* .cse34 (* .cse35 .cse33))) (.cse25 (* (* .cse32 .cse33) .cse34))) (and (or .cse8 .cse23 (and (or .cse24 (and (or .cse5 (= (+ .cse25 |ULTIMATE.start_main_~q~0#1|) .cse20) .cse6) (or (= (+ |ULTIMATE.start_main_~q~0#1| .cse26) .cse20) .cse10)) .cse27) (or (and (or .cse5 (= (+ |ULTIMATE.start_main_~q~0#1| .cse28) .cse20) .cse6) (or (= (+ .cse29 |ULTIMATE.start_main_~q~0#1|) .cse20) .cse10)) .cse9)) .cse10) .cse19 .cse1 .cse30 (or .cse8 .cse23 (let ((.cse31 (+ (* (- 1) |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~p~0#1|) .cse20))) (and (or (and (or (= (+ .cse29 .cse31) .cse20) .cse10) (or (= .cse20 (+ .cse28 .cse31)) .cse5 .cse6)) .cse9) (or .cse24 (and (or (= (+ .cse26 .cse31) .cse20) .cse10) (or .cse5 .cse6 (= (+ .cse25 .cse31) .cse20))) .cse27))) .cse10) .cse3)))) (and .cse19 .cse1 .cse30 .cse3) (and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse1 .cse39 (= |ULTIMATE.start_main_~q~0#1| 0) .cse30 .cse3 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse40) |ULTIMATE.start_main_~q~0#1|) .cse20)))))))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse3) (and (<= 0 1) .cse0 (or .cse5 .cse6) .cse1 .cse4 .cse6 .cse3 (< 1 2)) (and .cse0 .cse1 .cse4 (or .cse7 .cse8 .cse9 .cse10) .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse3) (and .cse0 .cse1 .cse3))))))) [2023-02-18 01:13:45,055 INFO L899 garLoopResultBuilder]: For program point L8(lines 8 10) no Hoare annotation was computed. [2023-02-18 01:13:45,055 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2023-02-18 01:13:45,055 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2023-02-18 01:13:45,055 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2023-02-18 01:13:45,055 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2023-02-18 01:13:45,056 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 11 17) the Hoare annotation is: (let ((.cse2 (= |__VERIFIER_assert_#in~cond| 1))) (let ((.cse5 (not .cse2))) (and (let ((.cse0 (< 0 2))) (let ((.cse1 (or .cse2 (and .cse0 .cse2)))) (or (and .cse0 .cse1 .cse2) (let ((.cse4 (not .cse0))) (let ((.cse3 (and .cse5 (or .cse5 .cse4)))) (and (or .cse3 .cse4) (or .cse3 .cse5 .cse4)))) (and .cse0 .cse1)))) (let ((.cse6 (<= 1 0))) (or (and (or (not .cse6) .cse5) .cse5) (and .cse6 .cse2) .cse2))))) [2023-02-18 01:13:45,056 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2023-02-18 01:13:45,060 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:13:45,061 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 01:13:45,078 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,079 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,079 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,080 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,080 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,080 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,099 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,099 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,100 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,100 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,100 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,100 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 01:13:45 BoogieIcfgContainer [2023-02-18 01:13:45,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 01:13:45,108 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 01:13:45,108 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 01:13:45,108 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 01:13:45,108 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:13:37" (3/4) ... [2023-02-18 01:13:45,110 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 01:13:45,115 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 01:13:45,117 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-02-18 01:13:45,117 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 01:13:45,117 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 01:13:45,118 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 01:13:45,132 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((y % 2 == 0 || !(y < 0)) && b == y / 2) || ((b == 1 + y / 2 && y < 0) && !(y % 2 == 0))) && ((x / 2 == a && (!(x < 0) || x % 2 == 0)) || ((!(x % 2 == 0) && x < 0) && x / 2 + 1 == a))) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y))) && y >= 1) && 1 <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((((((((((((((((((y % 2 == 0 || !(y < 0)) && b == y / 2) || ((b == 1 + y / 2 && y < 0) && !(y % 2 == 0))) && ((x / 2 == a && (!(x < 0) || x % 2 == 0)) || ((!(x % 2 == 0) && x < 0) && x / 2 + 1 == a))) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y))) && y >= 1) && !(a == 0)) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || (((((((0 <= 1 && (((((((((((((((y % 2 == 0 || !(y < 0)) && b == y / 2) || ((b == 1 + y / 2 && y < 0) && !(y % 2 == 0))) && ((x / 2 == a && (!(x < 0) || x % 2 == 0)) || ((!(x % 2 == 0) && x < 0) && x / 2 + 1 == a))) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y)))) && (!(a < 0) || a % 2 == 0)) && y >= 1) && !(a == 0)) && a % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 1 < 2)) || (((((((((((((((((((y % 2 == 0 || !(y < 0)) && b == y / 2) || ((b == 1 + y / 2 && y < 0) && !(y % 2 == 0))) && ((x / 2 == a && (!(x < 0) || x % 2 == 0)) || ((!(x % 2 == 0) && x < 0) && x / 2 + 1 == a))) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y))) && y >= 1) && !(a == 0)) && (((!(b % 2 == 0) || !(a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || (((((((((((((((((((y % 2 == 0 || !(y < 0)) && b == y / 2) || ((b == 1 + y / 2 && y < 0) && !(y % 2 == 0))) && ((x / 2 == a && (!(x < 0) || x % 2 == 0)) || ((!(x % 2 == 0) && x < 0) && x / 2 + 1 == a))) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y))) && y >= 1) && 1 <= b) && !(a == 0)) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || (((((((((((((((((y % 2 == 0 || !(y < 0)) && b == y / 2) || ((b == 1 + y / 2 && y < 0) && !(y % 2 == 0))) && ((x / 2 == a && (!(x < 0) || x % 2 == 0)) || ((!(x % 2 == 0) && x < 0) && x / 2 + 1 == a))) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y))) && y >= 1) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) [2023-02-18 01:13:45,137 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 01:13:45,137 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 01:13:45,138 INFO L158 Benchmark]: Toolchain (without parser) took 8265.50ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 159.1MB in the beginning and 90.4MB in the end (delta: 68.7MB). Peak memory consumption was 108.6MB. Max. memory is 16.1GB. [2023-02-18 01:13:45,138 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 01:13:45,138 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.12ms. Allocated memory is still 195.0MB. Free memory was 159.1MB in the beginning and 156.7MB in the end (delta: 2.4MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2023-02-18 01:13:45,138 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.71ms. Allocated memory is still 195.0MB. Free memory was 156.7MB in the beginning and 155.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 01:13:45,138 INFO L158 Benchmark]: Boogie Preprocessor took 13.21ms. Allocated memory is still 195.0MB. Free memory was 155.7MB in the beginning and 153.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 01:13:45,139 INFO L158 Benchmark]: RCFGBuilder took 269.40ms. Allocated memory is still 195.0MB. Free memory was 153.6MB in the beginning and 142.0MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 01:13:45,139 INFO L158 Benchmark]: TraceAbstraction took 7766.08ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 142.0MB in the beginning and 92.5MB in the end (delta: 49.5MB). Peak memory consumption was 91.5MB. Max. memory is 16.1GB. [2023-02-18 01:13:45,139 INFO L158 Benchmark]: Witness Printer took 29.73ms. Allocated memory is still 234.9MB. Free memory was 92.5MB in the beginning and 90.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 01:13:45,140 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.12ms. Allocated memory is still 195.0MB. Free memory was 159.1MB in the beginning and 156.7MB in the end (delta: 2.4MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.71ms. Allocated memory is still 195.0MB. Free memory was 156.7MB in the beginning and 155.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 13.21ms. Allocated memory is still 195.0MB. Free memory was 155.7MB in the beginning and 153.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 269.40ms. Allocated memory is still 195.0MB. Free memory was 153.6MB in the beginning and 142.0MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7766.08ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 142.0MB in the beginning and 92.5MB in the end (delta: 49.5MB). Peak memory consumption was 91.5MB. Max. memory is 16.1GB. * Witness Printer took 29.73ms. Allocated memory is still 234.9MB. Free memory was 92.5MB in the beginning and 90.4MB in the end (delta: 2.1MB). There was no memory consumed. 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_~p~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~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: 14]: 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 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 260 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 254 mSDsluCounter, 419 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 289 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 734 IncrementalHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 130 mSDtfsCounter, 734 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 124 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=6, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 53 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 21 PreInvPairs, 36 NumberOfFragments, 22266 HoareAnnotationTreeSize, 21 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 182 ConstructedInterpolants, 4 QuantifiedInterpolants, 2320 SizeOfPredicates, 39 NumberOfNonLiveVariables, 496 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 65/83 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: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant [2023-02-18 01:13:45,146 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,146 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,146 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,146 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,146 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,147 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,151 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,151 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,151 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,151 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,152 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 01:13:45,152 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((y % 2 == 0 || !(y < 0)) && b == y / 2) || ((b == 1 + y / 2 && y < 0) && !(y % 2 == 0))) && ((x / 2 == a && (!(x < 0) || x % 2 == 0)) || ((!(x % 2 == 0) && x < 0) && x / 2 + 1 == a))) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y))) && y >= 1) && 1 <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((((((((((((((((((y % 2 == 0 || !(y < 0)) && b == y / 2) || ((b == 1 + y / 2 && y < 0) && !(y % 2 == 0))) && ((x / 2 == a && (!(x < 0) || x % 2 == 0)) || ((!(x % 2 == 0) && x < 0) && x / 2 + 1 == a))) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y))) && y >= 1) && !(a == 0)) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || (((((((0 <= 1 && (((((((((((((((y % 2 == 0 || !(y < 0)) && b == y / 2) || ((b == 1 + y / 2 && y < 0) && !(y % 2 == 0))) && ((x / 2 == a && (!(x < 0) || x % 2 == 0)) || ((!(x % 2 == 0) && x < 0) && x / 2 + 1 == a))) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y)))) && (!(a < 0) || a % 2 == 0)) && y >= 1) && !(a == 0)) && a % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 1 < 2)) || (((((((((((((((((((y % 2 == 0 || !(y < 0)) && b == y / 2) || ((b == 1 + y / 2 && y < 0) && !(y % 2 == 0))) && ((x / 2 == a && (!(x < 0) || x % 2 == 0)) || ((!(x % 2 == 0) && x < 0) && x / 2 + 1 == a))) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y))) && y >= 1) && !(a == 0)) && (((!(b % 2 == 0) || !(a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || (((((((((((((((((((y % 2 == 0 || !(y < 0)) && b == y / 2) || ((b == 1 + y / 2 && y < 0) && !(y % 2 == 0))) && ((x / 2 == a && (!(x < 0) || x % 2 == 0)) || ((!(x % 2 == 0) && x < 0) && x / 2 + 1 == a))) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y))) && y >= 1) && 1 <= b) && !(a == 0)) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || (((((((((((((((((y % 2 == 0 || !(y < 0)) && b == y / 2) || ((b == 1 + y / 2 && y < 0) && !(y % 2 == 0))) && ((x / 2 == a && (!(x < 0) || x % 2 == 0)) || ((!(x % 2 == 0) && x < 0) && x / 2 + 1 == a))) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y))) && y >= 1) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) RESULT: Ultimate proved your program to be correct! [2023-02-18 01:13:45,186 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