./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 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/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-?-26d01a9 [2023-02-17 02:07:01,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 02:07:01,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 02:07:01,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 02:07:01,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 02:07:01,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 02:07:01,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 02:07:01,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 02:07:01,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 02:07:01,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 02:07:01,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 02:07:01,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 02:07:01,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 02:07:01,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 02:07:01,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 02:07:01,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 02:07:01,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 02:07:01,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 02:07:01,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 02:07:01,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 02:07:01,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 02:07:01,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 02:07:01,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 02:07:01,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 02:07:01,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 02:07:01,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 02:07:01,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 02:07:01,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 02:07:01,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 02:07:01,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 02:07:01,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 02:07:01,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 02:07:01,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 02:07:01,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 02:07:01,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 02:07:01,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 02:07:01,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 02:07:01,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 02:07:01,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 02:07:01,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 02:07:01,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 02:07:01,876 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 02:07:01,896 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 02:07:01,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 02:07:01,896 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 02:07:01,897 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 02:07:01,897 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 02:07:01,897 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 02:07:01,898 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 02:07:01,898 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 02:07:01,898 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 02:07:01,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 02:07:01,899 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 02:07:01,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 02:07:01,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 02:07:01,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 02:07:01,900 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 02:07:01,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 02:07:01,900 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 02:07:01,900 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 02:07:01,900 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 02:07:01,900 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 02:07:01,901 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 02:07:01,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 02:07:01,901 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 02:07:01,901 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 02:07:01,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:07:01,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 02:07:01,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 02:07:01,902 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 02:07:01,902 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 02:07:01,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 02:07:01,903 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 02:07:01,903 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 02:07:01,903 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 02:07:01,903 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 02:07:01,903 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 02:07:01,903 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-17 02:07:02,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 02:07:02,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 02:07:02,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 02:07:02,151 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 02:07:02,151 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 02:07:02,153 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-17 02:07:03,250 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 02:07:03,423 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 02:07:03,423 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.c [2023-02-17 02:07:03,429 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7076c34e7/c4dcad544dae48a8a7072769fe44776c/FLAGe38f07889 [2023-02-17 02:07:03,448 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7076c34e7/c4dcad544dae48a8a7072769fe44776c [2023-02-17 02:07:03,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 02:07:03,452 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 02:07:03,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 02:07:03,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 02:07:03,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 02:07:03,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:07:03" (1/1) ... [2023-02-17 02:07:03,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794d39ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:03, skipping insertion in model container [2023-02-17 02:07:03,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:07:03" (1/1) ... [2023-02-17 02:07:03,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 02:07:03,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 02:07:03,602 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-17 02:07:03,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:07:03,636 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 02:07:03,651 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-17 02:07:03,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:07:03,675 INFO L208 MainTranslator]: Completed translation [2023-02-17 02:07:03,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:03 WrapperNode [2023-02-17 02:07:03,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 02:07:03,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 02:07:03,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 02:07:03,677 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 02:07:03,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:03" (1/1) ... [2023-02-17 02:07:03,685 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:03" (1/1) ... [2023-02-17 02:07:03,700 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2023-02-17 02:07:03,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 02:07:03,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 02:07:03,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 02:07:03,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 02:07:03,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:03" (1/1) ... [2023-02-17 02:07:03,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:03" (1/1) ... [2023-02-17 02:07:03,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:03" (1/1) ... [2023-02-17 02:07:03,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:03" (1/1) ... [2023-02-17 02:07:03,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:03" (1/1) ... [2023-02-17 02:07:03,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:03" (1/1) ... [2023-02-17 02:07:03,716 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:03" (1/1) ... [2023-02-17 02:07:03,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:03" (1/1) ... [2023-02-17 02:07:03,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 02:07:03,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 02:07:03,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 02:07:03,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 02:07:03,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:03" (1/1) ... [2023-02-17 02:07:03,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:07:03,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:07:03,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 02:07:03,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 02:07:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 02:07:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 02:07:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 02:07:03,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 02:07:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 02:07:03,786 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 02:07:03,835 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 02:07:03,837 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 02:07:03,989 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 02:07:03,995 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 02:07:03,996 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 02:07:03,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:07:03 BoogieIcfgContainer [2023-02-17 02:07:03,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 02:07:03,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 02:07:03,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 02:07:04,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 02:07:04,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 02:07:03" (1/3) ... [2023-02-17 02:07:04,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3409b5e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:07:04, skipping insertion in model container [2023-02-17 02:07:04,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:03" (2/3) ... [2023-02-17 02:07:04,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3409b5e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:07:04, skipping insertion in model container [2023-02-17 02:07:04,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:07:03" (3/3) ... [2023-02-17 02:07:04,005 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound2.c [2023-02-17 02:07:04,017 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 02:07:04,017 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 02:07:04,052 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 02:07:04,057 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;@5f48560a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 02:07:04,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 02:07:04,061 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-17 02:07:04,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 02:07:04,068 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:04,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:07:04,069 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:04,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:04,073 INFO L85 PathProgramCache]: Analyzing trace with hash -586848446, now seen corresponding path program 1 times [2023-02-17 02:07:04,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:04,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848429602] [2023-02-17 02:07:04,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:04,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:07:04,252 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-17 02:07:04,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:04,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848429602] [2023-02-17 02:07:04,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848429602] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:07:04,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:07:04,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:07:04,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757106671] [2023-02-17 02:07:04,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:07:04,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 02:07:04,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:04,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 02:07:04,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 02:07:04,287 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-17 02:07:04,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:04,309 INFO L93 Difference]: Finished difference Result 49 states and 83 transitions. [2023-02-17 02:07:04,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 02:07:04,312 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-17 02:07:04,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:04,319 INFO L225 Difference]: With dead ends: 49 [2023-02-17 02:07:04,319 INFO L226 Difference]: Without dead ends: 22 [2023-02-17 02:07:04,323 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-17 02:07:04,328 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-17 02:07:04,329 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-17 02:07:04,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-17 02:07:04,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-17 02:07:04,365 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-17 02:07:04,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2023-02-17 02:07:04,369 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 9 [2023-02-17 02:07:04,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:04,371 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-02-17 02:07:04,371 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-17 02:07:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2023-02-17 02:07:04,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 02:07:04,373 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:04,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:07:04,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 02:07:04,374 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:04,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:04,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1188158916, now seen corresponding path program 1 times [2023-02-17 02:07:04,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:04,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678332599] [2023-02-17 02:07:04,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:04,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:07:04,523 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-17 02:07:04,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:04,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678332599] [2023-02-17 02:07:04,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678332599] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:07:04,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:07:04,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:07:04,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36544257] [2023-02-17 02:07:04,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:07:04,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:07:04,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:04,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:07:04,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:07:04,528 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-17 02:07:04,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:04,604 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2023-02-17 02:07:04,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:07:04,612 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-17 02:07:04,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:04,613 INFO L225 Difference]: With dead ends: 35 [2023-02-17 02:07:04,613 INFO L226 Difference]: Without dead ends: 33 [2023-02-17 02:07:04,613 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-17 02:07:04,614 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.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:07:04,615 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.1s Time] [2023-02-17 02:07:04,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-17 02:07:04,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2023-02-17 02:07:04,631 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-17 02:07:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-02-17 02:07:04,632 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2023-02-17 02:07:04,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:04,632 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-02-17 02:07:04,633 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-17 02:07:04,633 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-02-17 02:07:04,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 02:07:04,633 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:04,634 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:07:04,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 02:07:04,634 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:04,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:04,635 INFO L85 PathProgramCache]: Analyzing trace with hash -697944935, now seen corresponding path program 1 times [2023-02-17 02:07:04,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:04,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975232705] [2023-02-17 02:07:04,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:04,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:07:04,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 02:07:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:07:04,805 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-17 02:07:04,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:04,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975232705] [2023-02-17 02:07:04,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975232705] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:07:04,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:07:04,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:07:04,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879197579] [2023-02-17 02:07:04,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:07:04,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:07:04,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:04,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:07:04,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:07:04,818 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-17 02:07:04,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:04,868 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2023-02-17 02:07:04,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:07:04,869 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-17 02:07:04,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:04,870 INFO L225 Difference]: With dead ends: 39 [2023-02-17 02:07:04,870 INFO L226 Difference]: Without dead ends: 37 [2023-02-17 02:07:04,870 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-17 02:07:04,871 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-17 02:07:04,872 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-17 02:07:04,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-17 02:07:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2023-02-17 02:07:04,879 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-17 02:07:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-02-17 02:07:04,880 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2023-02-17 02:07:04,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:04,880 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-02-17 02:07:04,880 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-17 02:07:04,881 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-02-17 02:07:04,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 02:07:04,881 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:04,881 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:07:04,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 02:07:04,882 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:04,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:04,883 INFO L85 PathProgramCache]: Analyzing trace with hash 262992548, now seen corresponding path program 1 times [2023-02-17 02:07:04,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:04,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141580456] [2023-02-17 02:07:04,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:04,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:04,894 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:07:04,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2118732241] [2023-02-17 02:07:04,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:04,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:07:04,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:07:04,905 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:07:04,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 02:07:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:07:04,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 02:07:04,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:07:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 02:07:05,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:07:05,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 02:07:05,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:05,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141580456] [2023-02-17 02:07:05,168 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:07:05,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118732241] [2023-02-17 02:07:05,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118732241] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:07:05,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:07:05,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-17 02:07:05,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804920729] [2023-02-17 02:07:05,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:07:05,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 02:07:05,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:05,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 02:07:05,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-17 02:07:05,173 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), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 02:07:05,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:05,373 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2023-02-17 02:07:05,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:07:05,374 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), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2023-02-17 02:07:05,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:05,379 INFO L225 Difference]: With dead ends: 65 [2023-02-17 02:07:05,379 INFO L226 Difference]: Without dead ends: 51 [2023-02-17 02:07:05,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-17 02:07:05,389 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:07:05,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 60 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:07:05,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-17 02:07:05,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-17 02:07:05,406 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-17 02:07:05,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2023-02-17 02:07:05,409 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 19 [2023-02-17 02:07:05,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:05,409 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2023-02-17 02:07:05,410 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), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 02:07:05,410 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2023-02-17 02:07:05,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 02:07:05,410 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:05,411 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-17 02:07:05,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 02:07:05,616 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-17 02:07:05,617 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:05,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:05,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1807142342, now seen corresponding path program 1 times [2023-02-17 02:07:05,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:05,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137740515] [2023-02-17 02:07:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:05,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:05,627 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:07:05,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1299037446] [2023-02-17 02:07:05,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:05,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:07:05,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:07:05,633 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:07:05,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 02:07:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:07:05,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 02:07:05,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:07:05,738 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 02:07:05,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:07:05,794 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 02:07:05,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:05,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137740515] [2023-02-17 02:07:05,794 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:07:05,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299037446] [2023-02-17 02:07:05,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299037446] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:07:05,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:07:05,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-02-17 02:07:05,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235290216] [2023-02-17 02:07:05,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:07:05,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 02:07:05,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:05,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 02:07:05,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-17 02:07:05,797 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), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-17 02:07:05,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:05,919 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2023-02-17 02:07:05,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:07:05,920 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), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 26 [2023-02-17 02:07:05,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:05,921 INFO L225 Difference]: With dead ends: 66 [2023-02-17 02:07:05,921 INFO L226 Difference]: Without dead ends: 59 [2023-02-17 02:07:05,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-02-17 02:07:05,922 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:07:05,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 80 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:07:05,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-17 02:07:05,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2023-02-17 02:07:05,933 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-17 02:07:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2023-02-17 02:07:05,935 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 26 [2023-02-17 02:07:05,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:05,935 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2023-02-17 02:07:05,935 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), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-17 02:07:05,935 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2023-02-17 02:07:05,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-17 02:07:05,937 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:05,937 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-17 02:07:05,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 02:07:06,142 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-17 02:07:06,143 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:06,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:06,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1034157389, now seen corresponding path program 1 times [2023-02-17 02:07:06,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:06,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199385612] [2023-02-17 02:07:06,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:06,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:06,153 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:07:06,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [906986886] [2023-02-17 02:07:06,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:06,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:07:06,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:07:06,155 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:07:06,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 02:07:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:07:06,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-17 02:07:06,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:07:06,276 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-17 02:07:06,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:07:06,585 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-17 02:07:06,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:06,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199385612] [2023-02-17 02:07:06,586 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:07:06,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906986886] [2023-02-17 02:07:06,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906986886] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:07:06,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:07:06,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-17 02:07:06,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865264850] [2023-02-17 02:07:06,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:07:06,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 02:07:06,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:06,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 02:07:06,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-02-17 02:07:06,592 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), 5 states have call predecessors, (16), 5 states have call successors, (16) [2023-02-17 02:07:07,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:07,737 INFO L93 Difference]: Finished difference Result 142 states and 193 transitions. [2023-02-17 02:07:07,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 02:07:07,737 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), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 56 [2023-02-17 02:07:07,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:07,739 INFO L225 Difference]: With dead ends: 142 [2023-02-17 02:07:07,739 INFO L226 Difference]: Without dead ends: 111 [2023-02-17 02:07:07,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-02-17 02:07:07,740 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 48 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:07:07,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 94 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-17 02:07:07,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-17 02:07:07,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2023-02-17 02:07:07,795 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-17 02:07:07,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 138 transitions. [2023-02-17 02:07:07,798 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 138 transitions. Word has length 56 [2023-02-17 02:07:07,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:07,798 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 138 transitions. [2023-02-17 02:07:07,798 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), 5 states have call predecessors, (16), 5 states have call successors, (16) [2023-02-17 02:07:07,799 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2023-02-17 02:07:07,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-17 02:07:07,804 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:07,805 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-17 02:07:07,813 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-17 02:07:08,010 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-17 02:07:08,011 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:08,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:08,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1199454569, now seen corresponding path program 1 times [2023-02-17 02:07:08,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:08,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614886796] [2023-02-17 02:07:08,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:08,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:08,025 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:07:08,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1255262505] [2023-02-17 02:07:08,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:08,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:07:08,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:07:08,031 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:07:08,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 02:07:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:07:08,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-17 02:07:08,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:07:08,168 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-17 02:07:08,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:07:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-17 02:07:08,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:08,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614886796] [2023-02-17 02:07:08,371 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:07:08,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255262505] [2023-02-17 02:07:08,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255262505] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:07:08,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:07:08,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-17 02:07:08,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850983046] [2023-02-17 02:07:08,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:07:08,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 02:07:08,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:08,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 02:07:08,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-02-17 02:07:08,377 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), 6 states have call predecessors, (20), 6 states have call successors, (20) [2023-02-17 02:07:09,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:09,299 INFO L93 Difference]: Finished difference Result 161 states and 210 transitions. [2023-02-17 02:07:09,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 02:07:09,300 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), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 67 [2023-02-17 02:07:09,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:09,301 INFO L225 Difference]: With dead ends: 161 [2023-02-17 02:07:09,301 INFO L226 Difference]: Without dead ends: 123 [2023-02-17 02:07:09,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2023-02-17 02:07:09,302 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 25 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-17 02:07:09,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 87 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-17 02:07:09,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-17 02:07:09,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 101. [2023-02-17 02:07:09,330 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-17 02:07:09,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 125 transitions. [2023-02-17 02:07:09,331 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 125 transitions. Word has length 67 [2023-02-17 02:07:09,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:09,331 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 125 transitions. [2023-02-17 02:07:09,332 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), 6 states have call predecessors, (20), 6 states have call successors, (20) [2023-02-17 02:07:09,332 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2023-02-17 02:07:09,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-17 02:07:09,333 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:09,333 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-17 02:07:09,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 02:07:09,538 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-17 02:07:09,539 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:09,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:09,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1728532070, now seen corresponding path program 1 times [2023-02-17 02:07:09,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:09,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085497821] [2023-02-17 02:07:09,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:09,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:09,547 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:07:09,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [407329586] [2023-02-17 02:07:09,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:09,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:07:09,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:07:09,549 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:07:09,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 02:07:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:07:09,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 02:07:09,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:07:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 24 proven. 37 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-17 02:07:09,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:07:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 24 proven. 37 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-17 02:07:09,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:09,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085497821] [2023-02-17 02:07:09,810 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:07:09,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407329586] [2023-02-17 02:07:09,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407329586] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:07:09,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:07:09,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-17 02:07:09,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129218075] [2023-02-17 02:07:09,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:07:09,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 02:07:09,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:09,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 02:07:09,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-02-17 02:07:09,813 INFO L87 Difference]: Start difference. First operand 101 states and 125 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, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2023-02-17 02:07:10,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:10,129 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2023-02-17 02:07:10,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 02:07:10,130 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, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) Word has length 72 [2023-02-17 02:07:10,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:10,131 INFO L225 Difference]: With dead ends: 117 [2023-02-17 02:07:10,131 INFO L226 Difference]: Without dead ends: 86 [2023-02-17 02:07:10,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2023-02-17 02:07:10,132 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:07:10,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 92 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:07:10,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-17 02:07:10,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-02-17 02:07:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 21 states have call successors, (21), 10 states have call predecessors, (21), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-17 02:07:10,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2023-02-17 02:07:10,151 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 72 [2023-02-17 02:07:10,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:10,151 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2023-02-17 02:07:10,151 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, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2023-02-17 02:07:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2023-02-17 02:07:10,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-17 02:07:10,153 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:10,153 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-17 02:07:10,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 02:07:10,359 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-17 02:07:10,359 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:10,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:10,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1412721000, now seen corresponding path program 1 times [2023-02-17 02:07:10,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:10,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675780399] [2023-02-17 02:07:10,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:10,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:10,375 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:07:10,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1730116088] [2023-02-17 02:07:10,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:10,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:07:10,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:07:10,377 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-17 02:07:10,380 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-17 02:07:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:07:10,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 02:07:10,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:07:10,492 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-17 02:07:10,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:07:10,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:10,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675780399] [2023-02-17 02:07:10,493 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:07:10,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730116088] [2023-02-17 02:07:10,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730116088] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:07:10,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:07:10,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 02:07:10,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991822112] [2023-02-17 02:07:10,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:07:10,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:07:10,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:10,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:07:10,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:07:10,496 INFO L87 Difference]: Start difference. First operand 86 states and 101 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-17 02:07:10,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:10,574 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2023-02-17 02:07:10,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:07:10,575 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-17 02:07:10,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:10,579 INFO L225 Difference]: With dead ends: 116 [2023-02-17 02:07:10,579 INFO L226 Difference]: Without dead ends: 86 [2023-02-17 02:07:10,580 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-17 02:07:10,582 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:07:10,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 95 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:07:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-17 02:07:10,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2023-02-17 02:07:10,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-17 02:07:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2023-02-17 02:07:10,608 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 86 [2023-02-17 02:07:10,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:10,609 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2023-02-17 02:07:10,609 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-17 02:07:10,609 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2023-02-17 02:07:10,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-17 02:07:10,611 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:10,611 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-17 02:07:10,619 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-17 02:07:10,816 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-17 02:07:10,817 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:10,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:10,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1193302554, now seen corresponding path program 2 times [2023-02-17 02:07:10,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:10,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360038224] [2023-02-17 02:07:10,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:10,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:10,832 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:07:10,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1036725472] [2023-02-17 02:07:10,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 02:07:10,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:07:10,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:07:10,834 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-17 02:07:10,837 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-17 02:07:10,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 02:07:10,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:07:10,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-17 02:07:10,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:07:10,994 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-17 02:07:10,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:07:11,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:11,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360038224] [2023-02-17 02:07:11,228 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:07:11,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036725472] [2023-02-17 02:07:11,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036725472] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:07:11,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 02:07:11,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-17 02:07:11,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340996990] [2023-02-17 02:07:11,230 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 02:07:11,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 02:07:11,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:11,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 02:07:11,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-02-17 02:07:11,232 INFO L87 Difference]: Start difference. First operand 78 states and 87 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-17 02:07:11,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:11,451 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2023-02-17 02:07:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 02:07:11,452 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-17 02:07:11,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:11,452 INFO L225 Difference]: With dead ends: 124 [2023-02-17 02:07:11,452 INFO L226 Difference]: Without dead ends: 76 [2023-02-17 02:07:11,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2023-02-17 02:07:11,453 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 38 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:07:11,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 115 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:07:11,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-17 02:07:11,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-02-17 02:07:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 50 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-17 02:07:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2023-02-17 02:07:11,470 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 86 [2023-02-17 02:07:11,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:11,471 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2023-02-17 02:07:11,471 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-17 02:07:11,471 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2023-02-17 02:07:11,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-02-17 02:07:11,472 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:11,472 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-17 02:07:11,478 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-17 02:07:11,677 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-17 02:07:11,678 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:11,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:11,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1373298297, now seen corresponding path program 2 times [2023-02-17 02:07:11,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:11,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875585165] [2023-02-17 02:07:11,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:11,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:11,685 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:07:11,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [15443374] [2023-02-17 02:07:11,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 02:07:11,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:07:11,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:07:11,687 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-17 02:07:11,690 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-17 02:07:11,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 02:07:11,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:07:11,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-17 02:07:11,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:07:11,841 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 30 proven. 63 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-02-17 02:07:11,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:07:13,001 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 30 proven. 63 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-02-17 02:07:13,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:13,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875585165] [2023-02-17 02:07:13,002 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:07:13,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15443374] [2023-02-17 02:07:13,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15443374] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:07:13,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:07:13,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2023-02-17 02:07:13,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282368602] [2023-02-17 02:07:13,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:07:13,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-17 02:07:13,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:13,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-17 02:07:13,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2023-02-17 02:07:13,005 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 11 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (28), 11 states have call predecessors, (28), 11 states have call successors, (28) [2023-02-17 02:07:13,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:13,555 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2023-02-17 02:07:13,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 02:07:13,555 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 11 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (28), 11 states have call predecessors, (28), 11 states have call successors, (28) Word has length 91 [2023-02-17 02:07:13,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:13,556 INFO L225 Difference]: With dead ends: 86 [2023-02-17 02:07:13,556 INFO L226 Difference]: Without dead ends: 82 [2023-02-17 02:07:13,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2023-02-17 02:07:13,557 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 19 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 02:07:13,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 131 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 02:07:13,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-17 02:07:13,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-02-17 02:07:13,573 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-17 02:07:13,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2023-02-17 02:07:13,574 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 91 [2023-02-17 02:07:13,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:13,574 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2023-02-17 02:07:13,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 11 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (28), 11 states have call predecessors, (28), 11 states have call successors, (28) [2023-02-17 02:07:13,575 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2023-02-17 02:07:13,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-02-17 02:07:13,576 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:07:13,576 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-17 02:07:13,585 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-17 02:07:13,781 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-17 02:07:13,782 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:07:13,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:07:13,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1231859808, now seen corresponding path program 1 times [2023-02-17 02:07:13,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:07:13,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984213305] [2023-02-17 02:07:13,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:13,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:07:13,792 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:07:13,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1800512254] [2023-02-17 02:07:13,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:07:13,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:07:13,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:07:13,794 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-17 02:07:13,797 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-17 02:07:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:07:13,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-17 02:07:13,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:07:14,016 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 67 proven. 69 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2023-02-17 02:07:14,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:07:16,154 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse2 (< |c_ULTIMATE.start_main_~p~0#1| 0)) (.cse0 (div |c_ULTIMATE.start_main_~p~0#1| 2)) (.cse1 (= (mod |c_ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (= .cse0 1)) (and (not .cse1) .cse2)) (or (not .cse2) (not (= (+ .cse0 1) 1)) .cse1))) (not (= |c_ULTIMATE.start_main_~A~0#1| (+ (* |c_ULTIMATE.start_main_~B~0#1| |c_ULTIMATE.start_main_~q~0#1|) |c_ULTIMATE.start_main_~r~0#1|))) (let ((.cse5 (< |c_ULTIMATE.start_main_~d~0#1| 0)) (.cse4 (= (mod |c_ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse6 (div |c_ULTIMATE.start_main_~d~0#1| 2))) (and (let ((.cse3 (+ .cse6 1))) (or (= (+ (* .cse3 |c_ULTIMATE.start_main_~q~0#1|) |c_ULTIMATE.start_main_~r~0#1|) |c_ULTIMATE.start_main_~A~0#1|) (>= |c_ULTIMATE.start_main_~r~0#1| .cse3) .cse4 (not .cse5))) (or (>= |c_ULTIMATE.start_main_~r~0#1| .cse6) (and .cse5 (not .cse4)) (= |c_ULTIMATE.start_main_~A~0#1| (+ (* .cse6 |c_ULTIMATE.start_main_~q~0#1|) |c_ULTIMATE.start_main_~r~0#1|)))))) is different from true [2023-02-17 02:07:17,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:07:17,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984213305] [2023-02-17 02:07:17,268 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:07:17,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800512254] [2023-02-17 02:07:17,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800512254] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:07:17,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 02:07:17,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2023-02-17 02:07:17,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370424872] [2023-02-17 02:07:17,269 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 02:07:17,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 02:07:17,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:07:17,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 02:07:17,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=407, Unknown=1, NotChecked=42, Total=552 [2023-02-17 02:07:17,271 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 7 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) [2023-02-17 02:07:17,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:07:17,721 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2023-02-17 02:07:17,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 02:07:17,722 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 7 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) Word has length 97 [2023-02-17 02:07:17,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:07:17,722 INFO L225 Difference]: With dead ends: 82 [2023-02-17 02:07:17,722 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 02:07:17,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=129, Invalid=524, Unknown=1, NotChecked=48, Total=702 [2023-02-17 02:07:17,723 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:07:17,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 152 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 02:07:17,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 02:07:17,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 02:07:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 02:07:17,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 02:07:17,724 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2023-02-17 02:07:17,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:07:17,724 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 02:07:17,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 7 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) [2023-02-17 02:07:17,725 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 02:07:17,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 02:07:17,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 02:07:17,740 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-17 02:07:17,933 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-17 02:07:17,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 02:07:17,955 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2023-02-17 02:07:17,957 INFO L895 garLoopResultBuilder]: At program point L52-2(lines 44 56) the Hoare annotation is: (let ((.cse33 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse18 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse27 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse23 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse37 (+ .cse33 1)) (.cse55 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse35 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse54 (< |ULTIMATE.start_main_~d~0#1| 0))) (let ((.cse0 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse10 (<= |ULTIMATE.start_main_~A~0#1| 2)) (.cse32 (* 2 1)) (.cse8 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse19 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse25 (not .cse54)) (.cse50 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse33))) (.cse34 (and .cse55 (not .cse35))) (.cse51 (* (+ |ULTIMATE.start_main_~q~0#1| .cse37) |ULTIMATE.start_main_~B~0#1|)) (.cse36 (not .cse55)) (.cse52 (- .cse23)) (.cse24 (and (not .cse27) .cse54)) (.cse48 (not .cse18)) (.cse30 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse6 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|))) (let ((.cse1 (= .cse6 |ULTIMATE.start_main_~A~0#1|)) (.cse3 (or .cse48 .cse30)) (.cse16 (or (let ((.cse53 (+ |ULTIMATE.start_main_~r~0#1| .cse52))) (and (or (= (+ .cse50 .cse53) |ULTIMATE.start_main_~A~0#1|) .cse34) (or (= (+ .cse51 .cse53) |ULTIMATE.start_main_~A~0#1|) .cse35 .cse36))) .cse24)) (.cse17 (or .cse25 (let ((.cse49 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse52)))) (and (or .cse34 (= (+ .cse49 .cse50) |ULTIMATE.start_main_~A~0#1|)) (or .cse35 .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ .cse51 .cse49))))) .cse27)) (.cse11 (= |ULTIMATE.start_main_~A~0#1| (+ (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~d~0#1|)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|))))) (.cse13 (or .cse48 .cse19)) (.cse4 (= |ULTIMATE.start_main_~d~0#1| .cse8)) (.cse5 (= |ULTIMATE.start_main_~d~0#1| .cse32)) (.cse20 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse29 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse21 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse14 (= |ULTIMATE.start_main_~p~0#1| .cse32)) (.cse15 (= |ULTIMATE.start_main_~d~0#1| 1)) (.cse7 (<= |ULTIMATE.start_main_~r~0#1| 2)) (.cse9 (or (and (or (not .cse0) (not .cse10)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse10))) (.cse12 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse2 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= .cse6 2) (<= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= 2 |ULTIMATE.start_main_~p~0#1|) .cse7 (>= .cse6 .cse8) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse9 (<= .cse8 .cse6) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse15 .cse16 .cse17 .cse18 .cse19 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) .cse11 .cse12 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1)) (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|)) (and .cse18 .cse19 .cse20 .cse21 .cse12) (let ((.cse22 (and (or (not (= .cse33 1)) .cse34) (or .cse35 .cse36 (not (= .cse37 1))))) (.cse26 (+ .cse23 1)) (.cse31 (* 2 .cse32))) (and .cse0 (<= |ULTIMATE.start_main_~q~0#1| 0) (or .cse22 (and (or (= .cse23 |ULTIMATE.start_main_~B~0#1|) .cse24) (or .cse25 (= |ULTIMATE.start_main_~B~0#1| .cse26) .cse27))) (let ((.cse28 (or .cse22 (and (or .cse25 .cse27 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse26)) |ULTIMATE.start_main_~A~0#1|)) (or .cse24 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse23 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse16 .cse2 .cse17 .cse3 .cse28 .cse20 .cse29 .cse21 .cse11 .cse12) (and .cse16 .cse2 .cse17 .cse28 .cse20 .cse29 .cse21 .cse11 .cse30 .cse12))) (>= |ULTIMATE.start_main_~r~0#1| .cse23) (= (* 2 .cse8) |ULTIMATE.start_main_~d~0#1|) (<= 2 .cse23) .cse7 (= |ULTIMATE.start_main_~p~0#1| .cse31) .cse9 (= |ULTIMATE.start_main_~d~0#1| .cse31) .cse10 .cse21 (>= |ULTIMATE.start_main_~r~0#1| .cse8) .cse12 .cse13 .cse27)) (and .cse4 .cse5 .cse20 .cse29 .cse21 .cse12 .cse14) (let ((.cse45 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (let ((.cse41 (+ .cse45 |ULTIMATE.start_main_~A~0#1|))) (and .cse0 .cse15 (let ((.cse38 (div (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~r~0#1|)) 2)) (.cse40 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse39 (< .cse41 0))) (or (and (= |ULTIMATE.start_main_~d~0#1| .cse38) (or (not .cse39) .cse40)) (and (= |ULTIMATE.start_main_~d~0#1| (+ .cse38 1)) (not .cse40) .cse39))) .cse18 .cse19 .cse7 .cse9 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (<= .cse8 (+ |ULTIMATE.start_main_~r~0#1| .cse8)) (or (exists ((|aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| Int)) (let ((.cse42 (* |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| (- 2)))) (let ((.cse43 (+ 2 .cse42)) (.cse44 (+ 2 .cse45 .cse42))) (and (<= .cse42 1) (<= .cse43 .cse44) (<= .cse42 .cse44) (<= |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| |ULTIMATE.start_main_~d~0#1|) (<= .cse43 1) (<= 0 .cse44))))) (and (< 0 2) (exists ((|aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| Int)) (let ((.cse46 (* |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| (- 2)))) (let ((.cse47 (+ 2 .cse45 .cse46))) (and (<= (+ 2 .cse46) .cse47) (<= |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| |ULTIMATE.start_main_~d~0#1|) (<= (+ (* (- 1) |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41|) 1) 0) (<= 0 .cse47))))))) .cse10 (>= (+ .cse41 |ULTIMATE.start_main_~r~0#1|) .cse8) .cse12 (or .cse2 (and .cse2 (<= 1 |ULTIMATE.start_main_~d~0#1|))) (= .cse41 .cse8) (<= (+ |ULTIMATE.start_main_~q~0#1| (* (- 1) 2)) 0))))))))) [2023-02-17 02:07:17,957 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2023-02-17 02:07:17,958 INFO L895 garLoopResultBuilder]: At program point L44-1(lines 44 56) the Hoare annotation is: (let ((.cse46 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse48 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse41 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse37 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse33 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse47 (+ .cse46 1)) (.cse49 (< |ULTIMATE.start_main_~d~0#1| 0))) (let ((.cse35 (not .cse49)) (.cse40 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse46))) (.cse43 (* (+ |ULTIMATE.start_main_~q~0#1| .cse47) |ULTIMATE.start_main_~B~0#1|)) (.cse44 (- .cse33)) (.cse34 (and (not .cse37) .cse49)) (.cse38 (and .cse48 (not .cse41))) (.cse42 (not .cse48))) (let ((.cse32 (and (or (not (= .cse46 1)) .cse38) (or .cse41 .cse42 (not (= .cse47 1))))) (.cse36 (+ .cse33 1)) (.cse28 (or (let ((.cse45 (+ |ULTIMATE.start_main_~r~0#1| .cse44))) (and (or (= (+ .cse40 .cse45) |ULTIMATE.start_main_~A~0#1|) .cse38) (or (= (+ .cse43 .cse45) |ULTIMATE.start_main_~A~0#1|) .cse41 .cse42))) .cse34)) (.cse29 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse30 (or .cse35 (let ((.cse39 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse44)))) (and (or .cse38 (= (+ .cse39 .cse40) |ULTIMATE.start_main_~A~0#1|)) (or .cse41 .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ .cse43 .cse39))))) .cse37)) (.cse25 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse31 (= |ULTIMATE.start_main_~A~0#1| (+ (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~d~0#1|)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|))))) (.cse21 (= |ULTIMATE.start_main_~B~0#1| 1))) (let ((.cse1 (= |ULTIMATE.start_main_~d~0#1| 1)) (.cse6 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse20 (or (and .cse29 .cse25 .cse31) (and .cse28 .cse29 .cse30 .cse25 .cse31) (and .cse28 .cse29 .cse30 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) .cse25 .cse31 .cse21 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1))))) (.cse19 (or .cse32 (and (or .cse35 .cse37 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse36)) |ULTIMATE.start_main_~A~0#1|)) (or .cse34 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse33 |ULTIMATE.start_main_~q~0#1|))))))) (.cse22 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse23 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))) (let ((.cse18 (or .cse32 (and (or (= .cse33 |ULTIMATE.start_main_~B~0#1|) .cse34) (or .cse35 (= |ULTIMATE.start_main_~B~0#1| .cse36) .cse37)))) (.cse24 (let ((.cse27 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse26 (or (and .cse28 .cse29 .cse30 .cse22 .cse25 .cse23 .cse31 .cse21) (and .cse29 .cse22 .cse25 .cse23 .cse31 .cse21)))) (or (and .cse19 .cse26 .cse27) (and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) .cse1 .cse6 .cse20 (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|)) (and .cse19 .cse20 .cse27) (and .cse19 .cse26)))) (.cse7 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (or (let ((.cse15 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (let ((.cse5 (+ .cse15 |ULTIMATE.start_main_~A~0#1|))) (let ((.cse0 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse10 (<= |ULTIMATE.start_main_~A~0#1| 2)) (.cse8 (+ .cse5 |ULTIMATE.start_main_~r~0#1|)) (.cse9 (* 2 1)) (.cse11 (* 2 |ULTIMATE.start_main_~B~0#1|))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| 1))) (let ((.cse2 (div (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~r~0#1|)) 2)) (.cse4 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse3 (< .cse5 0))) (or (and (= |ULTIMATE.start_main_~d~0#1| .cse2) (or (not .cse3) .cse4)) (and (= |ULTIMATE.start_main_~d~0#1| (+ .cse2 1)) (not .cse4) .cse3))) .cse6 .cse7 (>= .cse8 .cse9) (<= |ULTIMATE.start_main_~r~0#1| 2) (or (and (or (not .cse0) (not .cse10)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse10)) (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (<= .cse11 (+ |ULTIMATE.start_main_~r~0#1| .cse11)) (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 ((.cse13 (+ 2 .cse12)) (.cse14 (+ 2 .cse15 .cse12))) (and (<= .cse12 1) (<= .cse13 .cse14) (<= .cse12 .cse14) (<= |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| |ULTIMATE.start_main_~d~0#1|) (<= .cse13 1) (<= 0 .cse14))))) (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 (+ 2 .cse15 .cse16))) (and (<= (+ 2 .cse16) .cse17) (<= |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| |ULTIMATE.start_main_~d~0#1|) (<= (+ (* (- 1) |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41|) 1) 0) (<= 0 .cse17))))))) .cse10 (or (and .cse18 .cse7 .cse19 .cse20) (and .cse18 .cse7 .cse19 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse20)) (>= .cse8 .cse11) .cse21 (= .cse5 .cse9) (= .cse5 .cse11) (<= (+ |ULTIMATE.start_main_~q~0#1| (* (- 1) 2)) 0))))) (and .cse6 .cse7 .cse22 .cse23 .cse21) (and .cse18 .cse7 .cse24) (and .cse6 .cse7 .cse24 .cse21) (and .cse6 .cse7 .cse22 .cse25 .cse23 .cse21)))))))) [2023-02-17 02:07:17,958 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 61) the Hoare annotation is: true [2023-02-17 02:07:17,959 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse10 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse0 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse34 (<= |ULTIMATE.start_main_~A~0#1| 2))) (let ((.cse36 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse35 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~q~0#1| 0)) (.cse31 (<= |ULTIMATE.start_main_~r~0#1| 2)) (.cse33 (or (and (or (not .cse0) (not .cse34)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse34))) (.cse8 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse30 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse9 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse12 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse13 (or .cse10 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0) (not .cse10)))) (.cse37 (* 2 1))) (or (let ((.cse29 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse39 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse23 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (let ((.cse19 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse16 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse38 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse20 (and .cse39 (not .cse23))) (.cse24 (not .cse39)) (.cse28 (+ .cse29 1))) (let ((.cse14 (and (or (not (= .cse29 1)) .cse20) (or .cse23 .cse24 (not (= .cse28 1))))) (.cse18 (and (not .cse16) .cse38)) (.cse15 (not .cse38)) (.cse17 (+ .cse19 1)) (.cse32 (* 2 .cse37)) (.cse5 (not .cse36))) (and .cse0 .cse1 (let ((.cse22 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse29))) (.cse25 (* (+ |ULTIMATE.start_main_~q~0#1| .cse28) |ULTIMATE.start_main_~B~0#1|)) (.cse26 (- .cse19))) (let ((.cse2 (or (let ((.cse27 (+ |ULTIMATE.start_main_~r~0#1| .cse26))) (and (or (= (+ .cse22 .cse27) |ULTIMATE.start_main_~A~0#1|) .cse20) (or (= (+ .cse25 .cse27) |ULTIMATE.start_main_~A~0#1|) .cse23 .cse24))) .cse18)) (.cse3 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse4 (or .cse15 (let ((.cse21 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse26)))) (and (or .cse20 (= (+ .cse21 .cse22) |ULTIMATE.start_main_~A~0#1|)) (or .cse23 .cse24 (= |ULTIMATE.start_main_~A~0#1| (+ .cse25 .cse21))))) .cse16)) (.cse7 (or .cse14 (and (or .cse15 .cse16 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse17)) |ULTIMATE.start_main_~A~0#1|)) (or .cse18 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse19 |ULTIMATE.start_main_~q~0#1|))))))) (.cse11 (= |ULTIMATE.start_main_~A~0#1| (+ (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~d~0#1|)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|))))) (.cse6 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))) (or (and .cse2 .cse3 .cse4 (or .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse6 .cse12 .cse13)))) (or .cse14 (and (or (= .cse19 |ULTIMATE.start_main_~B~0#1|) .cse18) (or .cse15 (= |ULTIMATE.start_main_~B~0#1| .cse17) .cse16))) (>= |ULTIMATE.start_main_~r~0#1| .cse19) (= (* 2 .cse30) |ULTIMATE.start_main_~d~0#1|) (<= 2 .cse19) .cse31 (= |ULTIMATE.start_main_~p~0#1| .cse32) .cse33 (= |ULTIMATE.start_main_~d~0#1| .cse32) .cse34 .cse10 (>= |ULTIMATE.start_main_~r~0#1| .cse30) .cse12 (or .cse5 .cse35) .cse16)))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~d~0#1| 1) .cse36 .cse35 .cse31 .cse33 .cse8 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse34 .cse10 .cse12 .cse13) (and .cse0 .cse1 (= |ULTIMATE.start_main_~d~0#1| .cse30) (= |ULTIMATE.start_main_~d~0#1| .cse37) (= 2 |ULTIMATE.start_main_~p~0#1|) .cse31 (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse33 .cse8 (<= .cse30 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse34 .cse9 .cse10 .cse12 .cse13 (= |ULTIMATE.start_main_~p~0#1| .cse37))))) [2023-02-17 02:07:17,959 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 02:07:17,959 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 02:07:17,960 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (let ((.cse33 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse18 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse27 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse23 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse37 (+ .cse33 1)) (.cse55 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse35 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse54 (< |ULTIMATE.start_main_~d~0#1| 0))) (let ((.cse0 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse10 (<= |ULTIMATE.start_main_~A~0#1| 2)) (.cse32 (* 2 1)) (.cse8 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse19 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse25 (not .cse54)) (.cse50 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse33))) (.cse34 (and .cse55 (not .cse35))) (.cse51 (* (+ |ULTIMATE.start_main_~q~0#1| .cse37) |ULTIMATE.start_main_~B~0#1|)) (.cse36 (not .cse55)) (.cse52 (- .cse23)) (.cse24 (and (not .cse27) .cse54)) (.cse48 (not .cse18)) (.cse30 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse6 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|))) (let ((.cse1 (= .cse6 |ULTIMATE.start_main_~A~0#1|)) (.cse3 (or .cse48 .cse30)) (.cse16 (or (let ((.cse53 (+ |ULTIMATE.start_main_~r~0#1| .cse52))) (and (or (= (+ .cse50 .cse53) |ULTIMATE.start_main_~A~0#1|) .cse34) (or (= (+ .cse51 .cse53) |ULTIMATE.start_main_~A~0#1|) .cse35 .cse36))) .cse24)) (.cse17 (or .cse25 (let ((.cse49 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse52)))) (and (or .cse34 (= (+ .cse49 .cse50) |ULTIMATE.start_main_~A~0#1|)) (or .cse35 .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ .cse51 .cse49))))) .cse27)) (.cse11 (= |ULTIMATE.start_main_~A~0#1| (+ (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~d~0#1|)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|))))) (.cse13 (or .cse48 .cse19)) (.cse4 (= |ULTIMATE.start_main_~d~0#1| .cse8)) (.cse5 (= |ULTIMATE.start_main_~d~0#1| .cse32)) (.cse20 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse29 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse21 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse14 (= |ULTIMATE.start_main_~p~0#1| .cse32)) (.cse15 (= |ULTIMATE.start_main_~d~0#1| 1)) (.cse7 (<= |ULTIMATE.start_main_~r~0#1| 2)) (.cse9 (or (and (or (not .cse0) (not .cse10)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse10))) (.cse12 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse2 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= .cse6 2) (<= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= 2 |ULTIMATE.start_main_~p~0#1|) .cse7 (>= .cse6 .cse8) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse9 (<= .cse8 .cse6) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse15 .cse16 .cse17 .cse18 .cse19 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) .cse11 .cse12 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1)) (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|)) (and .cse18 .cse19 .cse20 .cse21 .cse12) (let ((.cse22 (and (or (not (= .cse33 1)) .cse34) (or .cse35 .cse36 (not (= .cse37 1))))) (.cse26 (+ .cse23 1)) (.cse31 (* 2 .cse32))) (and .cse0 (<= |ULTIMATE.start_main_~q~0#1| 0) (or .cse22 (and (or (= .cse23 |ULTIMATE.start_main_~B~0#1|) .cse24) (or .cse25 (= |ULTIMATE.start_main_~B~0#1| .cse26) .cse27))) (let ((.cse28 (or .cse22 (and (or .cse25 .cse27 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse26)) |ULTIMATE.start_main_~A~0#1|)) (or .cse24 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse23 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse16 .cse2 .cse17 .cse3 .cse28 .cse20 .cse29 .cse21 .cse11 .cse12) (and .cse16 .cse2 .cse17 .cse28 .cse20 .cse29 .cse21 .cse11 .cse30 .cse12))) (>= |ULTIMATE.start_main_~r~0#1| .cse23) (= (* 2 .cse8) |ULTIMATE.start_main_~d~0#1|) (<= 2 .cse23) .cse7 (= |ULTIMATE.start_main_~p~0#1| .cse31) .cse9 (= |ULTIMATE.start_main_~d~0#1| .cse31) .cse10 .cse21 (>= |ULTIMATE.start_main_~r~0#1| .cse8) .cse12 .cse13 .cse27)) (and .cse4 .cse5 .cse20 .cse29 .cse21 .cse12 .cse14) (let ((.cse45 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (let ((.cse41 (+ .cse45 |ULTIMATE.start_main_~A~0#1|))) (and .cse0 .cse15 (let ((.cse38 (div (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~r~0#1|)) 2)) (.cse40 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse39 (< .cse41 0))) (or (and (= |ULTIMATE.start_main_~d~0#1| .cse38) (or (not .cse39) .cse40)) (and (= |ULTIMATE.start_main_~d~0#1| (+ .cse38 1)) (not .cse40) .cse39))) .cse18 .cse19 .cse7 .cse9 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (<= .cse8 (+ |ULTIMATE.start_main_~r~0#1| .cse8)) (or (exists ((|aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| Int)) (let ((.cse42 (* |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| (- 2)))) (let ((.cse43 (+ 2 .cse42)) (.cse44 (+ 2 .cse45 .cse42))) (and (<= .cse42 1) (<= .cse43 .cse44) (<= .cse42 .cse44) (<= |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| |ULTIMATE.start_main_~d~0#1|) (<= .cse43 1) (<= 0 .cse44))))) (and (< 0 2) (exists ((|aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| Int)) (let ((.cse46 (* |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| (- 2)))) (let ((.cse47 (+ 2 .cse45 .cse46))) (and (<= (+ 2 .cse46) .cse47) (<= |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| |ULTIMATE.start_main_~d~0#1|) (<= (+ (* (- 1) |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41|) 1) 0) (<= 0 .cse47))))))) .cse10 (>= (+ .cse41 |ULTIMATE.start_main_~r~0#1|) .cse8) .cse12 (or .cse2 (and .cse2 (<= 1 |ULTIMATE.start_main_~d~0#1|))) (= .cse41 .cse8) (<= (+ |ULTIMATE.start_main_~q~0#1| (* (- 1) 2)) 0))))))))) [2023-02-17 02:07:17,960 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-02-17 02:07:17,961 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse33 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse5 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse27 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse23 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse37 (+ .cse33 1)) (.cse56 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse35 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse55 (< |ULTIMATE.start_main_~d~0#1| 0))) (let ((.cse9 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse17 (<= |ULTIMATE.start_main_~A~0#1| 2)) (.cse32 (* 2 1)) (.cse15 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse6 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse25 (not .cse55)) (.cse51 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse33))) (.cse34 (and .cse56 (not .cse35))) (.cse52 (* (+ |ULTIMATE.start_main_~q~0#1| .cse37) |ULTIMATE.start_main_~B~0#1|)) (.cse36 (not .cse56)) (.cse53 (- .cse23)) (.cse24 (and (not .cse27) .cse55)) (.cse49 (not .cse5)) (.cse30 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse13 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|))) (let ((.cse0 (= .cse13 |ULTIMATE.start_main_~A~0#1|)) (.cse10 (or .cse49 .cse30)) (.cse2 (or (let ((.cse54 (+ |ULTIMATE.start_main_~r~0#1| .cse53))) (and (or (= (+ .cse51 .cse54) |ULTIMATE.start_main_~A~0#1|) .cse34) (or (= (+ .cse52 .cse54) |ULTIMATE.start_main_~A~0#1|) .cse35 .cse36))) .cse24)) (.cse4 (or .cse25 (let ((.cse50 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse53)))) (and (or .cse34 (= (+ .cse50 .cse51) |ULTIMATE.start_main_~A~0#1|)) (or .cse35 .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ .cse52 .cse50))))) .cse27)) (.cse7 (= |ULTIMATE.start_main_~A~0#1| (+ (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~d~0#1|)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|))))) (.cse18 (or .cse49 .cse6)) (.cse11 (= |ULTIMATE.start_main_~d~0#1| .cse15)) (.cse12 (= |ULTIMATE.start_main_~d~0#1| .cse32)) (.cse20 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse29 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse21 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse19 (= |ULTIMATE.start_main_~p~0#1| .cse32)) (.cse1 (= |ULTIMATE.start_main_~d~0#1| 1)) (.cse14 (<= |ULTIMATE.start_main_~r~0#1| 2)) (.cse16 (or (and (or (not .cse9) (not .cse17)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse9 .cse17))) (.cse8 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) .cse7 .cse8 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1)) (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|)) (and .cse9 .cse0 .cse3 .cse10 .cse11 .cse12 (<= .cse13 2) (<= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= 2 |ULTIMATE.start_main_~p~0#1|) .cse14 (>= .cse13 .cse15) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse16 (<= .cse15 .cse13) .cse17 .cse7 .cse8 .cse18 .cse19) (and .cse5 .cse6 .cse20 .cse21 .cse8) (let ((.cse22 (and (or (not (= .cse33 1)) .cse34) (or .cse35 .cse36 (not (= .cse37 1))))) (.cse26 (+ .cse23 1)) (.cse31 (* 2 .cse32))) (and .cse9 (<= |ULTIMATE.start_main_~q~0#1| 0) (or .cse22 (and (or (= .cse23 |ULTIMATE.start_main_~B~0#1|) .cse24) (or .cse25 (= |ULTIMATE.start_main_~B~0#1| .cse26) .cse27))) (let ((.cse28 (or .cse22 (and (or .cse25 .cse27 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse26)) |ULTIMATE.start_main_~A~0#1|)) (or .cse24 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse23 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse2 .cse3 .cse4 .cse10 .cse28 .cse20 .cse29 .cse21 .cse7 .cse8) (and .cse2 .cse3 .cse4 .cse28 .cse20 .cse29 .cse21 .cse7 .cse30 .cse8))) (>= |ULTIMATE.start_main_~r~0#1| .cse23) (= (* 2 .cse15) |ULTIMATE.start_main_~d~0#1|) (<= 2 .cse23) .cse14 (= |ULTIMATE.start_main_~p~0#1| .cse31) .cse16 (= |ULTIMATE.start_main_~d~0#1| .cse31) .cse17 .cse21 (>= |ULTIMATE.start_main_~r~0#1| .cse15) .cse8 .cse18 .cse27)) (and .cse11 .cse12 .cse20 .cse29 .cse21 .cse8 .cse19) (let ((.cse46 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (let ((.cse41 (+ .cse46 |ULTIMATE.start_main_~A~0#1|))) (let ((.cse42 (+ .cse41 |ULTIMATE.start_main_~r~0#1|))) (and .cse9 .cse1 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| 1))) (let ((.cse38 (div (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~r~0#1|)) 2)) (.cse40 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse39 (< .cse41 0))) (or (and (= |ULTIMATE.start_main_~d~0#1| .cse38) (or (not .cse39) .cse40)) (and (= |ULTIMATE.start_main_~d~0#1| (+ .cse38 1)) (not .cse40) .cse39))) .cse5 .cse6 (>= .cse42 .cse32) .cse14 .cse16 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (<= .cse15 (+ |ULTIMATE.start_main_~r~0#1| .cse15)) (or (exists ((|aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| Int)) (let ((.cse43 (* |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| (- 2)))) (let ((.cse44 (+ 2 .cse43)) (.cse45 (+ 2 .cse46 .cse43))) (and (<= .cse43 1) (<= .cse44 .cse45) (<= .cse43 .cse45) (<= |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| |ULTIMATE.start_main_~d~0#1|) (<= .cse44 1) (<= 0 .cse45))))) (and (< 0 2) (exists ((|aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| Int)) (let ((.cse47 (* |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| (- 2)))) (let ((.cse48 (+ 2 .cse46 .cse47))) (and (<= (+ 2 .cse47) .cse48) (<= |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41| |ULTIMATE.start_main_~d~0#1|) (<= (+ (* (- 1) |aux_div_v_ULTIMATE.start_main_~d~0#1_42_41|) 1) 0) (<= 0 .cse48))))))) .cse17 (>= .cse42 .cse15) .cse8 (= .cse41 .cse32) (or .cse3 (and .cse3 (<= 1 |ULTIMATE.start_main_~d~0#1|))) (= .cse41 .cse15) (<= (+ |ULTIMATE.start_main_~q~0#1| (* (- 1) 2)) 0)))))))))) [2023-02-17 02:07:17,961 INFO L899 garLoopResultBuilder]: For program point L37(lines 34 42) no Hoare annotation was computed. [2023-02-17 02:07:17,961 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 02:07:17,962 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse27 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse30 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse21 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (let ((.cse11 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse28 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse4 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse5 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse15 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse7 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse18 (and .cse30 (not .cse21))) (.cse22 (not .cse30)) (.cse26 (+ .cse27 1))) (let ((.cse6 (and (or (not (= .cse27 1)) .cse18) (or .cse21 .cse22 (not (= .cse26 1))))) (.cse10 (+ .cse7 1)) (.cse0 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse1 (let ((.cse29 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|))) (or (and .cse3 .cse29 .cse4 .cse5) (and .cse15 .cse29)))) (.cse9 (not .cse28)) (.cse8 (and (not .cse11) .cse28))) (let ((.cse12 (let ((.cse13 (let ((.cse20 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse27))) (.cse23 (* (+ |ULTIMATE.start_main_~q~0#1| .cse26) |ULTIMATE.start_main_~B~0#1|)) (.cse24 (- .cse7))) (let ((.cse14 (or (let ((.cse25 (+ |ULTIMATE.start_main_~r~0#1| .cse24))) (and (or (= (+ .cse20 .cse25) |ULTIMATE.start_main_~A~0#1|) .cse18) (or (= (+ .cse23 .cse25) |ULTIMATE.start_main_~A~0#1|) .cse21 .cse22))) .cse8)) (.cse16 (or .cse9 (let ((.cse19 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse24)))) (and (or .cse18 (= (+ .cse19 .cse20) |ULTIMATE.start_main_~A~0#1|)) (or .cse21 .cse22 (= |ULTIMATE.start_main_~A~0#1| (+ .cse23 .cse19))))) .cse11)) (.cse17 (= |ULTIMATE.start_main_~A~0#1| (+ (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~d~0#1|)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)))))) (or (and .cse14 .cse15 .cse16 .cse1 .cse17) (and .cse15 .cse1 .cse17) (and .cse14 .cse16 .cse1 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) .cse17 .cse5 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1)))))))) (or (and (or .cse6 (and (or .cse9 .cse11 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse10)) |ULTIMATE.start_main_~A~0#1|)) (or .cse8 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse7 |ULTIMATE.start_main_~q~0#1|)))))) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) .cse13) (and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|) .cse13)))) (.cse2 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (or .cse6 (and (or (= .cse7 |ULTIMATE.start_main_~B~0#1|) .cse8) (or .cse9 (= |ULTIMATE.start_main_~B~0#1| .cse10) .cse11))) .cse12 .cse2) (and .cse0 .cse2 .cse4 .cse5) (and .cse0 .cse12 .cse2 .cse5)))))) [2023-02-17 02:07:17,962 INFO L899 garLoopResultBuilder]: For program point L46(lines 44 56) no Hoare annotation was computed. [2023-02-17 02:07:17,962 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 02:07:17,963 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 42) the Hoare annotation is: (let ((.cse10 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse0 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse34 (<= |ULTIMATE.start_main_~A~0#1| 2))) (let ((.cse36 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse35 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~q~0#1| 0)) (.cse31 (<= |ULTIMATE.start_main_~r~0#1| 2)) (.cse33 (or (and (or (not .cse0) (not .cse34)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse34))) (.cse8 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse30 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse9 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse12 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse13 (or .cse10 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0) (not .cse10)))) (.cse37 (* 2 1))) (or (let ((.cse29 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse39 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse23 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (let ((.cse19 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse16 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse38 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse20 (and .cse39 (not .cse23))) (.cse24 (not .cse39)) (.cse28 (+ .cse29 1))) (let ((.cse14 (and (or (not (= .cse29 1)) .cse20) (or .cse23 .cse24 (not (= .cse28 1))))) (.cse18 (and (not .cse16) .cse38)) (.cse15 (not .cse38)) (.cse17 (+ .cse19 1)) (.cse32 (* 2 .cse37)) (.cse5 (not .cse36))) (and .cse0 .cse1 (let ((.cse22 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse29))) (.cse25 (* (+ |ULTIMATE.start_main_~q~0#1| .cse28) |ULTIMATE.start_main_~B~0#1|)) (.cse26 (- .cse19))) (let ((.cse2 (or (let ((.cse27 (+ |ULTIMATE.start_main_~r~0#1| .cse26))) (and (or (= (+ .cse22 .cse27) |ULTIMATE.start_main_~A~0#1|) .cse20) (or (= (+ .cse25 .cse27) |ULTIMATE.start_main_~A~0#1|) .cse23 .cse24))) .cse18)) (.cse3 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse4 (or .cse15 (let ((.cse21 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse26)))) (and (or .cse20 (= (+ .cse21 .cse22) |ULTIMATE.start_main_~A~0#1|)) (or .cse23 .cse24 (= |ULTIMATE.start_main_~A~0#1| (+ .cse25 .cse21))))) .cse16)) (.cse7 (or .cse14 (and (or .cse15 .cse16 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse17)) |ULTIMATE.start_main_~A~0#1|)) (or .cse18 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse19 |ULTIMATE.start_main_~q~0#1|))))))) (.cse11 (= |ULTIMATE.start_main_~A~0#1| (+ (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~d~0#1|)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|))))) (.cse6 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))) (or (and .cse2 .cse3 .cse4 (or .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse6 .cse12 .cse13)))) (or .cse14 (and (or (= .cse19 |ULTIMATE.start_main_~B~0#1|) .cse18) (or .cse15 (= |ULTIMATE.start_main_~B~0#1| .cse17) .cse16))) (>= |ULTIMATE.start_main_~r~0#1| .cse19) (= (* 2 .cse30) |ULTIMATE.start_main_~d~0#1|) (<= 2 .cse19) .cse31 (= |ULTIMATE.start_main_~p~0#1| .cse32) .cse33 (= |ULTIMATE.start_main_~d~0#1| .cse32) .cse34 .cse10 (>= |ULTIMATE.start_main_~r~0#1| .cse30) .cse12 (or .cse5 .cse35) .cse16)))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~d~0#1| 1) .cse36 .cse35 .cse31 .cse33 .cse8 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse34 .cse10 .cse12 .cse13) (and .cse0 .cse1 (= |ULTIMATE.start_main_~d~0#1| .cse30) (= |ULTIMATE.start_main_~d~0#1| .cse37) (= 2 |ULTIMATE.start_main_~p~0#1|) .cse31 (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse33 .cse8 (<= .cse30 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse34 .cse9 .cse10 .cse12 .cse13 (= |ULTIMATE.start_main_~p~0#1| .cse37))))) [2023-02-17 02:07:17,963 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-02-17 02:07:17,963 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse10 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse0 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse34 (<= |ULTIMATE.start_main_~A~0#1| 2))) (let ((.cse36 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse35 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~q~0#1| 0)) (.cse31 (<= |ULTIMATE.start_main_~r~0#1| 2)) (.cse33 (or (and (or (not .cse0) (not .cse34)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse34))) (.cse8 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse30 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse9 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse12 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse13 (or .cse10 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0) (not .cse10)))) (.cse37 (* 2 1))) (or (let ((.cse29 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse39 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse23 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (let ((.cse19 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse16 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse38 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse20 (and .cse39 (not .cse23))) (.cse24 (not .cse39)) (.cse28 (+ .cse29 1))) (let ((.cse14 (and (or (not (= .cse29 1)) .cse20) (or .cse23 .cse24 (not (= .cse28 1))))) (.cse18 (and (not .cse16) .cse38)) (.cse15 (not .cse38)) (.cse17 (+ .cse19 1)) (.cse32 (* 2 .cse37)) (.cse5 (not .cse36))) (and .cse0 .cse1 (let ((.cse22 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse29))) (.cse25 (* (+ |ULTIMATE.start_main_~q~0#1| .cse28) |ULTIMATE.start_main_~B~0#1|)) (.cse26 (- .cse19))) (let ((.cse2 (or (let ((.cse27 (+ |ULTIMATE.start_main_~r~0#1| .cse26))) (and (or (= (+ .cse22 .cse27) |ULTIMATE.start_main_~A~0#1|) .cse20) (or (= (+ .cse25 .cse27) |ULTIMATE.start_main_~A~0#1|) .cse23 .cse24))) .cse18)) (.cse3 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse4 (or .cse15 (let ((.cse21 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse26)))) (and (or .cse20 (= (+ .cse21 .cse22) |ULTIMATE.start_main_~A~0#1|)) (or .cse23 .cse24 (= |ULTIMATE.start_main_~A~0#1| (+ .cse25 .cse21))))) .cse16)) (.cse7 (or .cse14 (and (or .cse15 .cse16 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse17)) |ULTIMATE.start_main_~A~0#1|)) (or .cse18 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse19 |ULTIMATE.start_main_~q~0#1|))))))) (.cse11 (= |ULTIMATE.start_main_~A~0#1| (+ (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~d~0#1|)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|))))) (.cse6 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))) (or (and .cse2 .cse3 .cse4 (or .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse6 .cse12 .cse13)))) (or .cse14 (and (or (= .cse19 |ULTIMATE.start_main_~B~0#1|) .cse18) (or .cse15 (= |ULTIMATE.start_main_~B~0#1| .cse17) .cse16))) (>= |ULTIMATE.start_main_~r~0#1| .cse19) (= (* 2 .cse30) |ULTIMATE.start_main_~d~0#1|) (<= 2 .cse19) .cse31 (= |ULTIMATE.start_main_~p~0#1| .cse32) .cse33 (= |ULTIMATE.start_main_~d~0#1| .cse32) .cse34 .cse10 (>= |ULTIMATE.start_main_~r~0#1| .cse30) .cse12 (or .cse5 .cse35) .cse16)))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~d~0#1| 1) .cse36 .cse35 .cse31 .cse33 .cse8 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse34 .cse10 .cse12 .cse13) (and .cse0 .cse1 (= |ULTIMATE.start_main_~d~0#1| .cse30) (= |ULTIMATE.start_main_~d~0#1| .cse37) (= 2 |ULTIMATE.start_main_~p~0#1|) .cse31 (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse33 .cse8 (<= .cse30 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse34 .cse9 .cse10 .cse12 .cse13 (= |ULTIMATE.start_main_~p~0#1| .cse37))))) [2023-02-17 02:07:17,964 INFO L895 garLoopResultBuilder]: At program point L35-1(line 35) the Hoare annotation is: (let ((.cse10 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse0 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse34 (<= |ULTIMATE.start_main_~A~0#1| 2))) (let ((.cse36 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse35 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~q~0#1| 0)) (.cse31 (<= |ULTIMATE.start_main_~r~0#1| 2)) (.cse33 (or (and (or (not .cse0) (not .cse34)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse34))) (.cse8 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse30 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse9 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse12 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse13 (or .cse10 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0) (not .cse10)))) (.cse37 (* 2 1))) (or (let ((.cse29 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse39 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse23 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (let ((.cse19 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse16 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse38 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse20 (and .cse39 (not .cse23))) (.cse24 (not .cse39)) (.cse28 (+ .cse29 1))) (let ((.cse14 (and (or (not (= .cse29 1)) .cse20) (or .cse23 .cse24 (not (= .cse28 1))))) (.cse18 (and (not .cse16) .cse38)) (.cse15 (not .cse38)) (.cse17 (+ .cse19 1)) (.cse32 (* 2 .cse37)) (.cse5 (not .cse36))) (and .cse0 .cse1 (let ((.cse22 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse29))) (.cse25 (* (+ |ULTIMATE.start_main_~q~0#1| .cse28) |ULTIMATE.start_main_~B~0#1|)) (.cse26 (- .cse19))) (let ((.cse2 (or (let ((.cse27 (+ |ULTIMATE.start_main_~r~0#1| .cse26))) (and (or (= (+ .cse22 .cse27) |ULTIMATE.start_main_~A~0#1|) .cse20) (or (= (+ .cse25 .cse27) |ULTIMATE.start_main_~A~0#1|) .cse23 .cse24))) .cse18)) (.cse3 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse4 (or .cse15 (let ((.cse21 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse26)))) (and (or .cse20 (= (+ .cse21 .cse22) |ULTIMATE.start_main_~A~0#1|)) (or .cse23 .cse24 (= |ULTIMATE.start_main_~A~0#1| (+ .cse25 .cse21))))) .cse16)) (.cse7 (or .cse14 (and (or .cse15 .cse16 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse17)) |ULTIMATE.start_main_~A~0#1|)) (or .cse18 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse19 |ULTIMATE.start_main_~q~0#1|))))))) (.cse11 (= |ULTIMATE.start_main_~A~0#1| (+ (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~d~0#1|)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|))))) (.cse6 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))) (or (and .cse2 .cse3 .cse4 (or .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse6 .cse12 .cse13)))) (or .cse14 (and (or (= .cse19 |ULTIMATE.start_main_~B~0#1|) .cse18) (or .cse15 (= |ULTIMATE.start_main_~B~0#1| .cse17) .cse16))) (>= |ULTIMATE.start_main_~r~0#1| .cse19) (= (* 2 .cse30) |ULTIMATE.start_main_~d~0#1|) (<= 2 .cse19) .cse31 (= |ULTIMATE.start_main_~p~0#1| .cse32) .cse33 (= |ULTIMATE.start_main_~d~0#1| .cse32) .cse34 .cse10 (>= |ULTIMATE.start_main_~r~0#1| .cse30) .cse12 (or .cse5 .cse35) .cse16)))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~d~0#1| 1) .cse36 .cse35 .cse31 .cse33 .cse8 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse34 .cse10 .cse12 .cse13) (and .cse0 .cse1 (= |ULTIMATE.start_main_~d~0#1| .cse30) (= |ULTIMATE.start_main_~d~0#1| .cse37) (= 2 |ULTIMATE.start_main_~p~0#1|) .cse31 (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse33 .cse8 (<= .cse30 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse34 .cse9 .cse10 .cse12 .cse13 (= |ULTIMATE.start_main_~p~0#1| .cse37))))) [2023-02-17 02:07:17,964 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-02-17 02:07:17,964 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-02-17 02:07:17,964 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-02-17 02:07:17,964 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-02-17 02:07:17,964 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-02-17 02:07:17,965 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-17 02:07:17,967 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:07:17,969 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 02:07:17,983 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-17 02:07:17,984 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-17 02:07:17,984 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-17 02:07:17,984 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-17 02:07:17,985 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-17 02:07:17,985 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-17 02:07:17,985 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-17 02:07:17,985 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-17 02:07:17,985 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-17 02:07:17,985 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-17 02:07:17,985 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-17 02:07:17,986 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-17 02:07:17,986 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-17 02:07:18,003 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-17 02:07:18,003 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-17 02:07:18,003 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-17 02:07:18,003 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-17 02:07:18,004 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-17 02:07:18,004 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-17 02:07:18,004 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-17 02:07:18,004 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-17 02:07:18,004 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-17 02:07:18,005 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-17 02:07:18,005 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-17 02:07:18,005 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-17 02:07:18,005 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-17 02:07:18,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 02:07:18 BoogieIcfgContainer [2023-02-17 02:07:18,013 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 02:07:18,013 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 02:07:18,014 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 02:07:18,014 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 02:07:18,014 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:07:03" (3/4) ... [2023-02-17 02:07:18,018 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 02:07:18,023 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-17 02:07:18,026 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-02-17 02:07:18,027 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-02-17 02:07:18,027 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-02-17 02:07:18,027 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 02:07:18,027 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 02:07:18,046 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((A >= 0 && d + r == A) && A == B * q + r) && (!(p == 1) || d * q + r == A)) && d == 2 * B) && d == 2 * 1) && d + r <= 2) && -1 * p + q <= 0) && 2 == p) && r <= 2) && d + r >= 2 * B) && 2 <= d) && (((!(A >= 0) || !(A <= 2)) && cond == 0) || ((cond == 1 && A >= 0) && A <= 2))) && 2 * B <= d + r) && A <= 2) && A == r + -d + B * (p + q)) && B == 1) && (!(p == 1) || B == d)) && p == 2 * 1) || ((((((((((d + r == A && d == 1) && (((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0))) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && p == 1) && B == d) && r == -B + A) && A == r + -d + B * (p + q)) && B == 1) && q == 0 + 1) && p + 0 == q)) || ((((p == 1 && B == d) && q == 0) && A == r) && B == 1)) || ((((((((((((((((A >= 0 && q <= 0) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) || ((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1))) && r >= d / 2) && 2 * (2 * B) == d) && 2 <= d / 2) && r <= 2) && p == 2 * (2 * 1)) && (((!(A >= 0) || !(A <= 2)) && cond == 0) || ((cond == 1 && A >= 0) && A <= 2))) && d == 2 * (2 * 1)) && A <= 2) && A == r) && r >= 2 * B) && B == 1) && (!(p == 1) || B == d)) && d % 2 == 0)) || ((((((d == 2 * B && d == 2 * 1) && q == 0) && B * p == d) && A == r) && B == 1) && p == 2 * 1)) || (((((((((((((((A >= 0 && d == 1) && ((d == (A + -r) / 2 && (!(-1 * r + A < 0) || (A + r) % 2 == 0)) || ((d == (A + -r) / 2 + 1 && !((A + r) % 2 == 0)) && -1 * r + A < 0))) && p == 1) && B == d) && r <= 2) && (((!(A >= 0) || !(A <= 2)) && cond == 0) || ((cond == 1 && A >= 0) && A <= 2))) && !(r >= d)) && 2 * B <= r + 2 * B) && ((\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 <= 1 && 2 + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 <= 2 + -1 * r + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2) && aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 <= 2 + -1 * r + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2) && aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 <= d) && 2 + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 <= 1) && 0 <= 2 + -1 * r + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2) || (0 < 2 && (\exists aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 : int :: ((2 + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 <= 2 + -1 * r + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 && aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 <= d) && -1 * aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 + 1 <= 0) && 0 <= 2 + -1 * r + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2)))) && A <= 2) && -1 * r + A + r >= 2 * B) && B == 1) && (A == B * q + r || (A == B * q + r && 1 <= d))) && -1 * r + A == 2 * B) && q + -1 * 2 <= 0) [2023-02-17 02:07:18,054 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 02:07:18,054 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 02:07:18,055 INFO L158 Benchmark]: Toolchain (without parser) took 14602.54ms. Allocated memory was 130.0MB in the beginning and 192.9MB in the end (delta: 62.9MB). Free memory was 83.4MB in the beginning and 53.9MB in the end (delta: 29.5MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB. [2023-02-17 02:07:18,055 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory was 71.1MB in the beginning and 71.0MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 02:07:18,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.19ms. Allocated memory is still 130.0MB. Free memory was 83.0MB in the beginning and 72.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 02:07:18,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.83ms. Allocated memory is still 130.0MB. Free memory was 72.5MB in the beginning and 71.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 02:07:18,056 INFO L158 Benchmark]: Boogie Preprocessor took 21.64ms. Allocated memory is still 130.0MB. Free memory was 71.0MB in the beginning and 70.0MB in the end (delta: 951.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 02:07:18,056 INFO L158 Benchmark]: RCFGBuilder took 274.19ms. Allocated memory was 130.0MB in the beginning and 159.4MB in the end (delta: 29.4MB). Free memory was 70.0MB in the beginning and 128.9MB in the end (delta: -58.9MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2023-02-17 02:07:18,057 INFO L158 Benchmark]: TraceAbstraction took 14013.76ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 127.8MB in the beginning and 57.1MB in the end (delta: 70.8MB). Peak memory consumption was 105.3MB. Max. memory is 16.1GB. [2023-02-17 02:07:18,057 INFO L158 Benchmark]: Witness Printer took 40.99ms. Allocated memory is still 192.9MB. Free memory was 57.1MB in the beginning and 53.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 02:07:18,058 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.18ms. Allocated memory is still 130.0MB. Free memory was 71.1MB in the beginning and 71.0MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.19ms. Allocated memory is still 130.0MB. Free memory was 83.0MB in the beginning and 72.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.83ms. Allocated memory is still 130.0MB. Free memory was 72.5MB in the beginning and 71.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.64ms. Allocated memory is still 130.0MB. Free memory was 71.0MB in the beginning and 70.0MB in the end (delta: 951.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 274.19ms. Allocated memory was 130.0MB in the beginning and 159.4MB in the end (delta: 29.4MB). Free memory was 70.0MB in the beginning and 128.9MB in the end (delta: -58.9MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14013.76ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 127.8MB in the beginning and 57.1MB in the end (delta: 70.8MB). Peak memory consumption was 105.3MB. Max. memory is 16.1GB. * Witness Printer took 40.99ms. Allocated memory is still 192.9MB. Free memory was 57.1MB in the beginning and 53.9MB in the end (delta: 3.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: 13.9s, OverallIterations: 12, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 282 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 233 mSDsluCounter, 1120 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 771 mSDsCounter, 269 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2493 IncrementalHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 269 mSolverCounterUnsat, 349 mSDtfsCounter, 2493 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1014 GetRequests, 850 SyntacticMatches, 8 SemanticMatches, 156 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=6, InterpolantAutomatonStates: 107, 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, 50 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 92 PreInvPairs, 132 NumberOfFragments, 13768 HoareAnnotationTreeSize, 92 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 632 NumberOfCodeBlocks, 632 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 945 ConstructedInterpolants, 1 QuantifiedInterpolants, 17543 SizeOfPredicates, 43 NumberOfNonLiveVariables, 1610 ConjunctsInSsa, 254 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 2863/3282 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-17 02:07:18,067 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-17 02:07:18,067 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-17 02:07:18,067 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-17 02:07:18,068 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-17 02:07:18,068 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-17 02:07:18,068 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-17 02:07:18,068 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-17 02:07:18,068 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-17 02:07:18,068 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-17 02:07:18,068 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-17 02:07:18,069 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-17 02:07:18,069 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-17 02:07:18,069 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-17 02:07:18,071 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-17 02:07:18,071 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-17 02:07:18,072 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-17 02:07:18,072 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-17 02:07:18,072 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-17 02:07:18,072 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-17 02:07:18,072 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-17 02:07:18,072 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-17 02:07:18,073 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-17 02:07:18,073 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-17 02:07:18,073 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-17 02:07:18,073 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-17 02:07:18,073 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: ((((((((((((((((((((((A >= 0 && d + r == A) && A == B * q + r) && (!(p == 1) || d * q + r == A)) && d == 2 * B) && d == 2 * 1) && d + r <= 2) && -1 * p + q <= 0) && 2 == p) && r <= 2) && d + r >= 2 * B) && 2 <= d) && (((!(A >= 0) || !(A <= 2)) && cond == 0) || ((cond == 1 && A >= 0) && A <= 2))) && 2 * B <= d + r) && A <= 2) && A == r + -d + B * (p + q)) && B == 1) && (!(p == 1) || B == d)) && p == 2 * 1) || ((((((((((d + r == A && d == 1) && (((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0))) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && p == 1) && B == d) && r == -B + A) && A == r + -d + B * (p + q)) && B == 1) && q == 0 + 1) && p + 0 == q)) || ((((p == 1 && B == d) && q == 0) && A == r) && B == 1)) || ((((((((((((((((A >= 0 && q <= 0) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) || ((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1))) && r >= d / 2) && 2 * (2 * B) == d) && 2 <= d / 2) && r <= 2) && p == 2 * (2 * 1)) && (((!(A >= 0) || !(A <= 2)) && cond == 0) || ((cond == 1 && A >= 0) && A <= 2))) && d == 2 * (2 * 1)) && A <= 2) && A == r) && r >= 2 * B) && B == 1) && (!(p == 1) || B == d)) && d % 2 == 0)) || ((((((d == 2 * B && d == 2 * 1) && q == 0) && B * p == d) && A == r) && B == 1) && p == 2 * 1)) || (((((((((((((((A >= 0 && d == 1) && ((d == (A + -r) / 2 && (!(-1 * r + A < 0) || (A + r) % 2 == 0)) || ((d == (A + -r) / 2 + 1 && !((A + r) % 2 == 0)) && -1 * r + A < 0))) && p == 1) && B == d) && r <= 2) && (((!(A >= 0) || !(A <= 2)) && cond == 0) || ((cond == 1 && A >= 0) && A <= 2))) && !(r >= d)) && 2 * B <= r + 2 * B) && ((\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 <= 1 && 2 + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 <= 2 + -1 * r + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2) && aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 <= 2 + -1 * r + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2) && aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 <= d) && 2 + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 <= 1) && 0 <= 2 + -1 * r + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2) || (0 < 2 && (\exists aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 : int :: ((2 + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 <= 2 + -1 * r + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2 && aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 <= d) && -1 * aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 + 1 <= 0) && 0 <= 2 + -1 * r + aux_div_v_ULTIMATE.start_main_~d~0#1_42_41 * -2)))) && A <= 2) && -1 * r + A + r >= 2 * B) && B == 1) && (A == B * q + r || (A == B * q + r && 1 <= d))) && -1 * r + A == 2 * B) && q + -1 * 2 <= 0) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((((((((((((A >= 0 && q <= 0) && ((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && r >= d / 2) && 2 * (2 * B) == d) && 2 <= d / 2) && r <= 2) && p == 2 * (2 * 1)) && (((!(A >= 0) || !(A <= 2)) && cond == 0) || ((cond == 1 && A >= 0) && A <= 2))) && d == 2 * (2 * 1)) && A <= 2) && A == r) && r >= 2 * B) && B == 1) && (!(p == 1) || B == d)) && d % 2 == 0) || ((((((((((((A >= 0 && q <= 0) && d == 1) && p == 1) && B == d) && r <= 2) && (((!(A >= 0) || !(A <= 2)) && cond == 0) || ((cond == 1 && A >= 0) && A <= 2))) && q == 0) && 1 <= d) && A <= 2) && A == r) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r))))) || (((((((((((((((A >= 0 && q <= 0) && d == 2 * B) && d == 2 * 1) && 2 == p) && r <= 2) && 2 <= d) && (((!(A >= 0) || !(A <= 2)) && cond == 0) || ((cond == 1 && A >= 0) && A <= 2))) && q == 0) && 2 * B <= d + r) && A <= 2) && B * p == d) && A == r) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) && p == 2 * 1) RESULT: Ultimate proved your program to be correct! [2023-02-17 02:07:18,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE