./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39b9505d3a064a677b57bccb6de3a4c04e873275d34ee3c16e80371638b07149 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 18:25:17,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 18:25:17,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 18:25:17,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 18:25:17,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 18:25:17,452 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 18:25:17,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 18:25:17,459 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 18:25:17,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 18:25:17,468 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 18:25:17,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 18:25:17,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 18:25:17,470 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 18:25:17,474 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 18:25:17,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 18:25:17,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 18:25:17,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 18:25:17,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 18:25:17,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 18:25:17,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 18:25:17,494 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 18:25:17,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 18:25:17,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 18:25:17,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 18:25:17,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 18:25:17,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 18:25:17,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 18:25:17,503 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 18:25:17,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 18:25:17,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 18:25:17,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 18:25:17,505 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 18:25:17,506 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 18:25:17,507 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 18:25:17,507 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 18:25:17,508 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 18:25:17,508 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 18:25:17,508 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 18:25:17,509 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 18:25:17,509 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 18:25:17,510 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 18:25:17,511 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 18:25:17,530 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 18:25:17,531 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 18:25:17,531 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 18:25:17,531 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 18:25:17,532 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 18:25:17,532 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 18:25:17,533 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 18:25:17,533 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 18:25:17,533 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 18:25:17,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 18:25:17,534 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 18:25:17,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 18:25:17,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 18:25:17,535 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 18:25:17,535 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 18:25:17,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 18:25:17,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 18:25:17,536 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 18:25:17,536 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 18:25:17,536 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 18:25:17,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 18:25:17,537 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 18:25:17,537 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 18:25:17,537 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 18:25:17,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 18:25:17,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 18:25:17,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 18:25:17,538 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 18:25:17,538 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 18:25:17,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 18:25:17,539 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 18:25:17,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 18:25:17,539 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 18:25:17,540 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 18:25:17,540 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 18:25:17,540 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 -> 39b9505d3a064a677b57bccb6de3a4c04e873275d34ee3c16e80371638b07149 [2023-02-18 18:25:17,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 18:25:17,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 18:25:17,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 18:25:17,790 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 18:25:17,790 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 18:25:17,791 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.c [2023-02-18 18:25:18,966 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 18:25:19,150 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 18:25:19,150 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.c [2023-02-18 18:25:19,155 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7a6f624/e2c1851cf59b4870bb58c70529c979d3/FLAG51e6019ad [2023-02-18 18:25:19,168 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7a6f624/e2c1851cf59b4870bb58c70529c979d3 [2023-02-18 18:25:19,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 18:25:19,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 18:25:19,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 18:25:19,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 18:25:19,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 18:25:19,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 06:25:19" (1/1) ... [2023-02-18 18:25:19,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a4011e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:19, skipping insertion in model container [2023-02-18 18:25:19,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 06:25:19" (1/1) ... [2023-02-18 18:25:19,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 18:25:19,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 18:25:19,320 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.c[526,539] [2023-02-18 18:25:19,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 18:25:19,355 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 18:25:19,370 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.c[526,539] [2023-02-18 18:25:19,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 18:25:19,393 INFO L208 MainTranslator]: Completed translation [2023-02-18 18:25:19,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:19 WrapperNode [2023-02-18 18:25:19,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 18:25:19,395 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 18:25:19,396 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 18:25:19,396 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 18:25:19,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:19" (1/1) ... [2023-02-18 18:25:19,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:19" (1/1) ... [2023-02-18 18:25:19,421 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2023-02-18 18:25:19,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 18:25:19,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 18:25:19,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 18:25:19,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 18:25:19,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:19" (1/1) ... [2023-02-18 18:25:19,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:19" (1/1) ... [2023-02-18 18:25:19,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:19" (1/1) ... [2023-02-18 18:25:19,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:19" (1/1) ... [2023-02-18 18:25:19,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:19" (1/1) ... [2023-02-18 18:25:19,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:19" (1/1) ... [2023-02-18 18:25:19,440 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:19" (1/1) ... [2023-02-18 18:25:19,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:19" (1/1) ... [2023-02-18 18:25:19,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 18:25:19,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 18:25:19,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 18:25:19,445 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 18:25:19,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:19" (1/1) ... [2023-02-18 18:25:19,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 18:25:19,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:25:19,473 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 18:25:19,486 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 18:25:19,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 18:25:19,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 18:25:19,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 18:25:19,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 18:25:19,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 18:25:19,516 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 18:25:19,566 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 18:25:19,568 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 18:25:19,668 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 18:25:19,673 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 18:25:19,674 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 18:25:19,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 06:25:19 BoogieIcfgContainer [2023-02-18 18:25:19,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 18:25:19,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 18:25:19,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 18:25:19,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 18:25:19,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 06:25:19" (1/3) ... [2023-02-18 18:25:19,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5264098c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 06:25:19, skipping insertion in model container [2023-02-18 18:25:19,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:19" (2/3) ... [2023-02-18 18:25:19,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5264098c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 06:25:19, skipping insertion in model container [2023-02-18 18:25:19,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 06:25:19" (3/3) ... [2023-02-18 18:25:19,683 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound2.c [2023-02-18 18:25:19,698 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 18:25:19,698 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 18:25:19,744 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 18:25:19,749 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;@3e25f450, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 18:25:19,749 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 18:25:19,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 18:25:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 18:25:19,757 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:19,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:19,758 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:19,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:19,763 INFO L85 PathProgramCache]: Analyzing trace with hash -586848446, now seen corresponding path program 1 times [2023-02-18 18:25:19,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:19,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843632734] [2023-02-18 18:25:19,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:19,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:19,887 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 18:25:19,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:19,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843632734] [2023-02-18 18:25:19,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843632734] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 18:25:19,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 18:25:19,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 18:25:19,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505543845] [2023-02-18 18:25:19,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:25:19,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 18:25:19,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:19,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 18:25:19,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 18:25:19,916 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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 18:25:19,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:19,932 INFO L93 Difference]: Finished difference Result 49 states and 83 transitions. [2023-02-18 18:25:19,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 18:25:19,934 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 18:25:19,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:19,939 INFO L225 Difference]: With dead ends: 49 [2023-02-18 18:25:19,939 INFO L226 Difference]: Without dead ends: 22 [2023-02-18 18:25:19,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 18:25:19,944 INFO L413 NwaCegarLoop]: 34 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, 34 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 18:25:19,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 18:25:19,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-18 18:25:19,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-18 18:25:19,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 18:25:19,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2023-02-18 18:25:19,972 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 9 [2023-02-18 18:25:19,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:19,972 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-02-18 18:25:19,972 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 18:25:19,973 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2023-02-18 18:25:19,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 18:25:19,973 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:19,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:19,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 18:25:19,974 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:19,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:19,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1188158916, now seen corresponding path program 1 times [2023-02-18 18:25:19,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:19,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939781482] [2023-02-18 18:25:19,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:19,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:20,149 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 18:25:20,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:20,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939781482] [2023-02-18 18:25:20,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939781482] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 18:25:20,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 18:25:20,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 18:25:20,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460668754] [2023-02-18 18:25:20,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:25:20,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 18:25:20,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:20,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 18:25:20,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 18:25:20,153 INFO L87 Difference]: Start difference. First operand 22 states and 30 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 18:25:20,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:20,196 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2023-02-18 18:25:20,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 18:25:20,196 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 18:25:20,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:20,197 INFO L225 Difference]: With dead ends: 35 [2023-02-18 18:25:20,198 INFO L226 Difference]: Without dead ends: 33 [2023-02-18 18:25:20,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 18:25:20,199 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 18:25:20,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 92 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 18:25:20,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-18 18:25:20,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2023-02-18 18:25:20,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 18:25:20,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-02-18 18:25:20,228 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2023-02-18 18:25:20,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:20,228 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-02-18 18:25:20,228 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 18:25:20,229 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-02-18 18:25:20,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 18:25:20,229 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:20,229 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:20,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 18:25:20,230 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:20,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:20,230 INFO L85 PathProgramCache]: Analyzing trace with hash -697944935, now seen corresponding path program 1 times [2023-02-18 18:25:20,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:20,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586046387] [2023-02-18 18:25:20,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:20,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:20,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-18 18:25:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 18:25:20,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:20,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586046387] [2023-02-18 18:25:20,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586046387] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 18:25:20,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 18:25:20,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 18:25:20,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753533508] [2023-02-18 18:25:20,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:25:20,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 18:25:20,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:20,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 18:25:20,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 18:25:20,326 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 18:25:20,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:20,374 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2023-02-18 18:25:20,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 18:25:20,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-02-18 18:25:20,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:20,375 INFO L225 Difference]: With dead ends: 39 [2023-02-18 18:25:20,375 INFO L226 Difference]: Without dead ends: 37 [2023-02-18 18:25:20,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 18:25:20,377 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 18:25:20,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 88 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 18:25:20,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-18 18:25:20,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2023-02-18 18:25:20,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 18:25:20,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-02-18 18:25:20,392 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2023-02-18 18:25:20,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:20,395 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-02-18 18:25:20,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 18:25:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-02-18 18:25:20,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 18:25:20,396 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:20,396 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:20,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 18:25:20,396 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:20,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:20,398 INFO L85 PathProgramCache]: Analyzing trace with hash 262992548, now seen corresponding path program 1 times [2023-02-18 18:25:20,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:20,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928343578] [2023-02-18 18:25:20,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:20,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:20,411 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:25:20,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [262629974] [2023-02-18 18:25:20,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:20,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:20,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:25:20,426 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 18:25:20,448 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 18:25:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:20,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 18:25:20,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:25:20,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 18:25:20,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:25:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 18:25:20,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:20,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928343578] [2023-02-18 18:25:20,674 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:25:20,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262629974] [2023-02-18 18:25:20,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262629974] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:25:20,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:25:20,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 18:25:20,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630635575] [2023-02-18 18:25:20,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:25:20,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 18:25:20,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:20,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 18:25:20,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 18:25:20,683 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 18:25:20,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:20,875 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2023-02-18 18:25:20,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 18:25:20,876 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 19 [2023-02-18 18:25:20,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:20,880 INFO L225 Difference]: With dead ends: 65 [2023-02-18 18:25:20,880 INFO L226 Difference]: Without dead ends: 51 [2023-02-18 18:25:20,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 18:25:20,888 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 30 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 18:25:20,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 48 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 18:25:20,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-18 18:25:20,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-18 18:25:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 33 states have internal predecessors, (35), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-02-18 18:25:20,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2023-02-18 18:25:20,910 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 19 [2023-02-18 18:25:20,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:20,911 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2023-02-18 18:25:20,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 18:25:20,912 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2023-02-18 18:25:20,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 18:25:20,913 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:20,913 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:20,922 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 18:25:21,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:21,120 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:21,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:21,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1807142342, now seen corresponding path program 1 times [2023-02-18 18:25:21,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:21,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469815163] [2023-02-18 18:25:21,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:21,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:21,142 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:25:21,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [145207103] [2023-02-18 18:25:21,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:21,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:21,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:25:21,146 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 18:25:21,160 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 18:25:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:21,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 18:25:21,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:25:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 18:25:21,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:25:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 18:25:21,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:21,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469815163] [2023-02-18 18:25:21,307 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:25:21,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145207103] [2023-02-18 18:25:21,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145207103] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:25:21,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:25:21,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-02-18 18:25:21,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320774289] [2023-02-18 18:25:21,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:25:21,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 18:25:21,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:21,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 18:25:21,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-18 18:25:21,315 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-18 18:25:21,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:21,455 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2023-02-18 18:25:21,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 18:25:21,456 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 26 [2023-02-18 18:25:21,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:21,459 INFO L225 Difference]: With dead ends: 66 [2023-02-18 18:25:21,459 INFO L226 Difference]: Without dead ends: 59 [2023-02-18 18:25:21,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-02-18 18:25:21,461 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 18:25:21,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 67 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 18:25:21,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-18 18:25:21,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2023-02-18 18:25:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 39 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-18 18:25:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2023-02-18 18:25:21,489 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 26 [2023-02-18 18:25:21,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:21,489 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2023-02-18 18:25:21,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-18 18:25:21,490 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2023-02-18 18:25:21,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-18 18:25:21,493 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:21,493 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:21,501 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 18:25:21,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:21,699 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:21,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:21,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1034157389, now seen corresponding path program 1 times [2023-02-18 18:25:21,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:21,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906955018] [2023-02-18 18:25:21,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:21,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:21,730 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:25:21,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [48845947] [2023-02-18 18:25:21,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:21,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:21,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:25:21,741 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 18:25:21,747 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 18:25:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:21,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-18 18:25:21,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:25:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-18 18:25:21,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:25:22,141 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-18 18:25:22,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:22,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906955018] [2023-02-18 18:25:22,142 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:25:22,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48845947] [2023-02-18 18:25:22,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48845947] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:25:22,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:25:22,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-18 18:25:22,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317008157] [2023-02-18 18:25:22,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:25:22,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 18:25:22,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:22,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 18:25:22,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-02-18 18:25:22,148 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2023-02-18 18:25:23,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:23,331 INFO L93 Difference]: Finished difference Result 142 states and 193 transitions. [2023-02-18 18:25:23,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 18:25:23,332 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) Word has length 56 [2023-02-18 18:25:23,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:23,333 INFO L225 Difference]: With dead ends: 142 [2023-02-18 18:25:23,333 INFO L226 Difference]: Without dead ends: 111 [2023-02-18 18:25:23,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-02-18 18:25:23,334 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 46 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-18 18:25:23,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 116 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-18 18:25:23,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-18 18:25:23,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2023-02-18 18:25:23,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 64 states have (on average 1.203125) internal successors, (77), 71 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (30), 24 states have call predecessors, (30), 30 states have call successors, (30) [2023-02-18 18:25:23,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 138 transitions. [2023-02-18 18:25:23,372 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 138 transitions. Word has length 56 [2023-02-18 18:25:23,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:23,372 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 138 transitions. [2023-02-18 18:25:23,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2023-02-18 18:25:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2023-02-18 18:25:23,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-18 18:25:23,379 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:23,379 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:23,388 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 18:25:23,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:23,580 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:23,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:23,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1199454569, now seen corresponding path program 1 times [2023-02-18 18:25:23,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:23,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155071656] [2023-02-18 18:25:23,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:23,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:23,604 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:25:23,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1670985163] [2023-02-18 18:25:23,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:23,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:23,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:25:23,612 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 18:25:23,615 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 18:25:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:23,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-18 18:25:23,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:25:23,741 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 19 proven. 37 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-18 18:25:23,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:25:23,961 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 19 proven. 37 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-18 18:25:23,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:23,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155071656] [2023-02-18 18:25:23,962 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:25:23,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670985163] [2023-02-18 18:25:23,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670985163] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:25:23,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:25:23,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-18 18:25:23,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690654173] [2023-02-18 18:25:23,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:25:23,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 18:25:23,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:23,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 18:25:23,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-02-18 18:25:23,968 INFO L87 Difference]: Start difference. First operand 106 states and 138 transitions. Second operand has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2023-02-18 18:25:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:25,034 INFO L93 Difference]: Finished difference Result 161 states and 210 transitions. [2023-02-18 18:25:25,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 18:25:25,034 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 67 [2023-02-18 18:25:25,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:25,035 INFO L225 Difference]: With dead ends: 161 [2023-02-18 18:25:25,036 INFO L226 Difference]: Without dead ends: 123 [2023-02-18 18:25:25,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 115 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2023-02-18 18:25:25,037 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 24 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-18 18:25:25,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 103 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-18 18:25:25,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-18 18:25:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 101. [2023-02-18 18:25:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 66 states have internal predecessors, (72), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2023-02-18 18:25:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 125 transitions. [2023-02-18 18:25:25,067 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 125 transitions. Word has length 67 [2023-02-18 18:25:25,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:25,067 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 125 transitions. [2023-02-18 18:25:25,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2023-02-18 18:25:25,068 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2023-02-18 18:25:25,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-18 18:25:25,069 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:25,069 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:25,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 18:25:25,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:25,275 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:25,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:25,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1728532070, now seen corresponding path program 1 times [2023-02-18 18:25:25,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:25,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959899384] [2023-02-18 18:25:25,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:25,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:25,284 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:25:25,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1601572570] [2023-02-18 18:25:25,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:25,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:25,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:25:25,286 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 18:25:25,293 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 18:25:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:25,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-18 18:25:25,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:25:25,381 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-18 18:25:25,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:25:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-18 18:25:25,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:25,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959899384] [2023-02-18 18:25:25,565 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:25:25,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601572570] [2023-02-18 18:25:25,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601572570] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:25:25,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:25:25,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-18 18:25:25,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282580119] [2023-02-18 18:25:25,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:25:25,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 18:25:25,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:25,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 18:25:25,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 18:25:25,567 INFO L87 Difference]: Start difference. First operand 101 states and 125 transitions. Second operand has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-18 18:25:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:25,770 INFO L93 Difference]: Finished difference Result 120 states and 144 transitions. [2023-02-18 18:25:25,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 18:25:25,771 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 72 [2023-02-18 18:25:25,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:25,772 INFO L225 Difference]: With dead ends: 120 [2023-02-18 18:25:25,772 INFO L226 Difference]: Without dead ends: 93 [2023-02-18 18:25:25,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-02-18 18:25:25,773 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 10 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 18:25:25,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 187 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 18:25:25,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-18 18:25:25,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-02-18 18:25:25,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 61 states have internal predecessors, (65), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-18 18:25:25,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2023-02-18 18:25:25,793 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 72 [2023-02-18 18:25:25,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:25,794 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2023-02-18 18:25:25,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-18 18:25:25,794 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2023-02-18 18:25:25,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-18 18:25:25,795 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:25,795 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:25,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-18 18:25:26,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:26,002 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:26,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:26,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1412721000, now seen corresponding path program 1 times [2023-02-18 18:25:26,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:26,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765916200] [2023-02-18 18:25:26,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:26,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:26,010 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:25:26,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1301706702] [2023-02-18 18:25:26,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:26,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:26,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:25:26,017 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 18:25:26,019 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 18:25:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:26,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 18:25:26,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:25:26,169 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2023-02-18 18:25:26,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 18:25:26,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:26,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765916200] [2023-02-18 18:25:26,170 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:25:26,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301706702] [2023-02-18 18:25:26,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301706702] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 18:25:26,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 18:25:26,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 18:25:26,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165719686] [2023-02-18 18:25:26,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:25:26,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 18:25:26,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:26,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 18:25:26,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-18 18:25:26,172 INFO L87 Difference]: Start difference. First operand 93 states and 110 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-02-18 18:25:26,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:26,294 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2023-02-18 18:25:26,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 18:25:26,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 86 [2023-02-18 18:25:26,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:26,295 INFO L225 Difference]: With dead ends: 125 [2023-02-18 18:25:26,295 INFO L226 Difference]: Without dead ends: 88 [2023-02-18 18:25:26,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 18:25:26,297 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 18:25:26,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 101 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 18:25:26,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-18 18:25:26,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2023-02-18 18:25:26,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 18 states have call successors, (18), 10 states have call predecessors, (18), 10 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-02-18 18:25:26,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2023-02-18 18:25:26,315 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 86 [2023-02-18 18:25:26,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:26,316 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2023-02-18 18:25:26,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-02-18 18:25:26,316 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2023-02-18 18:25:26,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-18 18:25:26,317 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:26,317 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:26,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 18:25:26,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:26,524 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:26,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:26,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1193302554, now seen corresponding path program 2 times [2023-02-18 18:25:26,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:26,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499055853] [2023-02-18 18:25:26,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:26,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:26,532 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:25:26,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2119707675] [2023-02-18 18:25:26,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 18:25:26,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:26,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:25:26,534 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 18:25:26,537 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 18:25:26,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 18:25:26,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 18:25:26,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-18 18:25:26,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:25:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-02-18 18:25:26,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:25:26,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:26,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499055853] [2023-02-18 18:25:26,904 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:25:26,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119707675] [2023-02-18 18:25:26,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119707675] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 18:25:26,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 18:25:26,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-18 18:25:26,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331389958] [2023-02-18 18:25:26,905 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 18:25:26,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 18:25:26,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:26,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 18:25:26,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-02-18 18:25:26,909 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-02-18 18:25:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:27,151 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2023-02-18 18:25:27,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 18:25:27,152 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 86 [2023-02-18 18:25:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:27,153 INFO L225 Difference]: With dead ends: 126 [2023-02-18 18:25:27,153 INFO L226 Difference]: Without dead ends: 77 [2023-02-18 18:25:27,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2023-02-18 18:25:27,154 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 38 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 18:25:27,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 105 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 18:25:27,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-18 18:25:27,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-02-18 18:25:27,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 50 states have internal predecessors, (50), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-18 18:25:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2023-02-18 18:25:27,174 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 86 [2023-02-18 18:25:27,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:27,174 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2023-02-18 18:25:27,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-02-18 18:25:27,175 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2023-02-18 18:25:27,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-02-18 18:25:27,175 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:27,176 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:27,187 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 18:25:27,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:27,384 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:27,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:27,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1373298297, now seen corresponding path program 2 times [2023-02-18 18:25:27,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:27,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385432344] [2023-02-18 18:25:27,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:27,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:27,404 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:25:27,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1887915443] [2023-02-18 18:25:27,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 18:25:27,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:27,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:25:27,406 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 18:25:27,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-18 18:25:27,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 18:25:27,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 18:25:27,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-18 18:25:27,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:25:27,553 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 36 proven. 57 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-02-18 18:25:27,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:25:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 36 proven. 57 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-02-18 18:25:28,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:28,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385432344] [2023-02-18 18:25:28,733 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:25:28,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887915443] [2023-02-18 18:25:28,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887915443] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:25:28,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:25:28,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2023-02-18 18:25:28,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827906264] [2023-02-18 18:25:28,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:25:28,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-18 18:25:28,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:28,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-18 18:25:28,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2023-02-18 18:25:28,736 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 21 states have internal predecessors, (44), 12 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (28), 10 states have call predecessors, (28), 12 states have call successors, (28) [2023-02-18 18:25:29,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:29,465 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2023-02-18 18:25:29,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 18:25:29,465 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 21 states have internal predecessors, (44), 12 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (28), 10 states have call predecessors, (28), 12 states have call successors, (28) Word has length 91 [2023-02-18 18:25:29,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:29,466 INFO L225 Difference]: With dead ends: 87 [2023-02-18 18:25:29,466 INFO L226 Difference]: Without dead ends: 82 [2023-02-18 18:25:29,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2023-02-18 18:25:29,467 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 18:25:29,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 163 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 18:25:29,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-18 18:25:29,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-02-18 18:25:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.0) internal successors, (54), 54 states have internal predecessors, (54), 16 states have call successors, (16), 12 states have call predecessors, (16), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-18 18:25:29,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2023-02-18 18:25:29,484 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 91 [2023-02-18 18:25:29,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:29,484 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2023-02-18 18:25:29,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 21 states have internal predecessors, (44), 12 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (28), 10 states have call predecessors, (28), 12 states have call successors, (28) [2023-02-18 18:25:29,485 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2023-02-18 18:25:29,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-02-18 18:25:29,486 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:29,497 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:29,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-18 18:25:29,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-18 18:25:29,704 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:29,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:29,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1231859808, now seen corresponding path program 1 times [2023-02-18 18:25:29,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:29,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182090019] [2023-02-18 18:25:29,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:29,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:29,712 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:25:29,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1835439914] [2023-02-18 18:25:29,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:29,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:29,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:25:29,714 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 18:25:29,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 18:25:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:29,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-18 18:25:29,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:25:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 29 proven. 71 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-02-18 18:25:29,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:25:31,198 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 29 proven. 71 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-02-18 18:25:31,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:31,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182090019] [2023-02-18 18:25:31,198 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:25:31,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835439914] [2023-02-18 18:25:31,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835439914] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:25:31,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:25:31,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2023-02-18 18:25:31,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024800457] [2023-02-18 18:25:31,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:25:31,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-18 18:25:31,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:31,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-18 18:25:31,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2023-02-18 18:25:31,201 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 20 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 19 states have internal predecessors, (46), 12 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 9 states have call predecessors, (30), 10 states have call successors, (30) [2023-02-18 18:25:31,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:31,780 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2023-02-18 18:25:31,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 18:25:31,780 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 19 states have internal predecessors, (46), 12 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 9 states have call predecessors, (30), 10 states have call successors, (30) Word has length 97 [2023-02-18 18:25:31,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:31,781 INFO L225 Difference]: With dead ends: 86 [2023-02-18 18:25:31,781 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 18:25:31,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 169 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2023-02-18 18:25:31,782 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 18:25:31,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 116 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 18:25:31,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 18:25:31,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 18:25:31,783 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 18:25:31,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 18:25:31,783 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2023-02-18 18:25:31,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:31,783 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 18:25:31,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 19 states have internal predecessors, (46), 12 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 9 states have call predecessors, (30), 10 states have call successors, (30) [2023-02-18 18:25:31,783 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 18:25:31,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 18:25:31,785 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 18:25:31,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-18 18:25:31,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:31,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 18:25:32,011 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2023-02-18 18:25:32,013 INFO L895 garLoopResultBuilder]: At program point L52-2(lines 44 56) the Hoare annotation is: (let ((.cse46 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse34 (mod |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse40 (= 0 .cse34)) (.cse43 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse48 (+ 1 .cse46)) (.cse58 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse47 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse57 (< |ULTIMATE.start_main_~d~0#1| 0))) (let ((.cse41 (not .cse57)) (.cse53 (* (+ |ULTIMATE.start_main_~q~0#1| .cse46) |ULTIMATE.start_main_~B~0#1|)) (.cse45 (and .cse58 (not .cse47))) (.cse51 (* (+ |ULTIMATE.start_main_~q~0#1| .cse48) |ULTIMATE.start_main_~B~0#1|)) (.cse49 (not .cse58)) (.cse54 (- .cse43)) (.cse42 (and .cse57 (not .cse40))) (.cse50 (- |ULTIMATE.start_main_~d~0#1|)) (.cse9 (<= |ULTIMATE.start_main_~A~0#1| 2)) (.cse26 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse36 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse56 (not (= 1 |ULTIMATE.start_main_~p~0#1|))) (.cse23 (* 2 1))) (let ((.cse0 (= |ULTIMATE.start_main_~d~0#1| .cse23)) (.cse11 (* |ULTIMATE.start_main_~B~0#1| 2)) (.cse4 (= |ULTIMATE.start_main_~p~0#1| .cse23)) (.cse10 (<= |ULTIMATE.start_main_~r~0#1| 2)) (.cse6 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse30 (or .cse36 .cse56)) (.cse25 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse5 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse24 (or (and .cse9 .cse26 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (or (not .cse9) (not .cse26)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse31 (or .cse56 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse1 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse29 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ |ULTIMATE.start_main_~r~0#1| .cse50)))) (.cse37 (or (let ((.cse55 (+ |ULTIMATE.start_main_~r~0#1| .cse54))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse53 .cse55)) .cse45) (or .cse47 (= |ULTIMATE.start_main_~A~0#1| (+ .cse51 .cse55)) .cse49))) .cse42)) (.cse7 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse38 (or (let ((.cse52 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse54)))) (and (or .cse47 (= |ULTIMATE.start_main_~A~0#1| (+ .cse51 .cse52)) .cse49) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse53 .cse52)) .cse45))) .cse40 .cse41)) (.cse8 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse3 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse27 (= (+ |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~p~0#1| (- 1))) 0)) (.cse22 (= |ULTIMATE.start_main_~d~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~d~0#1| .cse6)) (and .cse7 .cse1 .cse8 .cse2 .cse3) (let ((.cse15 (* |ULTIMATE.start_main_~r~0#1| (- 1)))) (let ((.cse21 (+ |ULTIMATE.start_main_~A~0#1| .cse15))) (and .cse9 .cse10 (<= .cse11 (+ |ULTIMATE.start_main_~r~0#1| .cse11)) .cse7 (or (exists ((|aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| Int)) (let ((.cse12 (* |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| (- 2)))) (let ((.cse14 (+ .cse12 2)) (.cse13 (+ .cse15 .cse12 2))) (and (<= .cse12 .cse13) (<= .cse14 .cse13) (<= .cse12 1) (<= .cse14 1) (<= 0 .cse13) (>= |ULTIMATE.start_main_~d~0#1| |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41|))))) (and (< 0 2) (exists ((|aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| Int)) (let ((.cse16 (* |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| (- 2)))) (let ((.cse17 (+ .cse15 .cse16 2))) (and (<= (+ .cse16 2) .cse17) (>= |ULTIMATE.start_main_~d~0#1| |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41|) (<= 0 .cse17) (<= (+ (* |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| (- 1)) 1) 0))))))) .cse3 (let ((.cse20 (= 0 (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2))) (.cse18 (div (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~r~0#1|)) 2)) (.cse19 (< .cse21 0))) (or (and (= |ULTIMATE.start_main_~d~0#1| .cse18) (or (not .cse19) .cse20)) (and (not .cse20) (= |ULTIMATE.start_main_~d~0#1| (+ 1 .cse18)) .cse19))) .cse22 (= (+ |ULTIMATE.start_main_~q~0#1| (* .cse23 (- 1))) 0) .cse24 .cse8 (or .cse25 (and (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse25)) .cse26 (= .cse21 .cse23)))) (let ((.cse28 (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) (and .cse0 .cse9 .cse10 (= |ULTIMATE.start_main_~p~0#1| 2) .cse3 .cse27 (<= .cse28 2) (= |ULTIMATE.start_main_~d~0#1| .cse11) .cse25 (>= |ULTIMATE.start_main_~d~0#1| 2) (<= .cse11 .cse28) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse29 .cse30 .cse24 .cse31 .cse26 .cse4 (= .cse28 |ULTIMATE.start_main_~A~0#1|))) (let ((.cse32 (div .cse50 (- 2))) (.cse33 (* 2 .cse23)) (.cse39 (+ 1 .cse43)) (.cse44 (and (or .cse45 (not (= 1 .cse46))) (or .cse47 (not (= 1 .cse48)) .cse49)))) (and .cse9 (<= 2 .cse32) .cse10 (>= |ULTIMATE.start_main_~r~0#1| .cse32) (>= |ULTIMATE.start_main_~r~0#1| .cse6) .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~d~0#1| .cse33) (= .cse34 0) (= |ULTIMATE.start_main_~p~0#1| .cse33) (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse6)) (let ((.cse35 (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse39 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse40 .cse41) (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse43 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)))) .cse44))) (or (and .cse29 .cse35 .cse36 .cse1 .cse37 .cse38 .cse2 .cse3 .cse25 .cse5) (and .cse29 .cse30 .cse35 .cse1 .cse37 .cse38 .cse2 .cse3 .cse25 .cse5))) (or (and (or .cse40 (= |ULTIMATE.start_main_~B~0#1| .cse39) .cse41) (or .cse42 (= |ULTIMATE.start_main_~B~0#1| .cse43))) .cse44) .cse24 .cse31 .cse26)) (and .cse1 .cse7 .cse8 .cse2 .cse3) (and .cse29 .cse37 .cse7 .cse38 .cse8 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~B~0#1|))) .cse3 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse50)) .cse27 (= (+ |ULTIMATE.start_main_~q~0#1| (* 1 (- 1))) 0) .cse22)))))) [2023-02-18 18:25:32,013 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2023-02-18 18:25:32,014 INFO L895 garLoopResultBuilder]: At program point L44-1(lines 44 56) the Hoare annotation is: (let ((.cse40 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse26 (= 0 (mod |ULTIMATE.start_main_~d~0#1| 2))) (.cse30 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse42 (+ 1 .cse40)) (.cse50 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse41 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse49 (< |ULTIMATE.start_main_~d~0#1| 0))) (let ((.cse28 (not .cse49)) (.cse46 (* (+ |ULTIMATE.start_main_~q~0#1| .cse40) |ULTIMATE.start_main_~B~0#1|)) (.cse39 (and .cse50 (not .cse41))) (.cse44 (* (+ |ULTIMATE.start_main_~q~0#1| .cse42) |ULTIMATE.start_main_~B~0#1|)) (.cse43 (not .cse50)) (.cse47 (- .cse30)) (.cse29 (and .cse49 (not .cse26))) (.cse34 (- |ULTIMATE.start_main_~d~0#1|))) (let ((.cse4 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse35 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ |ULTIMATE.start_main_~r~0#1| .cse34)))) (.cse36 (or (let ((.cse48 (+ |ULTIMATE.start_main_~r~0#1| .cse47))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse46 .cse48)) .cse39) (or .cse41 (= |ULTIMATE.start_main_~A~0#1| (+ .cse44 .cse48)) .cse43))) .cse29)) (.cse37 (or (let ((.cse45 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse47)))) (and (or .cse41 (= |ULTIMATE.start_main_~A~0#1| (+ .cse44 .cse45)) .cse43) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse46 .cse45)) .cse39))) .cse26 .cse28)) (.cse38 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse5 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse27 (+ 1 .cse30)) (.cse31 (and (or .cse39 (not (= 1 .cse40))) (or .cse41 (not (= 1 .cse42)) .cse43))) (.cse32 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)))) (let ((.cse1 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse18 (= |ULTIMATE.start_main_~d~0#1| 1)) (.cse23 (or (not (= 0 |ULTIMATE.start_main_~q~0#1|)) .cse32 (not (= 1 |ULTIMATE.start_main_~p~0#1|)))) (.cse20 (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse27 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse26 .cse28) (or .cse29 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse30 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)))) .cse31)) (.cse22 (or (and .cse35 .cse36 .cse37 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~B~0#1|))) .cse4 .cse38 (= (+ |ULTIMATE.start_main_~q~0#1| (* 1 (- 1))) 0) .cse5) (and .cse35 .cse38 .cse5) (and .cse35 .cse36 .cse37 .cse38 .cse5))) (.cse0 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| 0))) (let ((.cse2 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse25 (let ((.cse33 (or (and .cse35 .cse0 .cse36 .cse37 .cse3 .cse4 .cse38 .cse5) (and .cse35 .cse0 .cse3 .cse4 .cse38 .cse5)))) (or (and .cse20 .cse32 .cse33) (and .cse22 .cse1 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse34)) (= (+ |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~p~0#1| (- 1))) 0) .cse18) (and .cse20 .cse23 .cse33) (and .cse20 .cse22 .cse32)))) (.cse21 (or (and (or .cse26 (= |ULTIMATE.start_main_~B~0#1| .cse27) .cse28) (or .cse29 (= |ULTIMATE.start_main_~B~0#1| .cse30))) .cse31))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse11 (* |ULTIMATE.start_main_~r~0#1| (- 1)))) (let ((.cse6 (<= |ULTIMATE.start_main_~A~0#1| 2)) (.cse24 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse17 (+ |ULTIMATE.start_main_~A~0#1| .cse11)) (.cse19 (* 2 1))) (and .cse6 (<= |ULTIMATE.start_main_~r~0#1| 2) (let ((.cse7 (* |ULTIMATE.start_main_~B~0#1| 2))) (<= .cse7 (+ |ULTIMATE.start_main_~r~0#1| .cse7))) .cse1 (or (exists ((|aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| Int)) (let ((.cse8 (* |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| (- 2)))) (let ((.cse10 (+ .cse8 2)) (.cse9 (+ .cse11 .cse8 2))) (and (<= .cse8 .cse9) (<= .cse10 .cse9) (<= .cse8 1) (<= .cse10 1) (<= 0 .cse9) (>= |ULTIMATE.start_main_~d~0#1| |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41|))))) (and (< 0 2) (exists ((|aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| Int)) (let ((.cse12 (* |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| (- 2)))) (let ((.cse13 (+ .cse11 .cse12 2))) (and (<= (+ .cse12 2) .cse13) (>= |ULTIMATE.start_main_~d~0#1| |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41|) (<= 0 .cse13) (<= (+ (* |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| (- 1)) 1) 0))))))) .cse4 (let ((.cse16 (= 0 (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2))) (.cse14 (div (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~r~0#1|)) 2)) (.cse15 (< .cse17 0))) (or (and (= |ULTIMATE.start_main_~d~0#1| .cse14) (or (not .cse15) .cse16)) (and (not .cse16) (= |ULTIMATE.start_main_~d~0#1| (+ 1 .cse14)) .cse15))) .cse18 (= (+ |ULTIMATE.start_main_~q~0#1| (* .cse19 (- 1))) 0) (or (and .cse20 .cse21 .cse22 .cse23) (and .cse20 .cse21 .cse22 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse23)) (or (and .cse6 .cse24 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (or (not .cse6) (not .cse24)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) .cse2 .cse24 (= .cse17 .cse19)))) (and .cse1 .cse0 .cse2 .cse3 .cse4) (and .cse25 .cse1 .cse2 .cse4) (and .cse25 .cse21 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))))))))) [2023-02-18 18:25:32,014 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 61) the Hoare annotation is: true [2023-02-18 18:25:32,015 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~A~0#1| 2)) (.cse37 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse7 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|))) (let ((.cse39 (* 2 1)) (.cse13 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse33 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse32 (<= |ULTIMATE.start_main_~r~0#1| 2)) (.cse10 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse11 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse1 (or .cse7 (= (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~r~0#1|)) 0))) (.cse6 (= 0 |ULTIMATE.start_main_~q~0#1|)) (.cse36 (or (and .cse0 .cse37 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (or (not .cse0) (not .cse37)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))))) (or (let ((.cse35 (mod |ULTIMATE.start_main_~d~0#1| 2)) (.cse30 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse40 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse14 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2)))) (let ((.cse19 (and .cse40 (not .cse14))) (.cse29 (+ 1 .cse30)) (.cse17 (not .cse40)) (.cse21 (= 0 .cse35)) (.cse38 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse26 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse28 (- |ULTIMATE.start_main_~d~0#1|))) (let ((.cse31 (div .cse28 (- 2))) (.cse34 (* 2 .cse39)) (.cse25 (+ 1 .cse26)) (.cse22 (not .cse38)) (.cse24 (and .cse38 (not .cse21))) (.cse27 (and (or .cse19 (not (= 1 .cse30))) (or .cse14 (not (= 1 .cse29)) .cse17))) (.cse4 (not (= 1 |ULTIMATE.start_main_~p~0#1|)))) (and .cse0 (let ((.cse18 (* (+ |ULTIMATE.start_main_~q~0#1| .cse30) |ULTIMATE.start_main_~B~0#1|)) (.cse15 (* (+ |ULTIMATE.start_main_~q~0#1| .cse29) |ULTIMATE.start_main_~B~0#1|)) (.cse20 (- .cse26))) (let ((.cse2 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ |ULTIMATE.start_main_~r~0#1| .cse28)))) (.cse5 (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse25 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse21 .cse22) (or .cse24 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse26 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)))) .cse27)) (.cse3 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse8 (or (let ((.cse23 (+ |ULTIMATE.start_main_~r~0#1| .cse20))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse18 .cse23)) .cse19) (or .cse14 (= |ULTIMATE.start_main_~A~0#1| (+ .cse15 .cse23)) .cse17))) .cse24)) (.cse9 (or (let ((.cse16 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse20)))) (and (or .cse14 (= |ULTIMATE.start_main_~A~0#1| (+ .cse15 .cse16)) .cse17) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse18 .cse16)) .cse19))) .cse21 .cse22)) (.cse12 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|)))) (or (and .cse1 .cse2 (or .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse5 .cse6 .cse3 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) (<= 2 .cse31) .cse32 (>= |ULTIMATE.start_main_~r~0#1| .cse31) (>= |ULTIMATE.start_main_~r~0#1| .cse33) .cse7 .cse10 .cse11 (= |ULTIMATE.start_main_~d~0#1| .cse34) (= .cse35 0) (= |ULTIMATE.start_main_~p~0#1| .cse34) (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse33)) (or (and (or .cse21 (= |ULTIMATE.start_main_~B~0#1| .cse25) .cse22) (or .cse24 (= |ULTIMATE.start_main_~B~0#1| .cse26))) .cse27) .cse36 (or .cse4 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) .cse37)))) (let ((.cse41 (* |ULTIMATE.start_main_~B~0#1| 2))) (and (= |ULTIMATE.start_main_~d~0#1| .cse39) .cse0 .cse32 (= |ULTIMATE.start_main_~p~0#1| 2) .cse7 .cse10 .cse11 (= |ULTIMATE.start_main_~d~0#1| .cse41) (<= .cse41 (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse1 .cse6 .cse36 .cse37 (= |ULTIMATE.start_main_~p~0#1| .cse39) .cse13 (= |ULTIMATE.start_main_~d~0#1| .cse33))) (and .cse0 .cse32 (= |ULTIMATE.start_main_~p~0#1| 1) .cse7 .cse10 .cse11 (= |ULTIMATE.start_main_~d~0#1| 1) .cse1 .cse6 .cse36 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse37)))) [2023-02-18 18:25:32,015 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 18:25:32,015 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 18:25:32,016 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (let ((.cse46 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse34 (mod |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse40 (= 0 .cse34)) (.cse43 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse48 (+ 1 .cse46)) (.cse58 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse47 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse57 (< |ULTIMATE.start_main_~d~0#1| 0))) (let ((.cse41 (not .cse57)) (.cse53 (* (+ |ULTIMATE.start_main_~q~0#1| .cse46) |ULTIMATE.start_main_~B~0#1|)) (.cse45 (and .cse58 (not .cse47))) (.cse51 (* (+ |ULTIMATE.start_main_~q~0#1| .cse48) |ULTIMATE.start_main_~B~0#1|)) (.cse49 (not .cse58)) (.cse54 (- .cse43)) (.cse42 (and .cse57 (not .cse40))) (.cse50 (- |ULTIMATE.start_main_~d~0#1|)) (.cse9 (<= |ULTIMATE.start_main_~A~0#1| 2)) (.cse26 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse36 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse56 (not (= 1 |ULTIMATE.start_main_~p~0#1|))) (.cse23 (* 2 1))) (let ((.cse0 (= |ULTIMATE.start_main_~d~0#1| .cse23)) (.cse11 (* |ULTIMATE.start_main_~B~0#1| 2)) (.cse4 (= |ULTIMATE.start_main_~p~0#1| .cse23)) (.cse10 (<= |ULTIMATE.start_main_~r~0#1| 2)) (.cse6 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse30 (or .cse36 .cse56)) (.cse25 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse5 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse24 (or (and .cse9 .cse26 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (or (not .cse9) (not .cse26)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse31 (or .cse56 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse1 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse29 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ |ULTIMATE.start_main_~r~0#1| .cse50)))) (.cse37 (or (let ((.cse55 (+ |ULTIMATE.start_main_~r~0#1| .cse54))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse53 .cse55)) .cse45) (or .cse47 (= |ULTIMATE.start_main_~A~0#1| (+ .cse51 .cse55)) .cse49))) .cse42)) (.cse7 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse38 (or (let ((.cse52 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse54)))) (and (or .cse47 (= |ULTIMATE.start_main_~A~0#1| (+ .cse51 .cse52)) .cse49) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse53 .cse52)) .cse45))) .cse40 .cse41)) (.cse8 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse3 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse27 (= (+ |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~p~0#1| (- 1))) 0)) (.cse22 (= |ULTIMATE.start_main_~d~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~d~0#1| .cse6)) (and .cse7 .cse1 .cse8 .cse2 .cse3) (let ((.cse15 (* |ULTIMATE.start_main_~r~0#1| (- 1)))) (let ((.cse21 (+ |ULTIMATE.start_main_~A~0#1| .cse15))) (and .cse9 .cse10 (<= .cse11 (+ |ULTIMATE.start_main_~r~0#1| .cse11)) .cse7 (or (exists ((|aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| Int)) (let ((.cse12 (* |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| (- 2)))) (let ((.cse14 (+ .cse12 2)) (.cse13 (+ .cse15 .cse12 2))) (and (<= .cse12 .cse13) (<= .cse14 .cse13) (<= .cse12 1) (<= .cse14 1) (<= 0 .cse13) (>= |ULTIMATE.start_main_~d~0#1| |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41|))))) (and (< 0 2) (exists ((|aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| Int)) (let ((.cse16 (* |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| (- 2)))) (let ((.cse17 (+ .cse15 .cse16 2))) (and (<= (+ .cse16 2) .cse17) (>= |ULTIMATE.start_main_~d~0#1| |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41|) (<= 0 .cse17) (<= (+ (* |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| (- 1)) 1) 0))))))) .cse3 (let ((.cse20 (= 0 (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2))) (.cse18 (div (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~r~0#1|)) 2)) (.cse19 (< .cse21 0))) (or (and (= |ULTIMATE.start_main_~d~0#1| .cse18) (or (not .cse19) .cse20)) (and (not .cse20) (= |ULTIMATE.start_main_~d~0#1| (+ 1 .cse18)) .cse19))) .cse22 (= (+ |ULTIMATE.start_main_~q~0#1| (* .cse23 (- 1))) 0) .cse24 .cse8 (or .cse25 (and (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse25)) .cse26 (= .cse21 .cse23)))) (let ((.cse28 (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) (and .cse0 .cse9 .cse10 (= |ULTIMATE.start_main_~p~0#1| 2) .cse3 .cse27 (<= .cse28 2) (= |ULTIMATE.start_main_~d~0#1| .cse11) .cse25 (>= |ULTIMATE.start_main_~d~0#1| 2) (<= .cse11 .cse28) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse29 .cse30 .cse24 .cse31 .cse26 .cse4 (= .cse28 |ULTIMATE.start_main_~A~0#1|))) (let ((.cse32 (div .cse50 (- 2))) (.cse33 (* 2 .cse23)) (.cse39 (+ 1 .cse43)) (.cse44 (and (or .cse45 (not (= 1 .cse46))) (or .cse47 (not (= 1 .cse48)) .cse49)))) (and .cse9 (<= 2 .cse32) .cse10 (>= |ULTIMATE.start_main_~r~0#1| .cse32) (>= |ULTIMATE.start_main_~r~0#1| .cse6) .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~d~0#1| .cse33) (= .cse34 0) (= |ULTIMATE.start_main_~p~0#1| .cse33) (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse6)) (let ((.cse35 (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse39 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse40 .cse41) (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse43 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)))) .cse44))) (or (and .cse29 .cse35 .cse36 .cse1 .cse37 .cse38 .cse2 .cse3 .cse25 .cse5) (and .cse29 .cse30 .cse35 .cse1 .cse37 .cse38 .cse2 .cse3 .cse25 .cse5))) (or (and (or .cse40 (= |ULTIMATE.start_main_~B~0#1| .cse39) .cse41) (or .cse42 (= |ULTIMATE.start_main_~B~0#1| .cse43))) .cse44) .cse24 .cse31 .cse26)) (and .cse1 .cse7 .cse8 .cse2 .cse3) (and .cse29 .cse37 .cse7 .cse38 .cse8 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~B~0#1|))) .cse3 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse50)) .cse27 (= (+ |ULTIMATE.start_main_~q~0#1| (* 1 (- 1))) 0) .cse22)))))) [2023-02-18 18:25:32,016 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-02-18 18:25:32,017 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse31 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse13 (mod |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse22 (= 0 .cse13)) (.cse25 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse33 (+ 1 .cse31)) (.cse59 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse32 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse58 (< |ULTIMATE.start_main_~d~0#1| 0))) (let ((.cse23 (not .cse58)) (.cse55 (* (+ |ULTIMATE.start_main_~q~0#1| .cse31) |ULTIMATE.start_main_~B~0#1|)) (.cse30 (and .cse59 (not .cse32))) (.cse53 (* (+ |ULTIMATE.start_main_~q~0#1| .cse33) |ULTIMATE.start_main_~B~0#1|)) (.cse34 (not .cse59)) (.cse56 (- .cse25)) (.cse24 (and .cse58 (not .cse22))) (.cse36 (- |ULTIMATE.start_main_~d~0#1|)) (.cse9 (<= |ULTIMATE.start_main_~A~0#1| 2)) (.cse29 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse16 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse52 (not (= 1 |ULTIMATE.start_main_~p~0#1|))) (.cse35 (* 2 1))) (let ((.cse6 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse5 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse0 (= |ULTIMATE.start_main_~d~0#1| .cse35)) (.cse20 (or .cse16 .cse52)) (.cse28 (or .cse52 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse4 (= |ULTIMATE.start_main_~p~0#1| .cse35)) (.cse1 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse11 (<= |ULTIMATE.start_main_~r~0#1| 2)) (.cse39 (* |ULTIMATE.start_main_~B~0#1| 2)) (.cse27 (or (and .cse9 .cse29 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (or (not .cse9) (not .cse29)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse14 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ |ULTIMATE.start_main_~r~0#1| .cse36)))) (.cse17 (or (let ((.cse57 (+ |ULTIMATE.start_main_~r~0#1| .cse56))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse55 .cse57)) .cse30) (or .cse32 (= |ULTIMATE.start_main_~A~0#1| (+ .cse53 .cse57)) .cse34))) .cse24)) (.cse7 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse18 (or (let ((.cse54 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse56)))) (and (or .cse32 (= |ULTIMATE.start_main_~A~0#1| (+ .cse53 .cse54)) .cse34) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse55 .cse54)) .cse30))) .cse22 .cse23)) (.cse8 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse3 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse37 (= (+ |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~p~0#1| (- 1))) 0)) (.cse19 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse50 (= |ULTIMATE.start_main_~d~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~d~0#1| .cse6)) (and .cse7 .cse1 .cse8 .cse2 .cse3) (let ((.cse10 (div .cse36 (- 2))) (.cse12 (* 2 .cse35)) (.cse21 (+ 1 .cse25)) (.cse26 (and (or .cse30 (not (= 1 .cse31))) (or .cse32 (not (= 1 .cse33)) .cse34)))) (and .cse9 (<= 2 .cse10) .cse11 (>= |ULTIMATE.start_main_~r~0#1| .cse10) (>= |ULTIMATE.start_main_~r~0#1| .cse6) .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~d~0#1| .cse12) (= .cse13 0) (= |ULTIMATE.start_main_~p~0#1| .cse12) (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse6)) (let ((.cse15 (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse21 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse22 .cse23) (or .cse24 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse25 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)))) .cse26))) (or (and .cse14 .cse15 .cse16 .cse1 .cse17 .cse18 .cse2 .cse3 .cse19 .cse5) (and .cse14 .cse20 .cse15 .cse1 .cse17 .cse18 .cse2 .cse3 .cse19 .cse5))) (or (and (or .cse22 (= |ULTIMATE.start_main_~B~0#1| .cse21) .cse23) (or .cse24 (= |ULTIMATE.start_main_~B~0#1| .cse25))) .cse26) .cse27 .cse28 .cse29)) (let ((.cse38 (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) (and .cse0 .cse9 .cse11 (= |ULTIMATE.start_main_~p~0#1| 2) .cse3 .cse37 (<= .cse38 2) (= |ULTIMATE.start_main_~d~0#1| .cse39) .cse19 (>= |ULTIMATE.start_main_~d~0#1| 2) (<= .cse39 .cse38) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse14 .cse20 .cse27 .cse28 .cse29 .cse4 (= .cse38 |ULTIMATE.start_main_~A~0#1|))) (and .cse1 .cse7 .cse8 .cse2 .cse3) (let ((.cse43 (* |ULTIMATE.start_main_~r~0#1| (- 1)))) (let ((.cse49 (+ |ULTIMATE.start_main_~A~0#1| .cse43))) (and .cse9 .cse11 (<= .cse39 (+ |ULTIMATE.start_main_~r~0#1| .cse39)) .cse7 (or (exists ((|aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| Int)) (let ((.cse40 (* |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| (- 2)))) (let ((.cse42 (+ .cse40 2)) (.cse41 (+ .cse43 .cse40 2))) (and (<= .cse40 .cse41) (<= .cse42 .cse41) (<= .cse40 1) (<= .cse42 1) (<= 0 .cse41) (>= |ULTIMATE.start_main_~d~0#1| |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41|))))) (and (< 0 2) (exists ((|aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| Int)) (let ((.cse44 (* |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| (- 2)))) (let ((.cse45 (+ .cse43 .cse44 2))) (and (<= (+ .cse44 2) .cse45) (>= |ULTIMATE.start_main_~d~0#1| |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41|) (<= 0 .cse45) (<= (+ (* |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| (- 1)) 1) 0))))))) .cse3 (let ((.cse48 (= 0 (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2))) (.cse46 (div (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~r~0#1|)) 2)) (.cse47 (< .cse49 0))) (or (and (= |ULTIMATE.start_main_~d~0#1| .cse46) (or (not .cse47) .cse48)) (and (not .cse48) (= |ULTIMATE.start_main_~d~0#1| (+ 1 .cse46)) .cse47))) .cse50 (= (+ |ULTIMATE.start_main_~q~0#1| (* .cse35 (- 1))) 0) .cse27 (let ((.cse51 (or (not (= 0 |ULTIMATE.start_main_~q~0#1|)) .cse16 .cse52))) (or (and .cse51 .cse19) (and (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse51 .cse19))) .cse8 .cse29 (= .cse49 .cse35)))) (and .cse14 .cse17 .cse7 .cse18 .cse8 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~B~0#1|))) .cse3 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse36)) .cse37 .cse19 (= (+ |ULTIMATE.start_main_~q~0#1| (* 1 (- 1))) 0) .cse50)))))) [2023-02-18 18:25:32,017 INFO L899 garLoopResultBuilder]: For program point L37(lines 34 42) no Hoare annotation was computed. [2023-02-18 18:25:32,017 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 18:25:32,018 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse39 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse42 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse30 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2)))) (let ((.cse35 (and .cse42 (not .cse30))) (.cse38 (+ 1 .cse39)) (.cse33 (not .cse42)) (.cse19 (= 0 (mod |ULTIMATE.start_main_~d~0#1| 2))) (.cse40 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse22 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse27 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse2 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse5 (= |ULTIMATE.start_main_~B~0#1| 1))) (let ((.cse1 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse17 (= |ULTIMATE.start_main_~d~0#1| 1)) (.cse0 (let ((.cse41 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|)))) (or (and .cse27 .cse41) (and .cse2 .cse4 .cse5 .cse41)))) (.cse18 (+ 1 .cse22)) (.cse20 (not .cse40)) (.cse21 (and .cse40 (not .cse19))) (.cse23 (and (or .cse35 (not (= 1 .cse39))) (or .cse30 (not (= 1 .cse38)) .cse33)))) (let ((.cse7 (or (and (or .cse19 (= |ULTIMATE.start_main_~B~0#1| .cse18) .cse20) (or .cse21 (= |ULTIMATE.start_main_~B~0#1| .cse22))) .cse23)) (.cse6 (let ((.cse25 (- |ULTIMATE.start_main_~d~0#1|))) (let ((.cse24 (let ((.cse34 (* (+ |ULTIMATE.start_main_~q~0#1| .cse39) |ULTIMATE.start_main_~B~0#1|)) (.cse31 (* (+ |ULTIMATE.start_main_~q~0#1| .cse38) |ULTIMATE.start_main_~B~0#1|)) (.cse36 (- .cse22))) (let ((.cse26 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ |ULTIMATE.start_main_~r~0#1| .cse25)))) (.cse28 (or (let ((.cse37 (+ |ULTIMATE.start_main_~r~0#1| .cse36))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse34 .cse37)) .cse35) (or .cse30 (= |ULTIMATE.start_main_~A~0#1| (+ .cse31 .cse37)) .cse33))) .cse21)) (.cse29 (or (let ((.cse32 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse36)))) (and (or .cse30 (= |ULTIMATE.start_main_~A~0#1| (+ .cse31 .cse32)) .cse33) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse34 .cse32)) .cse35))) .cse19 .cse20))) (or (and .cse26 .cse0 .cse27) (and .cse26 .cse0 .cse28 .cse29 .cse27) (and .cse26 .cse0 .cse28 .cse29 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~B~0#1|))) .cse5 (= (+ |ULTIMATE.start_main_~q~0#1| (* 1 (- 1))) 0))))))) (or (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse18 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse19 .cse20) (or .cse21 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse22 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)))) .cse23) (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse24) (and .cse1 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse25)) (= (+ |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~p~0#1| (- 1))) 0) .cse17 .cse24))))) (.cse3 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse3 .cse6 .cse5) (and .cse1 .cse3 .cse4 .cse5) (and .cse7 .cse6 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (let ((.cse8 (<= |ULTIMATE.start_main_~A~0#1| 2)) (.cse10 (>= |ULTIMATE.start_main_~A~0#1| 0))) (and .cse8 (or (and .cse7 .cse6 (<= 1 |ULTIMATE.start_main_~d~0#1|)) (and .cse7 .cse6)) (<= |ULTIMATE.start_main_~r~0#1| 2) (let ((.cse9 (* |ULTIMATE.start_main_~B~0#1| 2))) (<= .cse9 (+ |ULTIMATE.start_main_~r~0#1| .cse9))) (or (and .cse8 .cse10 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (or (not .cse8) (not .cse10)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) .cse1 .cse3 (let ((.cse14 (* |ULTIMATE.start_main_~r~0#1| (- 1)))) (or (exists ((|aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| Int)) (let ((.cse11 (* |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| (- 2)))) (let ((.cse13 (+ .cse11 2)) (.cse12 (+ .cse14 .cse11 2))) (and (<= .cse11 .cse12) (<= .cse13 .cse12) (<= .cse11 1) (<= .cse13 1) (<= 0 .cse12) (>= |ULTIMATE.start_main_~d~0#1| |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41|))))) (and (< 0 2) (exists ((|aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| Int)) (let ((.cse15 (* |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| (- 2)))) (let ((.cse16 (+ .cse14 .cse15 2))) (and (<= (+ .cse15 2) .cse16) (>= |ULTIMATE.start_main_~d~0#1| |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41|) (<= 0 .cse16) (<= (+ (* |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| (- 1)) 1) 0)))))))) .cse5 .cse10 .cse17))))))) [2023-02-18 18:25:32,018 INFO L899 garLoopResultBuilder]: For program point L46(lines 44 56) no Hoare annotation was computed. [2023-02-18 18:25:32,018 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 18:25:32,018 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 42) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_main_~A~0#1| 2)) (.cse10 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|))) (let ((.cse11 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse12 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse0 (* 2 1)) (.cse2 (<= |ULTIMATE.start_main_~r~0#1| 2)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse5 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse7 (or .cse3 (= (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~r~0#1|)) 0))) (.cse8 (= 0 |ULTIMATE.start_main_~q~0#1|)) (.cse9 (or (and .cse1 .cse10 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (or (not .cse1) (not .cse10)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))))) (or (let ((.cse6 (* |ULTIMATE.start_main_~B~0#1| 2))) (and (= |ULTIMATE.start_main_~d~0#1| .cse0) .cse1 .cse2 (= |ULTIMATE.start_main_~p~0#1| 2) .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~d~0#1| .cse6) (<= .cse6 (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~p~0#1| .cse0) .cse11 (= |ULTIMATE.start_main_~d~0#1| .cse12))) (let ((.cse39 (mod |ULTIMATE.start_main_~d~0#1| 2)) (.cse36 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse41 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse20 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2)))) (let ((.cse25 (and .cse41 (not .cse20))) (.cse35 (+ 1 .cse36)) (.cse23 (not .cse41)) (.cse27 (= 0 .cse39)) (.cse40 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse32 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse34 (- |ULTIMATE.start_main_~d~0#1|))) (let ((.cse37 (div .cse34 (- 2))) (.cse38 (* 2 .cse0)) (.cse31 (+ 1 .cse32)) (.cse28 (not .cse40)) (.cse30 (and .cse40 (not .cse27))) (.cse33 (and (or .cse25 (not (= 1 .cse36))) (or .cse20 (not (= 1 .cse35)) .cse23))) (.cse15 (not (= 1 |ULTIMATE.start_main_~p~0#1|)))) (and .cse1 (let ((.cse24 (* (+ |ULTIMATE.start_main_~q~0#1| .cse36) |ULTIMATE.start_main_~B~0#1|)) (.cse21 (* (+ |ULTIMATE.start_main_~q~0#1| .cse35) |ULTIMATE.start_main_~B~0#1|)) (.cse26 (- .cse32))) (let ((.cse13 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ |ULTIMATE.start_main_~r~0#1| .cse34)))) (.cse16 (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse31 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse27 .cse28) (or .cse30 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse32 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)))) .cse33)) (.cse14 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse17 (or (let ((.cse29 (+ |ULTIMATE.start_main_~r~0#1| .cse26))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse24 .cse29)) .cse25) (or .cse20 (= |ULTIMATE.start_main_~A~0#1| (+ .cse21 .cse29)) .cse23))) .cse30)) (.cse18 (or (let ((.cse22 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse26)))) (and (or .cse20 (= |ULTIMATE.start_main_~A~0#1| (+ .cse21 .cse22)) .cse23) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse24 .cse22)) .cse25))) .cse27 .cse28)) (.cse19 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|)))) (or (and .cse7 .cse13 (or .cse14 .cse15) .cse16 .cse8 .cse3 .cse17 .cse18 .cse4 .cse5 .cse19 .cse11) (and .cse7 .cse13 .cse16 .cse8 .cse14 .cse3 .cse17 .cse18 .cse4 .cse5 .cse19 .cse11)))) (<= 2 .cse37) .cse2 (>= |ULTIMATE.start_main_~r~0#1| .cse37) (>= |ULTIMATE.start_main_~r~0#1| .cse12) .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~d~0#1| .cse38) (= .cse39 0) (= |ULTIMATE.start_main_~p~0#1| .cse38) (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse12)) (or (and (or .cse27 (= |ULTIMATE.start_main_~B~0#1| .cse31) .cse28) (or .cse30 (= |ULTIMATE.start_main_~B~0#1| .cse32))) .cse33) .cse9 (or .cse15 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) .cse10)))) (and .cse1 .cse2 (= |ULTIMATE.start_main_~p~0#1| 1) .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~d~0#1| 1) .cse7 .cse8 .cse9 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse10)))) [2023-02-18 18:25:32,019 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-02-18 18:25:32,019 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_main_~A~0#1| 2)) (.cse10 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|))) (let ((.cse11 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse12 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse0 (* 2 1)) (.cse2 (<= |ULTIMATE.start_main_~r~0#1| 2)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse5 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse7 (or .cse3 (= (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~r~0#1|)) 0))) (.cse8 (= 0 |ULTIMATE.start_main_~q~0#1|)) (.cse9 (or (and .cse1 .cse10 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (or (not .cse1) (not .cse10)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))))) (or (let ((.cse6 (* |ULTIMATE.start_main_~B~0#1| 2))) (and (= |ULTIMATE.start_main_~d~0#1| .cse0) .cse1 .cse2 (= |ULTIMATE.start_main_~p~0#1| 2) .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~d~0#1| .cse6) (<= .cse6 (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~p~0#1| .cse0) .cse11 (= |ULTIMATE.start_main_~d~0#1| .cse12))) (let ((.cse39 (mod |ULTIMATE.start_main_~d~0#1| 2)) (.cse36 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse41 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse20 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2)))) (let ((.cse25 (and .cse41 (not .cse20))) (.cse35 (+ 1 .cse36)) (.cse23 (not .cse41)) (.cse27 (= 0 .cse39)) (.cse40 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse32 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse34 (- |ULTIMATE.start_main_~d~0#1|))) (let ((.cse37 (div .cse34 (- 2))) (.cse38 (* 2 .cse0)) (.cse31 (+ 1 .cse32)) (.cse28 (not .cse40)) (.cse30 (and .cse40 (not .cse27))) (.cse33 (and (or .cse25 (not (= 1 .cse36))) (or .cse20 (not (= 1 .cse35)) .cse23))) (.cse15 (not (= 1 |ULTIMATE.start_main_~p~0#1|)))) (and .cse1 (let ((.cse24 (* (+ |ULTIMATE.start_main_~q~0#1| .cse36) |ULTIMATE.start_main_~B~0#1|)) (.cse21 (* (+ |ULTIMATE.start_main_~q~0#1| .cse35) |ULTIMATE.start_main_~B~0#1|)) (.cse26 (- .cse32))) (let ((.cse13 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ |ULTIMATE.start_main_~r~0#1| .cse34)))) (.cse16 (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse31 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse27 .cse28) (or .cse30 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse32 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)))) .cse33)) (.cse14 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse17 (or (let ((.cse29 (+ |ULTIMATE.start_main_~r~0#1| .cse26))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse24 .cse29)) .cse25) (or .cse20 (= |ULTIMATE.start_main_~A~0#1| (+ .cse21 .cse29)) .cse23))) .cse30)) (.cse18 (or (let ((.cse22 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse26)))) (and (or .cse20 (= |ULTIMATE.start_main_~A~0#1| (+ .cse21 .cse22)) .cse23) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse24 .cse22)) .cse25))) .cse27 .cse28)) (.cse19 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|)))) (or (and .cse7 .cse13 (or .cse14 .cse15) .cse16 .cse8 .cse3 .cse17 .cse18 .cse4 .cse5 .cse19 .cse11) (and .cse7 .cse13 .cse16 .cse8 .cse14 .cse3 .cse17 .cse18 .cse4 .cse5 .cse19 .cse11)))) (<= 2 .cse37) .cse2 (>= |ULTIMATE.start_main_~r~0#1| .cse37) (>= |ULTIMATE.start_main_~r~0#1| .cse12) .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~d~0#1| .cse38) (= .cse39 0) (= |ULTIMATE.start_main_~p~0#1| .cse38) (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse12)) (or (and (or .cse27 (= |ULTIMATE.start_main_~B~0#1| .cse31) .cse28) (or .cse30 (= |ULTIMATE.start_main_~B~0#1| .cse32))) .cse33) .cse9 (or .cse15 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) .cse10)))) (and .cse1 .cse2 (= |ULTIMATE.start_main_~p~0#1| 1) .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~d~0#1| 1) .cse7 .cse8 .cse9 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse10)))) [2023-02-18 18:25:32,020 INFO L895 garLoopResultBuilder]: At program point L35-1(line 35) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_main_~A~0#1| 2)) (.cse10 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|))) (let ((.cse11 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse12 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse0 (* 2 1)) (.cse2 (<= |ULTIMATE.start_main_~r~0#1| 2)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse5 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse7 (or .cse3 (= (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~r~0#1|)) 0))) (.cse8 (= 0 |ULTIMATE.start_main_~q~0#1|)) (.cse9 (or (and .cse1 .cse10 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (or (not .cse1) (not .cse10)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))))) (or (let ((.cse6 (* |ULTIMATE.start_main_~B~0#1| 2))) (and (= |ULTIMATE.start_main_~d~0#1| .cse0) .cse1 .cse2 (= |ULTIMATE.start_main_~p~0#1| 2) .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~d~0#1| .cse6) (<= .cse6 (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~p~0#1| .cse0) .cse11 (= |ULTIMATE.start_main_~d~0#1| .cse12))) (let ((.cse39 (mod |ULTIMATE.start_main_~d~0#1| 2)) (.cse36 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse41 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse20 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2)))) (let ((.cse25 (and .cse41 (not .cse20))) (.cse35 (+ 1 .cse36)) (.cse23 (not .cse41)) (.cse27 (= 0 .cse39)) (.cse40 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse32 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse34 (- |ULTIMATE.start_main_~d~0#1|))) (let ((.cse37 (div .cse34 (- 2))) (.cse38 (* 2 .cse0)) (.cse31 (+ 1 .cse32)) (.cse28 (not .cse40)) (.cse30 (and .cse40 (not .cse27))) (.cse33 (and (or .cse25 (not (= 1 .cse36))) (or .cse20 (not (= 1 .cse35)) .cse23))) (.cse15 (not (= 1 |ULTIMATE.start_main_~p~0#1|)))) (and .cse1 (let ((.cse24 (* (+ |ULTIMATE.start_main_~q~0#1| .cse36) |ULTIMATE.start_main_~B~0#1|)) (.cse21 (* (+ |ULTIMATE.start_main_~q~0#1| .cse35) |ULTIMATE.start_main_~B~0#1|)) (.cse26 (- .cse32))) (let ((.cse13 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ |ULTIMATE.start_main_~r~0#1| .cse34)))) (.cse16 (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse31 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse27 .cse28) (or .cse30 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse32 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)))) .cse33)) (.cse14 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse17 (or (let ((.cse29 (+ |ULTIMATE.start_main_~r~0#1| .cse26))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse24 .cse29)) .cse25) (or .cse20 (= |ULTIMATE.start_main_~A~0#1| (+ .cse21 .cse29)) .cse23))) .cse30)) (.cse18 (or (let ((.cse22 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse26)))) (and (or .cse20 (= |ULTIMATE.start_main_~A~0#1| (+ .cse21 .cse22)) .cse23) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse24 .cse22)) .cse25))) .cse27 .cse28)) (.cse19 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|)))) (or (and .cse7 .cse13 (or .cse14 .cse15) .cse16 .cse8 .cse3 .cse17 .cse18 .cse4 .cse5 .cse19 .cse11) (and .cse7 .cse13 .cse16 .cse8 .cse14 .cse3 .cse17 .cse18 .cse4 .cse5 .cse19 .cse11)))) (<= 2 .cse37) .cse2 (>= |ULTIMATE.start_main_~r~0#1| .cse37) (>= |ULTIMATE.start_main_~r~0#1| .cse12) .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~d~0#1| .cse38) (= .cse39 0) (= |ULTIMATE.start_main_~p~0#1| .cse38) (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse12)) (or (and (or .cse27 (= |ULTIMATE.start_main_~B~0#1| .cse31) .cse28) (or .cse30 (= |ULTIMATE.start_main_~B~0#1| .cse32))) .cse33) .cse9 (or .cse15 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) .cse10)))) (and .cse1 .cse2 (= |ULTIMATE.start_main_~p~0#1| 1) .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~d~0#1| 1) .cse7 .cse8 .cse9 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse10)))) [2023-02-18 18:25:32,020 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-02-18 18:25:32,020 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-02-18 18:25:32,020 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-02-18 18:25:32,020 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-02-18 18:25:32,020 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-02-18 18:25:32,020 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-18 18:25:32,023 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:32,025 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 18:25:32,033 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,034 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,034 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,034 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,034 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,034 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,035 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,035 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,035 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,035 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,036 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,036 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,036 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,049 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,050 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,050 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,050 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,050 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,050 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,051 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,051 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,051 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,051 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,051 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,052 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,052 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 06:25:32 BoogieIcfgContainer [2023-02-18 18:25:32,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 18:25:32,063 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 18:25:32,064 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 18:25:32,064 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 18:25:32,064 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 06:25:19" (3/4) ... [2023-02-18 18:25:32,067 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 18:25:32,076 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 18:25:32,079 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-02-18 18:25:32,079 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-02-18 18:25:32,079 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-02-18 18:25:32,080 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 18:25:32,080 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 18:25:32,099 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((d == 2 * 1 && r == A) && q == 0) && B == 1) && p == 2 * 1) && d == B * p) && d == 2 * B) || ((((p == 1 && r == A) && d == B) && q == 0) && B == 1)) || (((((((((((((A <= 2 && r <= 2) && B * 2 <= r + B * 2) && p == 1) && ((\exists aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 : int :: ((((aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 <= r * -1 + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 + 2 && aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 + 2 <= r * -1 + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 + 2) && aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 <= 1) && aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 + 2 <= 1) && 0 <= r * -1 + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 + 2) && d >= aux_div_v_ULTIMATE.start_main_~d~0#1_42_41) || (0 < 2 && (\exists aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 : int :: ((aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 + 2 <= r * -1 + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 + 2 && d >= aux_div_v_ULTIMATE.start_main_~d~0#1_42_41) && 0 <= r * -1 + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 + 2) && aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -1 + 1 <= 0)))) && B == 1) && ((d == (A + -r) / 2 && (!(A + r * -1 < 0) || 0 == (A + r) % 2)) || ((!(0 == (A + r) % 2) && d == 1 + (A + -r) / 2) && A + r * -1 < 0))) && d == 1) && q + 2 * 1 * -1 == 0) && (((A <= 2 && A >= 0) && cond == 1) || ((!(A <= 2) || !(A >= 0)) && cond == 0))) && d == B) && (A == q * B + r || (1 <= d && A == q * B + r))) && A >= 0) && A + r * -1 == 2 * 1)) || ((((((((((((((((((d == 2 * 1 && A <= 2) && r <= 2) && p == 2) && B == 1) && q + p * -1 == 0) && r + d <= 2) && d == B * 2) && A == q * B + r) && d >= 2) && B * 2 <= r + d) && 2 <= d) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && (((A <= 2 && A >= 0) && cond == 1) || ((!(A <= 2) || !(A >= 0)) && cond == 0))) && (!(1 == p) || B == d)) && A >= 0) && p == 2 * 1) && r + d == A)) || ((((((((((((((((A <= 2 && 2 <= -d / -2) && r <= 2) && r >= -d / -2) && r >= 2 * B) && r == A) && q == 0) && B == 1) && d == 2 * (2 * 1)) && d % 2 == 0) && p == 2 * (2 * 1)) && d == 2 * (2 * B)) && ((((((((((A == (q + p) * B + (r + -d) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || (((((((((A == (q + p) * B + (r + -d) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((A <= 2 && A >= 0) && cond == 1) || ((!(A <= 2) || !(A >= 0)) && cond == 0))) && (!(1 == p) || B == d)) && A >= 0)) || ((((r == A && p == 1) && d == B) && q == 0) && B == 1)) || ((((((((((A == (q + p) * B + (r + -d) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && p == 1) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d == B) && r == A + -B) && B == 1) && r == A + -d) && q + p * -1 == 0) && q + 1 * -1 == 0) && d == 1) [2023-02-18 18:25:32,113 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 18:25:32,113 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 18:25:32,114 INFO L158 Benchmark]: Toolchain (without parser) took 12942.56ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 126.3MB in the beginning and 107.2MB in the end (delta: 19.1MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. [2023-02-18 18:25:32,114 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 119.5MB. Free memory was 82.9MB in the beginning and 82.9MB in the end (delta: 25.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 18:25:32,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.05ms. Allocated memory is still 174.1MB. Free memory was 125.8MB in the beginning and 115.3MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 18:25:32,114 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.23ms. Allocated memory is still 174.1MB. Free memory was 115.3MB in the beginning and 113.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 18:25:32,115 INFO L158 Benchmark]: Boogie Preprocessor took 20.05ms. Allocated memory is still 174.1MB. Free memory was 113.8MB in the beginning and 112.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 18:25:32,115 INFO L158 Benchmark]: RCFGBuilder took 232.23ms. Allocated memory is still 174.1MB. Free memory was 112.7MB in the beginning and 102.3MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 18:25:32,115 INFO L158 Benchmark]: TraceAbstraction took 12385.63ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 101.7MB in the beginning and 110.3MB in the end (delta: -8.6MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2023-02-18 18:25:32,116 INFO L158 Benchmark]: Witness Printer took 49.78ms. Allocated memory is still 209.7MB. Free memory was 109.3MB in the beginning and 107.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 18:25:32,117 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.16ms. Allocated memory is still 119.5MB. Free memory was 82.9MB in the beginning and 82.9MB in the end (delta: 25.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.05ms. Allocated memory is still 174.1MB. Free memory was 125.8MB in the beginning and 115.3MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.23ms. Allocated memory is still 174.1MB. Free memory was 115.3MB in the beginning and 113.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.05ms. Allocated memory is still 174.1MB. Free memory was 113.8MB in the beginning and 112.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 232.23ms. Allocated memory is still 174.1MB. Free memory was 112.7MB in the beginning and 102.3MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12385.63ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 101.7MB in the beginning and 110.3MB in the end (delta: -8.6MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * Witness Printer took 49.78ms. Allocated memory is still 209.7MB. Free memory was 109.3MB in the beginning and 107.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,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: 17]: 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, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 12, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 284 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 240 mSDsluCounter, 1220 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 851 mSDsCounter, 274 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2639 IncrementalHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 274 mSolverCounterUnsat, 369 mSDtfsCounter, 2639 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1078 GetRequests, 908 SyntacticMatches, 21 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=6, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 51 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 96 PreInvPairs, 140 NumberOfFragments, 16051 HoareAnnotationTreeSize, 96 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 632 NumberOfCodeBlocks, 632 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1041 ConstructedInterpolants, 2 QuantifiedInterpolants, 22677 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1610 ConjunctsInSsa, 243 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 3312/3760 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: 44]: Loop Invariant [2023-02-18 18:25:32,126 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,127 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,127 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,127 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,127 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,127 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,127 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,128 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,128 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,128 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,128 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,128 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,129 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,131 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,131 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,131 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,131 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,132 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,132 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,132 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,132 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,132 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,133 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,133 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,133 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] [2023-02-18 18:25:32,133 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0#1_42_41,QUANTIFIED] Derived loop invariant: (((((((((((d == 2 * 1 && r == A) && q == 0) && B == 1) && p == 2 * 1) && d == B * p) && d == 2 * B) || ((((p == 1 && r == A) && d == B) && q == 0) && B == 1)) || (((((((((((((A <= 2 && r <= 2) && B * 2 <= r + B * 2) && p == 1) && ((\exists aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 : int :: ((((aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 <= r * -1 + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 + 2 && aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 + 2 <= r * -1 + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 + 2) && aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 <= 1) && aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 + 2 <= 1) && 0 <= r * -1 + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 + 2) && d >= aux_div_v_ULTIMATE.start_main_~d~0#1_42_41) || (0 < 2 && (\exists aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 : int :: ((aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 + 2 <= r * -1 + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 + 2 && d >= aux_div_v_ULTIMATE.start_main_~d~0#1_42_41) && 0 <= r * -1 + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 + 2) && aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -1 + 1 <= 0)))) && B == 1) && ((d == (A + -r) / 2 && (!(A + r * -1 < 0) || 0 == (A + r) % 2)) || ((!(0 == (A + r) % 2) && d == 1 + (A + -r) / 2) && A + r * -1 < 0))) && d == 1) && q + 2 * 1 * -1 == 0) && (((A <= 2 && A >= 0) && cond == 1) || ((!(A <= 2) || !(A >= 0)) && cond == 0))) && d == B) && (A == q * B + r || (1 <= d && A == q * B + r))) && A >= 0) && A + r * -1 == 2 * 1)) || ((((((((((((((((((d == 2 * 1 && A <= 2) && r <= 2) && p == 2) && B == 1) && q + p * -1 == 0) && r + d <= 2) && d == B * 2) && A == q * B + r) && d >= 2) && B * 2 <= r + d) && 2 <= d) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && (((A <= 2 && A >= 0) && cond == 1) || ((!(A <= 2) || !(A >= 0)) && cond == 0))) && (!(1 == p) || B == d)) && A >= 0) && p == 2 * 1) && r + d == A)) || ((((((((((((((((A <= 2 && 2 <= -d / -2) && r <= 2) && r >= -d / -2) && r >= 2 * B) && r == A) && q == 0) && B == 1) && d == 2 * (2 * 1)) && d % 2 == 0) && p == 2 * (2 * 1)) && d == 2 * (2 * B)) && ((((((((((A == (q + p) * B + (r + -d) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || (((((((((A == (q + p) * B + (r + -d) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((A <= 2 && A >= 0) && cond == 1) || ((!(A <= 2) || !(A >= 0)) && cond == 0))) && (!(1 == p) || B == d)) && A >= 0)) || ((((r == A && p == 1) && d == B) && q == 0) && B == 1)) || ((((((((((A == (q + p) * B + (r + -d) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && p == 1) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d == B) && r == A + -B) && B == 1) && r == A + -d) && q + p * -1 == 0) && q + 1 * -1 == 0) && d == 1) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((((((((((((d == 2 * 1 && A <= 2) && r <= 2) && p == 2) && r == A) && q == 0) && B == 1) && d == B * 2) && B * 2 <= r + d) && 2 <= d) && (r == A || A + -1 * r == 0)) && 0 == q) && (((A <= 2 && A >= 0) && cond == 1) || ((!(A <= 2) || !(A >= 0)) && cond == 0))) && A >= 0) && p == 2 * 1) && d == B * p) && d == 2 * B) || ((((((((((((((((A <= 2 && (((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || ((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && 2 <= -d / -2) && r <= 2) && r >= -d / -2) && r >= 2 * B) && r == A) && q == 0) && B == 1) && d == 2 * (2 * 1)) && d % 2 == 0) && p == 2 * (2 * 1)) && d == 2 * (2 * B)) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((A <= 2 && A >= 0) && cond == 1) || ((!(A <= 2) || !(A >= 0)) && cond == 0))) && (!(1 == p) || B == d)) && A >= 0)) || ((((((((((((A <= 2 && r <= 2) && p == 1) && r == A) && q == 0) && B == 1) && d == 1) && (r == A || A + -1 * r == 0)) && 0 == q) && (((A <= 2 && A >= 0) && cond == 1) || ((!(A <= 2) || !(A >= 0)) && cond == 0))) && d == B) && 1 <= d) && A >= 0) RESULT: Ultimate proved your program to be correct! [2023-02-18 18:25:32,156 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