./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound20.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/egcd-ll_valuebound20.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 20f9ce6814caacb533e5bf2143ac3e067387f11238548a0b9b41e2de8e2cc436 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 01:55:49,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 01:55:49,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 01:55:49,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 01:55:49,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 01:55:49,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 01:55:49,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 01:55:49,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 01:55:49,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 01:55:49,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 01:55:49,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 01:55:49,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 01:55:49,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 01:55:49,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 01:55:49,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 01:55:49,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 01:55:49,063 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 01:55:49,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 01:55:49,065 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 01:55:49,066 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 01:55:49,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 01:55:49,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 01:55:49,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 01:55:49,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 01:55:49,092 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 01:55:49,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 01:55:49,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 01:55:49,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 01:55:49,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 01:55:49,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 01:55:49,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 01:55:49,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 01:55:49,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 01:55:49,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 01:55:49,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 01:55:49,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 01:55:49,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 01:55:49,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 01:55:49,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 01:55:49,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 01:55:49,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 01:55:49,106 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 01:55:49,139 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 01:55:49,139 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 01:55:49,139 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 01:55:49,140 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 01:55:49,140 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 01:55:49,140 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 01:55:49,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 01:55:49,141 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 01:55:49,141 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 01:55:49,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 01:55:49,142 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 01:55:49,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 01:55:49,142 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 01:55:49,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 01:55:49,143 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 01:55:49,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 01:55:49,143 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 01:55:49,143 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 01:55:49,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 01:55:49,143 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 01:55:49,143 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 01:55:49,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 01:55:49,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 01:55:49,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 01:55:49,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 01:55:49,144 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 01:55:49,144 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 01:55:49,145 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 01:55:49,145 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 01:55:49,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 01:55:49,145 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 01:55:49,145 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 01:55:49,145 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 01:55:49,146 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 01:55:49,146 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 01:55:49,156 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 -> 20f9ce6814caacb533e5bf2143ac3e067387f11238548a0b9b41e2de8e2cc436 [2023-02-18 01:55:49,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 01:55:49,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 01:55:49,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 01:55:49,404 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 01:55:49,404 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 01:55:49,405 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound20.c [2023-02-18 01:55:50,393 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 01:55:50,598 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 01:55:50,598 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound20.c [2023-02-18 01:55:50,604 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70a505b49/41ca6427d7b748acbc826bb505ee0ecf/FLAG45f8ddc68 [2023-02-18 01:55:50,620 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70a505b49/41ca6427d7b748acbc826bb505ee0ecf [2023-02-18 01:55:50,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 01:55:50,623 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 01:55:50,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 01:55:50,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 01:55:50,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 01:55:50,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:55:50" (1/1) ... [2023-02-18 01:55:50,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38ac8da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:50, skipping insertion in model container [2023-02-18 01:55:50,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:55:50" (1/1) ... [2023-02-18 01:55:50,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 01:55:50,646 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 01:55:50,728 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/egcd-ll_valuebound20.c[489,502] [2023-02-18 01:55:50,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 01:55:50,744 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 01:55:50,751 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/egcd-ll_valuebound20.c[489,502] [2023-02-18 01:55:50,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 01:55:50,775 INFO L208 MainTranslator]: Completed translation [2023-02-18 01:55:50,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:50 WrapperNode [2023-02-18 01:55:50,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 01:55:50,778 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 01:55:50,778 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 01:55:50,778 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 01:55:50,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:50" (1/1) ... [2023-02-18 01:55:50,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:50" (1/1) ... [2023-02-18 01:55:50,801 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2023-02-18 01:55:50,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 01:55:50,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 01:55:50,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 01:55:50,802 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 01:55:50,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:50" (1/1) ... [2023-02-18 01:55:50,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:50" (1/1) ... [2023-02-18 01:55:50,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:50" (1/1) ... [2023-02-18 01:55:50,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:50" (1/1) ... [2023-02-18 01:55:50,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:50" (1/1) ... [2023-02-18 01:55:50,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:50" (1/1) ... [2023-02-18 01:55:50,814 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:50" (1/1) ... [2023-02-18 01:55:50,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:50" (1/1) ... [2023-02-18 01:55:50,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 01:55:50,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 01:55:50,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 01:55:50,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 01:55:50,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:50" (1/1) ... [2023-02-18 01:55:50,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 01:55:50,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:55:50,846 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-18 01:55:50,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-18 01:55:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 01:55:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-18 01:55:50,884 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-18 01:55:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 01:55:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 01:55:50,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 01:55:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 01:55:50,884 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 01:55:50,924 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 01:55:50,926 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 01:55:51,013 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 01:55:51,017 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 01:55:51,017 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 01:55:51,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:55:51 BoogieIcfgContainer [2023-02-18 01:55:51,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 01:55:51,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 01:55:51,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 01:55:51,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 01:55:51,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 01:55:50" (1/3) ... [2023-02-18 01:55:51,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6452b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:55:51, skipping insertion in model container [2023-02-18 01:55:51,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:50" (2/3) ... [2023-02-18 01:55:51,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6452b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:55:51, skipping insertion in model container [2023-02-18 01:55:51,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:55:51" (3/3) ... [2023-02-18 01:55:51,024 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_valuebound20.c [2023-02-18 01:55:51,035 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 01:55:51,036 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 01:55:51,091 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 01:55:51,098 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;@b808a42, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 01:55:51,099 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 01:55:51,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 01:55:51,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 01:55:51,108 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:55:51,109 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:55:51,109 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:55:51,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:55:51,117 INFO L85 PathProgramCache]: Analyzing trace with hash 501437177, now seen corresponding path program 1 times [2023-02-18 01:55:51,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:55:51,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848484266] [2023-02-18 01:55:51,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:51,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:55:51,223 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:55:51,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [471348560] [2023-02-18 01:55:51,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:51,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:55:51,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:55:51,227 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:55:51,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 01:55:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:55:51,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 01:55:51,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:55:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 01:55:51,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:55:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-18 01:55:51,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:55:51,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848484266] [2023-02-18 01:55:51,458 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:55:51,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471348560] [2023-02-18 01:55:51,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471348560] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 01:55:51,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:55:51,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-02-18 01:55:51,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311770271] [2023-02-18 01:55:51,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:55:51,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 01:55:51,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:55:51,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 01:55:51,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-02-18 01:55:51,485 INFO L87 Difference]: Start difference. First operand has 32 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 01:55:51,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:55:51,568 INFO L93 Difference]: Finished difference Result 79 states and 134 transitions. [2023-02-18 01:55:51,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 01:55:51,570 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2023-02-18 01:55:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:55:51,575 INFO L225 Difference]: With dead ends: 79 [2023-02-18 01:55:51,576 INFO L226 Difference]: Without dead ends: 42 [2023-02-18 01:55:51,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-02-18 01:55:51,581 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 01:55:51,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 145 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 01:55:51,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-18 01:55:51,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2023-02-18 01:55:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-18 01:55:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2023-02-18 01:55:51,615 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 29 [2023-02-18 01:55:51,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:55:51,616 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2023-02-18 01:55:51,616 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 01:55:51,616 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2023-02-18 01:55:51,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-18 01:55:51,617 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:55:51,618 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:55:51,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-18 01:55:51,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-18 01:55:51,824 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:55:51,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:55:51,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1017640517, now seen corresponding path program 1 times [2023-02-18 01:55:51,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:55:51,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460241150] [2023-02-18 01:55:51,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:51,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:55:51,842 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:55:51,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1580871706] [2023-02-18 01:55:51,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:51,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:55:51,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:55:51,848 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:55:51,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 01:55:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:55:51,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-18 01:55:51,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:55:52,042 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 01:55:52,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:55:52,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:55:52,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460241150] [2023-02-18 01:55:52,085 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:55:52,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580871706] [2023-02-18 01:55:52,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580871706] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:55:52,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:55:52,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-18 01:55:52,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810666827] [2023-02-18 01:55:52,086 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:55:52,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 01:55:52,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:55:52,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 01:55:52,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:55:52,088 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 01:55:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:55:52,264 INFO L93 Difference]: Finished difference Result 66 states and 98 transitions. [2023-02-18 01:55:52,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 01:55:52,265 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2023-02-18 01:55:52,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:55:52,267 INFO L225 Difference]: With dead ends: 66 [2023-02-18 01:55:52,267 INFO L226 Difference]: Without dead ends: 64 [2023-02-18 01:55:52,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-02-18 01:55:52,268 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:55:52,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 94 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:55:52,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-18 01:55:52,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2023-02-18 01:55:52,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 31 states have internal predecessors, (38), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-18 01:55:52,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2023-02-18 01:55:52,281 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 34 [2023-02-18 01:55:52,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:55:52,281 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2023-02-18 01:55:52,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 01:55:52,282 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2023-02-18 01:55:52,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-18 01:55:52,282 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:55:52,283 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:55:52,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-18 01:55:52,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-18 01:55:52,487 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:55:52,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:55:52,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1133401081, now seen corresponding path program 1 times [2023-02-18 01:55:52,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:55:52,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61064776] [2023-02-18 01:55:52,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:52,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:55:52,519 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:55:52,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [881570984] [2023-02-18 01:55:52,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:52,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:55:52,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:55:52,520 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:55:52,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 01:55:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:55:52,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 01:55:52,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:55:52,587 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-18 01:55:52,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:55:52,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:55:52,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61064776] [2023-02-18 01:55:52,611 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:55:52,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881570984] [2023-02-18 01:55:52,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881570984] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:55:52,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:55:52,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2023-02-18 01:55:52,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102107719] [2023-02-18 01:55:52,612 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:55:52,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 01:55:52,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:55:52,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 01:55:52,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-02-18 01:55:52,613 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-18 01:55:52,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:55:52,708 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2023-02-18 01:55:52,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 01:55:52,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2023-02-18 01:55:52,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:55:52,709 INFO L225 Difference]: With dead ends: 64 [2023-02-18 01:55:52,709 INFO L226 Difference]: Without dead ends: 60 [2023-02-18 01:55:52,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-02-18 01:55:52,710 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:55:52,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 145 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:55:52,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-18 01:55:52,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-02-18 01:55:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 32 states have (on average 1.28125) internal successors, (41), 34 states have internal predecessors, (41), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 01:55:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2023-02-18 01:55:52,719 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 39 [2023-02-18 01:55:52,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:55:52,720 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2023-02-18 01:55:52,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-18 01:55:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2023-02-18 01:55:52,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-18 01:55:52,721 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:55:52,721 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:55:52,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-18 01:55:52,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:55:52,926 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:55:52,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:55:52,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1954831506, now seen corresponding path program 1 times [2023-02-18 01:55:52,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:55:52,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154989332] [2023-02-18 01:55:52,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:52,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:55:52,937 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:55:52,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1855986152] [2023-02-18 01:55:52,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:52,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:55:52,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:55:52,939 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:55:52,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 01:55:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:55:52,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 01:55:52,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:55:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-18 01:55:52,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 01:55:52,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:55:52,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154989332] [2023-02-18 01:55:52,984 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:55:52,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855986152] [2023-02-18 01:55:52,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855986152] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 01:55:52,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 01:55:52,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 01:55:52,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157873324] [2023-02-18 01:55:52,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:55:52,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 01:55:52,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:55:52,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 01:55:52,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 01:55:52,986 INFO L87 Difference]: Start difference. First operand 60 states and 83 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-02-18 01:55:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:55:53,014 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2023-02-18 01:55:53,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 01:55:53,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 45 [2023-02-18 01:55:53,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:55:53,016 INFO L225 Difference]: With dead ends: 66 [2023-02-18 01:55:53,016 INFO L226 Difference]: Without dead ends: 64 [2023-02-18 01:55:53,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 01:55:53,017 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 5 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 01:55:53,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 123 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 01:55:53,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-18 01:55:53,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-02-18 01:55:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 37 states have internal predecessors, (44), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 01:55:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2023-02-18 01:55:53,025 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 86 transitions. Word has length 45 [2023-02-18 01:55:53,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:55:53,025 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 86 transitions. [2023-02-18 01:55:53,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-02-18 01:55:53,026 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2023-02-18 01:55:53,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-18 01:55:53,027 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:55:53,027 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:55:53,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 01:55:53,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:55:53,231 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:55:53,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:55:53,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1265228631, now seen corresponding path program 1 times [2023-02-18 01:55:53,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:55:53,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524627031] [2023-02-18 01:55:53,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:53,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:55:53,241 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:55:53,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1277801101] [2023-02-18 01:55:53,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:53,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:55:53,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:55:53,242 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:55:53,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 01:55:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:55:53,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 01:55:53,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:55:53,318 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-18 01:55:53,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:55:53,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:55:53,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524627031] [2023-02-18 01:55:53,366 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:55:53,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277801101] [2023-02-18 01:55:53,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277801101] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:55:53,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:55:53,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2023-02-18 01:55:53,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102226151] [2023-02-18 01:55:53,366 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:55:53,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 01:55:53,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:55:53,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 01:55:53,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-02-18 01:55:53,367 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 01:55:53,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:55:53,426 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2023-02-18 01:55:53,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 01:55:53,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2023-02-18 01:55:53,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:55:53,428 INFO L225 Difference]: With dead ends: 80 [2023-02-18 01:55:53,428 INFO L226 Difference]: Without dead ends: 78 [2023-02-18 01:55:53,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-02-18 01:55:53,428 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 01:55:53,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 149 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 01:55:53,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-18 01:55:53,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2023-02-18 01:55:53,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 8 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-18 01:55:53,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2023-02-18 01:55:53,438 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 47 [2023-02-18 01:55:53,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:55:53,438 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2023-02-18 01:55:53,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 01:55:53,438 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2023-02-18 01:55:53,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-18 01:55:53,439 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:55:53,439 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:55:53,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-18 01:55:53,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:55:53,646 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:55:53,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:55:53,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1617953190, now seen corresponding path program 1 times [2023-02-18 01:55:53,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:55:53,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558225810] [2023-02-18 01:55:53,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:53,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:55:53,656 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:55:53,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1742450468] [2023-02-18 01:55:53,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:53,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:55:53,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:55:53,685 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:55:53,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 01:55:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:55:53,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-18 01:55:53,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:55:53,747 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-18 01:55:53,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:55:53,808 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-18 01:55:53,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:55:53,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558225810] [2023-02-18 01:55:53,808 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:55:53,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742450468] [2023-02-18 01:55:53,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742450468] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:55:53,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:55:53,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2023-02-18 01:55:53,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712603857] [2023-02-18 01:55:53,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:55:53,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 01:55:53,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:55:53,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 01:55:53,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-18 01:55:53,810 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-18 01:55:53,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:55:53,906 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2023-02-18 01:55:53,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 01:55:53,907 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 50 [2023-02-18 01:55:53,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:55:53,907 INFO L225 Difference]: With dead ends: 84 [2023-02-18 01:55:53,908 INFO L226 Difference]: Without dead ends: 80 [2023-02-18 01:55:53,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:55:53,908 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:55:53,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 136 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:55:53,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-18 01:55:53,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-02-18 01:55:53,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-02-18 01:55:53,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2023-02-18 01:55:53,918 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 50 [2023-02-18 01:55:53,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:55:53,919 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2023-02-18 01:55:53,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-18 01:55:53,919 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2023-02-18 01:55:53,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-18 01:55:53,920 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:55:53,920 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:55:53,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 01:55:54,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:55:54,125 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:55:54,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:55:54,125 INFO L85 PathProgramCache]: Analyzing trace with hash 860577929, now seen corresponding path program 1 times [2023-02-18 01:55:54,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:55:54,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539678114] [2023-02-18 01:55:54,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:54,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:55:54,133 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:55:54,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2092601225] [2023-02-18 01:55:54,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:54,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:55:54,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:55:54,149 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:55:54,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 01:55:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:55:54,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-18 01:55:54,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:55:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-02-18 01:55:54,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:55:54,399 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-02-18 01:55:54,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:55:54,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539678114] [2023-02-18 01:55:54,400 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:55:54,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092601225] [2023-02-18 01:55:54,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092601225] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:55:54,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:55:54,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-18 01:55:54,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804136688] [2023-02-18 01:55:54,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:55:54,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 01:55:54,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:55:54,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 01:55:54,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:55:54,403 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-18 01:55:55,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:55:57,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:55:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:55:58,416 INFO L93 Difference]: Finished difference Result 121 states and 155 transitions. [2023-02-18 01:55:58,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 01:55:58,417 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 52 [2023-02-18 01:55:58,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:55:58,418 INFO L225 Difference]: With dead ends: 121 [2023-02-18 01:55:58,418 INFO L226 Difference]: Without dead ends: 119 [2023-02-18 01:55:58,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2023-02-18 01:55:58,419 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 27 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-02-18 01:55:58,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 152 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 380 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2023-02-18 01:55:58,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-18 01:55:58,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2023-02-18 01:55:58,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 62 states have internal predecessors, (65), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2023-02-18 01:55:58,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2023-02-18 01:55:58,461 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 52 [2023-02-18 01:55:58,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:55:58,461 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2023-02-18 01:55:58,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-18 01:55:58,462 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2023-02-18 01:55:58,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-18 01:55:58,465 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:55:58,465 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:55:58,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-18 01:55:58,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:55:58,673 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:55:58,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:55:58,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1226126935, now seen corresponding path program 2 times [2023-02-18 01:55:58,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:55:58,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202591924] [2023-02-18 01:55:58,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:58,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:55:58,683 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:55:58,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1319701729] [2023-02-18 01:55:58,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 01:55:58,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:55:58,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:55:58,689 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:55:58,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-18 01:55:58,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 01:55:58,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:55:58,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-18 01:55:58,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:55:58,782 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-02-18 01:55:58,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:55:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-02-18 01:55:58,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:55:58,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202591924] [2023-02-18 01:55:58,844 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:55:58,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319701729] [2023-02-18 01:55:58,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319701729] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:55:58,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:55:58,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2023-02-18 01:55:58,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270844391] [2023-02-18 01:55:58,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:55:58,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 01:55:58,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:55:58,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 01:55:58,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-02-18 01:55:58,846 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 7 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2023-02-18 01:55:59,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:55:59,369 INFO L93 Difference]: Finished difference Result 137 states and 172 transitions. [2023-02-18 01:55:59,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 01:55:59,370 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 7 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) Word has length 57 [2023-02-18 01:55:59,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:55:59,371 INFO L225 Difference]: With dead ends: 137 [2023-02-18 01:55:59,371 INFO L226 Difference]: Without dead ends: 126 [2023-02-18 01:55:59,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2023-02-18 01:55:59,372 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 43 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 01:55:59,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 87 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 01:55:59,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-18 01:55:59,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 111. [2023-02-18 01:55:59,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 68 states have (on average 1.088235294117647) internal successors, (74), 72 states have internal predecessors, (74), 26 states have call successors, (26), 16 states have call predecessors, (26), 16 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-18 01:55:59,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2023-02-18 01:55:59,393 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 57 [2023-02-18 01:55:59,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:55:59,395 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2023-02-18 01:55:59,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 7 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2023-02-18 01:55:59,395 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2023-02-18 01:55:59,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-18 01:55:59,397 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:55:59,397 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:55:59,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 01:55:59,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-18 01:55:59,602 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:55:59,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:55:59,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1236716699, now seen corresponding path program 1 times [2023-02-18 01:55:59,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:55:59,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948352913] [2023-02-18 01:55:59,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:59,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:55:59,620 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:55:59,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1369295829] [2023-02-18 01:55:59,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:59,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:55:59,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:55:59,629 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:55:59,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 01:55:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:55:59,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-18 01:55:59,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:55:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-02-18 01:55:59,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:55:59,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:55:59,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948352913] [2023-02-18 01:55:59,783 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:55:59,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369295829] [2023-02-18 01:55:59,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369295829] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:55:59,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:55:59,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-18 01:55:59,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121319673] [2023-02-18 01:55:59,785 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:55:59,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 01:55:59,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:55:59,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 01:55:59,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:55:59,787 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-18 01:55:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:55:59,926 INFO L93 Difference]: Finished difference Result 129 states and 151 transitions. [2023-02-18 01:55:59,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 01:55:59,926 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 65 [2023-02-18 01:55:59,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:55:59,930 INFO L225 Difference]: With dead ends: 129 [2023-02-18 01:55:59,930 INFO L226 Difference]: Without dead ends: 124 [2023-02-18 01:55:59,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-02-18 01:55:59,931 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:55:59,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 184 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:55:59,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-18 01:55:59,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2023-02-18 01:55:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 73 states have (on average 1.082191780821918) internal successors, (79), 77 states have internal predecessors, (79), 29 states have call successors, (29), 17 states have call predecessors, (29), 17 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-02-18 01:55:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2023-02-18 01:55:59,950 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 65 [2023-02-18 01:55:59,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:55:59,951 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2023-02-18 01:55:59,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-18 01:55:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2023-02-18 01:55:59,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-18 01:55:59,952 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:55:59,952 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:55:59,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-18 01:56:00,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:56:00,158 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:56:00,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:56:00,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1045444891, now seen corresponding path program 2 times [2023-02-18 01:56:00,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:56:00,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423850385] [2023-02-18 01:56:00,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:56:00,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:56:00,167 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:56:00,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [383114341] [2023-02-18 01:56:00,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 01:56:00,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:56:00,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:56:00,190 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:56:00,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-18 01:56:00,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 01:56:00,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:56:00,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-18 01:56:00,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:56:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-02-18 01:56:00,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:56:00,415 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-02-18 01:56:00,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:56:00,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423850385] [2023-02-18 01:56:00,416 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:56:00,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383114341] [2023-02-18 01:56:00,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383114341] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:56:00,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:56:00,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2023-02-18 01:56:00,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003878696] [2023-02-18 01:56:00,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:56:00,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 01:56:00,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:56:00,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 01:56:00,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2023-02-18 01:56:00,418 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2023-02-18 01:56:01,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:56:01,089 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2023-02-18 01:56:01,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 01:56:01,090 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 65 [2023-02-18 01:56:01,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:56:01,090 INFO L225 Difference]: With dead ends: 132 [2023-02-18 01:56:01,090 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 01:56:01,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2023-02-18 01:56:01,092 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 29 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 01:56:01,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 248 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 01:56:01,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 01:56:01,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 01:56:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 01:56:01,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 01:56:01,093 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2023-02-18 01:56:01,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:56:01,093 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 01:56:01,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2023-02-18 01:56:01,093 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 01:56:01,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 01:56:01,095 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 01:56:01,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-18 01:56:01,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-18 01:56:01,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 01:56:01,315 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 52) the Hoare annotation is: (let ((.cse21 (- |ULTIMATE.start_main_~s~0#1|)) (.cse0 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse4 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse9 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse16 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse3 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse8 (<= |ULTIMATE.start_main_~y~0#1| 20))) (let ((.cse23 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1)) (.cse20 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse6 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse2 (or (and .cse0 .cse16 .cse3 .cse4 .cse8 .cse9) (and .cse16 .cse3 .cse8))) (.cse5 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse7 (let ((.cse29 (+ |ULTIMATE.start_main_~r~0#1| .cse21)) (.cse28 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse28) (* |ULTIMATE.start_main_~y~0#1| .cse29))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse29)) (* |ULTIMATE.start_main_~s~0#1| .cse28)) 1))))) (.cse10 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|))) (let ((.cse18 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) (.cse1 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|)) (.cse11 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (.cse12 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse19 (let ((.cse24 (or (and .cse2 .cse3 .cse5 .cse7 .cse8 .cse10) (let ((.cse26 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse27 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse2 .cse3 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|)) (= .cse26 0) .cse5 (= (+ (* .cse27 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse26))) 1) (= .cse27 1) .cse7 .cse8 .cse10))))) (or (let ((.cse25 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and .cse24 (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse25) .cse6 .cse23 (= |ULTIMATE.start_main_~x~0#1| .cse25))) (and .cse24 .cse20 .cse6))))) (or (and .cse0 (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse5 .cse10 (let ((.cse13 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse14 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse15 (let ((.cse17 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse18) 1)))) (or (and .cse0 .cse16 .cse3 .cse4 .cse17 .cse8 .cse9) (and .cse16 .cse3 .cse17 .cse8))))) (or (and .cse0 .cse13 .cse3 .cse4 .cse14 .cse5 .cse8 .cse15 .cse12) (and .cse13 .cse3 .cse14 .cse5 .cse8 .cse15 .cse12)))) (and (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse18) 1) .cse19 .cse6) (and .cse1 .cse19 .cse6 (= (+ |ULTIMATE.start_main_~p~0#1| 0) 1) .cse11) (and .cse0 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12) (let ((.cse22 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|))) (and (= (+ .cse21 0) |ULTIMATE.start_main_~r~0#1|) (= (+ |ULTIMATE.start_main_~q~0#1| .cse22) 0) .cse19 (= .cse22 1) .cse6 .cse23)))))) [2023-02-18 01:56:01,316 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 01:56:01,316 INFO L895 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (>= |ULTIMATE.start_main_~y~0#1| 0) (>= |ULTIMATE.start_main_~x~0#1| 1) (<= |ULTIMATE.start_main_~y~0#1| 20)) [2023-02-18 01:56:01,316 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse7 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse8 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse1 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse2 (<= |ULTIMATE.start_main_~y~0#1| 20))) (let ((.cse3 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse0 (let ((.cse18 (>= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse6 .cse18 .cse1 .cse7 .cse2 .cse8) (and .cse18 .cse1 .cse2))))) (let ((.cse4 (let ((.cse10 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))) (let ((.cse11 (let ((.cse17 (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~s~0#1|))) (.cse16 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse16) (* |ULTIMATE.start_main_~y~0#1| .cse17))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse17)) (* |ULTIMATE.start_main_~s~0#1| .cse16)) 1))))) (.cse12 (or (and .cse6 .cse0 .cse1 .cse7 .cse10 .cse2 .cse3) (and .cse0 .cse1 .cse10 .cse2))) (.cse13 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|))) (or (and .cse10 .cse11 .cse12 .cse13) (let ((.cse14 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse15 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|)) (= .cse14 0) .cse10 (= (+ (* .cse15 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse14))) 1) (= .cse15 1) .cse11 .cse12 .cse13)))))) (.cse5 (>= |ULTIMATE.start_main_~x~0#1| 1))) (or (and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse0 .cse1 (= |ULTIMATE.start_main_~q~0#1| 0) .cse2 .cse3) (and (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|) .cse4 .cse5) (and .cse6 (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|) .cse7 .cse4 .cse5 .cse8 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (let ((.cse9 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse9) .cse4 .cse5 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1) (= |ULTIMATE.start_main_~x~0#1| .cse9))))))) [2023-02-18 01:56:01,317 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (let ((.cse21 (- |ULTIMATE.start_main_~s~0#1|)) (.cse0 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse4 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse9 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse16 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse3 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse8 (<= |ULTIMATE.start_main_~y~0#1| 20))) (let ((.cse23 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1)) (.cse20 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse6 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse2 (or (and .cse0 .cse16 .cse3 .cse4 .cse8 .cse9) (and .cse16 .cse3 .cse8))) (.cse5 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse7 (let ((.cse29 (+ |ULTIMATE.start_main_~r~0#1| .cse21)) (.cse28 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse28) (* |ULTIMATE.start_main_~y~0#1| .cse29))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse29)) (* |ULTIMATE.start_main_~s~0#1| .cse28)) 1))))) (.cse10 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|))) (let ((.cse18 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) (.cse1 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|)) (.cse11 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (.cse12 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse19 (let ((.cse24 (or (and .cse2 .cse3 .cse5 .cse7 .cse8 .cse10) (let ((.cse26 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse27 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse2 .cse3 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|)) (= .cse26 0) .cse5 (= (+ (* .cse27 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse26))) 1) (= .cse27 1) .cse7 .cse8 .cse10))))) (or (let ((.cse25 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and .cse24 (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse25) .cse6 .cse23 (= |ULTIMATE.start_main_~x~0#1| .cse25))) (and .cse24 .cse20 .cse6))))) (or (and .cse0 (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse5 .cse10 (let ((.cse13 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse14 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse15 (let ((.cse17 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse18) 1)))) (or (and .cse0 .cse16 .cse3 .cse4 .cse17 .cse8 .cse9) (and .cse16 .cse3 .cse17 .cse8))))) (or (and .cse0 .cse13 .cse3 .cse4 .cse14 .cse5 .cse8 .cse15 .cse12) (and .cse13 .cse3 .cse14 .cse5 .cse8 .cse15 .cse12)))) (and (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse18) 1) .cse19 .cse6) (and .cse1 .cse19 .cse6 (= (+ |ULTIMATE.start_main_~p~0#1| 0) 1) .cse11) (and .cse0 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12) (let ((.cse22 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|))) (and (= (+ .cse21 0) |ULTIMATE.start_main_~r~0#1|) (= (+ |ULTIMATE.start_main_~q~0#1| .cse22) 0) .cse19 (= .cse22 1) .cse6 .cse23)))))) [2023-02-18 01:56:01,317 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 01:56:01,317 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 18 59) the Hoare annotation is: true [2023-02-18 01:56:01,317 INFO L899 garLoopResultBuilder]: For program point L38(lines 35 52) no Hoare annotation was computed. [2023-02-18 01:56:01,318 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse30 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|))) (let ((.cse34 (- |ULTIMATE.start_main_~s~0#1|)) (.cse19 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)) (.cse2 (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse30) 1))) (let ((.cse23 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse20 (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse16 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse17 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse18 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse14 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse7 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse28 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1)) (.cse29 (or .cse19 (not .cse2))) (.cse3 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse4 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse6 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse11 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse12 (let ((.cse36 (+ |ULTIMATE.start_main_~r~0#1| .cse34)) (.cse35 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse35) (* |ULTIMATE.start_main_~y~0#1| .cse36))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse36)) (* |ULTIMATE.start_main_~s~0#1| .cse35)) 1))))) (.cse13 (<= |ULTIMATE.start_main_~y~0#1| 20))) (let ((.cse22 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|)) (.cse24 (= (+ |ULTIMATE.start_main_~p~0#1| 0) 1)) (.cse25 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (.cse0 (= (+ .cse34 0) |ULTIMATE.start_main_~r~0#1|)) (.cse15 (or (let ((.cse33 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and .cse29 (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse33) .cse4 .cse6 .cse11 .cse28 .cse12 .cse13 (= |ULTIMATE.start_main_~x~0#1| .cse33))) (and .cse29 .cse3 .cse4 .cse6 .cse11 .cse12 .cse13))) (.cse27 (or (let ((.cse31 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse32 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse4 .cse6 .cse7 (= .cse31 0) (= (+ (* .cse32 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse31))) 1) (= .cse32 1) .cse12 .cse13 .cse19)) (and .cse4 .cse6 .cse13 .cse19))) (.cse26 (or (not .cse19) .cse3)) (.cse21 (or (and .cse16 .cse4 .cse6 .cse17 .cse13 .cse18 .cse19 .cse14) (and .cse16 .cse4 .cse6 .cse17 .cse12 .cse13 .cse18 .cse19 .cse14))) (.cse1 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse10 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse30) 1))) (.cse5 (<= (+ |ULTIMATE.start_main_~b~0#1| 1) .cse20)) (.cse8 (= .cse23 1)) (.cse9 (= |ULTIMATE.start_main_~q~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse11 .cse15) (and .cse16 .cse1 .cse4 .cse5 .cse6 .cse17 .cse8 .cse9 .cse10 .cse11 .cse13 .cse18 .cse19 .cse14) (and (<= (+ |ULTIMATE.start_main_~a~0#1| 1) .cse20) (<= |ULTIMATE.start_main_~a~0#1| .cse20) .cse16 (= |ULTIMATE.start_main_~y~0#1| .cse20) .cse21 .cse22 .cse17 (= .cse23 0) .cse11 .cse18 .cse24 .cse25) (and .cse22 .cse2 .cse26 .cse11 .cse27 .cse24 .cse25) (and .cse0 (= (+ |ULTIMATE.start_main_~q~0#1| .cse23) 0) .cse8 .cse11 .cse28 .cse15) (and .cse2 .cse26 .cse11 .cse27) (and .cse2 .cse11 (or (and .cse21 .cse26 .cse11) (and .cse21 .cse3 .cse11))) (and (or (and .cse29 .cse1 .cse4 .cse6 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse1 .cse4 .cse6 .cse9 .cse10 .cse12 .cse13 .cse19 .cse14)) .cse2 .cse3 .cse5 .cse8 .cse9 .cse11 .cse14)))))) [2023-02-18 01:56:01,318 INFO L895 garLoopResultBuilder]: At program point L36-1(line 36) the Hoare annotation is: (let ((.cse33 (- |ULTIMATE.start_main_~s~0#1|))) (let ((.cse18 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse19 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse20 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse14 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse17 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1)) (.cse3 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse11 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse29 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) (.cse16 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse22 (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse7 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse12 (let ((.cse35 (+ |ULTIMATE.start_main_~r~0#1| .cse33)) (.cse34 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse34) (* |ULTIMATE.start_main_~y~0#1| .cse35))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse35)) (* |ULTIMATE.start_main_~s~0#1| .cse34)) 1))))) (.cse4 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse6 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse13 (<= |ULTIMATE.start_main_~y~0#1| 20)) (.cse21 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|))) (let ((.cse0 (= (+ .cse33 0) |ULTIMATE.start_main_~r~0#1|)) (.cse24 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|)) (.cse25 (= (+ |ULTIMATE.start_main_~p~0#1| 0) 1)) (.cse26 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (.cse28 (or (let ((.cse31 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse32 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse4 .cse6 .cse7 (= .cse31 0) (= (+ (* .cse32 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse31))) 1) (= .cse32 1) .cse12 .cse13 .cse21)) (and .cse4 .cse6 .cse13 .cse21))) (.cse1 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse5 (<= (+ |ULTIMATE.start_main_~b~0#1| 1) .cse22)) (.cse8 (= .cse16 1)) (.cse9 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse10 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse29) 1))) (.cse15 (or (let ((.cse30 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse30) .cse4 .cse6 .cse11 .cse17 .cse12 .cse13 (= |ULTIMATE.start_main_~x~0#1| .cse30) .cse21)) (and .cse3 .cse4 .cse6 .cse11 .cse12 .cse13 .cse21))) (.cse2 (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse29) 1)) (.cse27 (or (not .cse21) .cse3)) (.cse23 (or (and .cse18 .cse4 .cse6 .cse19 .cse13 .cse20 .cse21 .cse14) (and .cse18 .cse4 .cse6 .cse19 .cse12 .cse13 .cse20 .cse21 .cse14)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 (= (+ |ULTIMATE.start_main_~q~0#1| .cse16) 0) .cse8 .cse11 .cse17) (and .cse18 .cse1 .cse4 .cse5 .cse6 .cse19 .cse8 .cse9 .cse10 .cse11 .cse13 .cse20 .cse21 .cse14) (and (<= (+ |ULTIMATE.start_main_~a~0#1| 1) .cse22) (<= |ULTIMATE.start_main_~a~0#1| .cse22) .cse18 (= |ULTIMATE.start_main_~y~0#1| .cse22) .cse23 .cse24 .cse19 (= .cse16 0) .cse11 .cse20 .cse25 .cse26) (and .cse24 .cse2 .cse27 .cse11 .cse28 .cse25 .cse26) (and .cse2 .cse27 .cse11 .cse28) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21 .cse14) (and .cse15 .cse2 .cse11) (and .cse2 .cse11 (or (and .cse23 .cse27 .cse11) (and .cse23 .cse3 .cse11))))))) [2023-02-18 01:56:01,318 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 01:56:01,319 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 01:56:01,319 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2023-02-18 01:56:01,319 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2023-02-18 01:56:01,319 INFO L902 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2023-02-18 01:56:01,319 INFO L895 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (and (>= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~y~0#1| 20)) [2023-02-18 01:56:01,319 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse18 (- |ULTIMATE.start_main_~s~0#1|)) (.cse2 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse4 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse6 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse3 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse0 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse1 (<= |ULTIMATE.start_main_~y~0#1| 20))) (let ((.cse20 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1)) (.cse17 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse12 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse10 (or (and .cse2 .cse3 .cse0 .cse4 .cse1 .cse6) (and .cse3 .cse0 .cse1))) (.cse11 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse13 (let ((.cse26 (+ |ULTIMATE.start_main_~r~0#1| .cse18)) (.cse25 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse25) (* |ULTIMATE.start_main_~y~0#1| .cse26))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse26)) (* |ULTIMATE.start_main_~s~0#1| .cse25)) 1))))) (.cse14 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|))) (let ((.cse7 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) (.cse9 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|)) (.cse15 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (.cse8 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse16 (let ((.cse21 (or (and .cse10 .cse0 .cse11 .cse13 .cse1 .cse14) (let ((.cse23 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse24 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse10 .cse0 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|)) (= .cse23 0) .cse11 (= (+ (* .cse24 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse23))) 1) (= .cse24 1) .cse13 .cse1 .cse14))))) (or (let ((.cse22 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and .cse21 (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse22) .cse12 .cse20 (= |ULTIMATE.start_main_~x~0#1| .cse22))) (and .cse21 .cse17 .cse12))))) (or (and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse0 (= |ULTIMATE.start_main_~q~0#1| 0) .cse1 (let ((.cse5 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse7) 1)))) (or (and .cse2 .cse3 .cse0 .cse4 .cse5 .cse1 .cse6) (and .cse3 .cse0 .cse5 .cse1))) .cse8) (and .cse2 (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) .cse9 .cse10 .cse0 .cse4 .cse11 .cse12 .cse13 .cse1 .cse6 .cse14 .cse15 .cse8) (and (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse7) 1) .cse16 .cse12) (and .cse9 .cse16 .cse12 (= (+ |ULTIMATE.start_main_~p~0#1| 0) 1) .cse15) (and .cse2 .cse17 .cse10 .cse0 .cse4 .cse11 .cse12 .cse13 .cse1 .cse14 .cse8) (let ((.cse19 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|))) (and (= (+ .cse18 0) |ULTIMATE.start_main_~r~0#1|) (= (+ |ULTIMATE.start_main_~q~0#1| .cse19) 0) .cse16 (= .cse19 1) .cse12 .cse20)))))) [2023-02-18 01:56:01,319 INFO L902 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2023-02-18 01:56:01,320 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2023-02-18 01:56:01,320 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 51) no Hoare annotation was computed. [2023-02-18 01:56:01,320 INFO L895 garLoopResultBuilder]: At program point L43-2(lines 35 52) the Hoare annotation is: (let ((.cse30 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|))) (let ((.cse34 (- |ULTIMATE.start_main_~s~0#1|)) (.cse19 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)) (.cse2 (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse30) 1))) (let ((.cse23 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse20 (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse16 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse17 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse18 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse14 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse7 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse28 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1)) (.cse29 (or .cse19 (not .cse2))) (.cse3 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse4 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse6 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse11 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse12 (let ((.cse36 (+ |ULTIMATE.start_main_~r~0#1| .cse34)) (.cse35 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse35) (* |ULTIMATE.start_main_~y~0#1| .cse36))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse36)) (* |ULTIMATE.start_main_~s~0#1| .cse35)) 1))))) (.cse13 (<= |ULTIMATE.start_main_~y~0#1| 20))) (let ((.cse22 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|)) (.cse24 (= (+ |ULTIMATE.start_main_~p~0#1| 0) 1)) (.cse25 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (.cse0 (= (+ .cse34 0) |ULTIMATE.start_main_~r~0#1|)) (.cse15 (or (let ((.cse33 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and .cse29 (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse33) .cse4 .cse6 .cse11 .cse28 .cse12 .cse13 (= |ULTIMATE.start_main_~x~0#1| .cse33))) (and .cse29 .cse3 .cse4 .cse6 .cse11 .cse12 .cse13))) (.cse27 (or (let ((.cse31 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse32 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse4 .cse6 .cse7 (= .cse31 0) (= (+ (* .cse32 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse31))) 1) (= .cse32 1) .cse12 .cse13 .cse19)) (and .cse4 .cse6 .cse13 .cse19))) (.cse26 (or (not .cse19) .cse3)) (.cse21 (or (and .cse16 .cse4 .cse6 .cse17 .cse13 .cse18 .cse19 .cse14) (and .cse16 .cse4 .cse6 .cse17 .cse12 .cse13 .cse18 .cse19 .cse14))) (.cse1 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse10 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse30) 1))) (.cse5 (<= (+ |ULTIMATE.start_main_~b~0#1| 1) .cse20)) (.cse8 (= .cse23 1)) (.cse9 (= |ULTIMATE.start_main_~q~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse11 .cse15) (and .cse16 .cse1 .cse4 .cse5 .cse6 .cse17 .cse8 .cse9 .cse10 .cse11 .cse13 .cse18 .cse19 .cse14) (and (<= (+ |ULTIMATE.start_main_~a~0#1| 1) .cse20) (<= |ULTIMATE.start_main_~a~0#1| .cse20) .cse16 (= |ULTIMATE.start_main_~y~0#1| .cse20) .cse21 .cse22 .cse17 (= .cse23 0) .cse11 .cse18 .cse24 .cse25) (and .cse22 .cse2 .cse26 .cse11 .cse27 .cse24 .cse25) (and .cse0 (= (+ |ULTIMATE.start_main_~q~0#1| .cse23) 0) .cse8 .cse11 .cse28 .cse15) (and .cse2 .cse26 .cse11 .cse27) (and .cse2 .cse11 (or (and .cse21 .cse26 .cse11) (and .cse21 .cse3 .cse11))) (and (or (and .cse29 .cse1 .cse4 .cse6 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse1 .cse4 .cse6 .cse9 .cse10 .cse12 .cse13 .cse19 .cse14)) .cse2 .cse3 .cse5 .cse8 .cse9 .cse11 .cse14)))))) [2023-02-18 01:56:01,320 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse28 (- |ULTIMATE.start_main_~s~0#1|))) (let ((.cse2 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse27 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) (.cse8 (= (+ |ULTIMATE.start_main_~p~0#1| 0) 1)) (.cse23 (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse6 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|)) (.cse9 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (.cse10 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse15 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse19 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse21 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse24 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse4 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse5 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1)) (.cse26 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse25 (let ((.cse36 (+ |ULTIMATE.start_main_~r~0#1| .cse28)) (.cse35 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse35) (* |ULTIMATE.start_main_~y~0#1| .cse36))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse36)) (* |ULTIMATE.start_main_~s~0#1| .cse35)) 1))))) (.cse12 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse14 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse18 (<= |ULTIMATE.start_main_~y~0#1| 20)) (.cse20 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|))) (let ((.cse0 (let ((.cse31 (or (and .cse12 .cse14 .cse25 .cse18 .cse20) (let ((.cse33 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse34 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse12 .cse14 .cse26 (= .cse33 0) (= (+ (* .cse34 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse33))) 1) (= .cse34 1) .cse25 .cse18 .cse20)) (and .cse12 .cse14 .cse18 .cse20)))) (or (and .cse24 .cse4 .cse31) (let ((.cse32 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse32) .cse4 .cse5 (= |ULTIMATE.start_main_~x~0#1| .cse32) .cse31))))) (.cse22 (let ((.cse29 (let ((.cse30 (or (and .cse10 .cse12 .cse14 .cse15 .cse18 .cse19 .cse20 .cse21) (and .cse10 .cse12 .cse14 .cse15 .cse25 .cse18 .cse19 .cse20 .cse21)))) (or (and .cse30 .cse24 .cse4) (and .cse10 (= |ULTIMATE.start_main_~y~0#1| .cse23) .cse30 .cse6 .cse15 .cse4 .cse19 .cse9))))) (or (and .cse4 .cse29) (and .cse6 .cse4 .cse29 .cse8 .cse9)))) (.cse1 (= (+ .cse28 0) |ULTIMATE.start_main_~r~0#1|)) (.cse11 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse7 (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse27) 1)) (.cse13 (<= (+ |ULTIMATE.start_main_~b~0#1| 1) .cse23)) (.cse3 (= .cse2 1)) (.cse16 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse17 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse27) 1)))) (or (and .cse0 .cse1 (= (+ |ULTIMATE.start_main_~q~0#1| .cse2) 0) .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse4 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse3 .cse16 .cse17 .cse4 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse7 .cse4) (and .cse22 (<= (+ |ULTIMATE.start_main_~a~0#1| 1) .cse23) (<= |ULTIMATE.start_main_~a~0#1| .cse23) .cse10 .cse15 (= .cse2 0) .cse4 .cse9) (and .cse22 .cse7 .cse4) (and .cse11 .cse7 .cse24 .cse12 .cse13 .cse14 .cse3 .cse16 .cse17 .cse4 .cse25 .cse18 .cse20 .cse21) (and .cse1 .cse11 .cse7 .cse24 .cse12 .cse13 .cse14 .cse26 .cse3 .cse16 .cse17 .cse4 .cse25 .cse18 .cse20 .cse21))))) [2023-02-18 01:56:01,321 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7 9) the Hoare annotation is: true [2023-02-18 01:56:01,321 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2023-02-18 01:56:01,321 INFO L899 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2023-02-18 01:56:01,321 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2023-02-18 01:56:01,321 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2023-02-18 01:56:01,321 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 14) no Hoare annotation was computed. [2023-02-18 01:56:01,321 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 16) no Hoare annotation was computed. [2023-02-18 01:56:01,321 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 10 16) the Hoare annotation is: true [2023-02-18 01:56:01,321 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 16) no Hoare annotation was computed. [2023-02-18 01:56:01,321 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2023-02-18 01:56:01,324 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2023-02-18 01:56:01,325 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 01:56:01,332 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:01,332 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:01,333 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:01,333 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:01,343 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:01,343 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:01,343 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:01,343 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:01,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 01:56:01 BoogieIcfgContainer [2023-02-18 01:56:01,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 01:56:01,347 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 01:56:01,347 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 01:56:01,348 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 01:56:01,348 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:55:51" (3/4) ... [2023-02-18 01:56:01,350 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 01:56:01,354 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-18 01:56:01,354 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 01:56:01,356 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-18 01:56:01,356 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 01:56:01,356 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 01:56:01,357 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 01:56:01,378 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 01:56:01,379 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 01:56:01,379 INFO L158 Benchmark]: Toolchain (without parser) took 10756.26ms. Allocated memory was 125.8MB in the beginning and 222.3MB in the end (delta: 96.5MB). Free memory was 88.5MB in the beginning and 154.8MB in the end (delta: -66.3MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2023-02-18 01:56:01,379 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory was 93.3MB in the beginning and 93.2MB in the end (delta: 72.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 01:56:01,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 153.16ms. Allocated memory is still 125.8MB. Free memory was 88.2MB in the beginning and 77.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 01:56:01,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.28ms. Allocated memory is still 125.8MB. Free memory was 77.7MB in the beginning and 76.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 01:56:01,380 INFO L158 Benchmark]: Boogie Preprocessor took 13.58ms. Allocated memory is still 125.8MB. Free memory was 76.2MB in the beginning and 75.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 01:56:01,380 INFO L158 Benchmark]: RCFGBuilder took 202.68ms. Allocated memory is still 125.8MB. Free memory was 75.0MB in the beginning and 64.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 01:56:01,380 INFO L158 Benchmark]: TraceAbstraction took 10326.86ms. Allocated memory was 125.8MB in the beginning and 222.3MB in the end (delta: 96.5MB). Free memory was 63.9MB in the beginning and 158.0MB in the end (delta: -94.0MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2023-02-18 01:56:01,381 INFO L158 Benchmark]: Witness Printer took 31.31ms. Allocated memory is still 222.3MB. Free memory was 158.0MB in the beginning and 154.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 01:56:01,382 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory was 93.3MB in the beginning and 93.2MB in the end (delta: 72.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 153.16ms. Allocated memory is still 125.8MB. Free memory was 88.2MB in the beginning and 77.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.28ms. Allocated memory is still 125.8MB. Free memory was 77.7MB in the beginning and 76.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 13.58ms. Allocated memory is still 125.8MB. Free memory was 76.2MB in the beginning and 75.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 202.68ms. Allocated memory is still 125.8MB. Free memory was 75.0MB in the beginning and 64.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10326.86ms. Allocated memory was 125.8MB in the beginning and 222.3MB in the end (delta: 96.5MB). Free memory was 63.9MB in the beginning and 158.0MB in the end (delta: -94.0MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * Witness Printer took 31.31ms. Allocated memory is still 222.3MB. Free memory was 158.0MB in the beginning and 154.8MB 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[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 256 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 200 mSDsluCounter, 1463 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1135 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2032 IncrementalHoareTripleChecker+Invalid, 2208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 328 mSDtfsCounter, 2032 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 780 GetRequests, 639 SyntacticMatches, 5 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=9, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 49 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 75 PreInvPairs, 137 NumberOfFragments, 13272 HoareAnnotationTreeSize, 75 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 483 NumberOfCodeBlocks, 483 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 721 ConstructedInterpolants, 2 QuantifiedInterpolants, 3035 SizeOfPredicates, 56 NumberOfNonLiveVariables, 1263 ConjunctsInSsa, 230 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 824/896 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: 18]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant [2023-02-18 01:56:01,387 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:01,387 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:01,387 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:01,387 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:01,389 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:01,389 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:01,389 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:01,389 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((-s + 0 == r && b == y) && -(q * r) + p * s == 1) && s * y + q * x == b) && y >= 1) && b + 1 <= a + b) && y >= 0) && x == a + y) && p + q == 1) && q == 0) && (forall ULTIMATE.start_main_~r~0#1 : int :: -(q * ULTIMATE.start_main_~r~0#1) + p * s == 1)) && x >= 1) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && y <= 20) && s == 1) || ((-(q * r) + p * s == 1 && x >= 1) && (((((((((((r * y + p * x == a || !(-(q * r) + p * s == 1)) && q == -1 + 0) && x * 1 + y * 0 == -1 * b + y) && y >= 1) && y >= 0) && x >= 1) && s + 0 == 1) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && y <= 20) && x == -1 * b + y) || (((((((r * y + p * x == a || !(-(q * r) + p * s == 1)) && s * y + q * x == b) && y >= 1) && y >= 0) && x >= 1) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && y <= 20)))) || (((((((((((((p == 1 && b == y) && y >= 1) && b + 1 <= a + b) && y >= 0) && r == 0) && p + q == 1) && q == 0) && (forall ULTIMATE.start_main_~r~0#1 : int :: -(q * ULTIMATE.start_main_~r~0#1) + p * s == 1)) && x >= 1) && y <= 20) && a == x) && r * y + p * x == a) && s == 1)) || (((((((((((a + 1 <= a + b && a <= a + b) && p == 1) && y == a + b) && ((((((((p == 1 && y >= 1) && y >= 0) && r == 0) && y <= 20) && a == x) && r * y + p * x == a) && s == 1) || ((((((((p == 1 && y >= 1) && y >= 0) && r == 0) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && y <= 20) && a == x) && r * y + p * x == a) && s == 1))) && -p + 0 == q) && r == 0) && p + q == 0) && x >= 1) && a == x) && p + 0 == 1) && r + s == 1)) || ((((((-p + 0 == q && -(q * r) + p * s == 1) && (!(r * y + p * x == a) || s * y + q * x == b)) && x >= 1) && (((((((((y >= 1 && y >= 0) && x == a + y) && -1 * p + 1 == 0) && -1 * r * p + -(r * (-1 * p + 1)) == 1) && -1 * r == 1) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && y <= 20) && r * y + p * x == a) || (((y >= 1 && y >= 0) && y <= 20) && r * y + p * x == a))) && p + 0 == 1) && r + s == 1)) || (((((-s + 0 == r && q + (p + q) == 0) && p + q == 1) && x >= 1) && s + 0 == 1) && (((((((((((r * y + p * x == a || !(-(q * r) + p * s == 1)) && q == -1 + 0) && x * 1 + y * 0 == -1 * b + y) && y >= 1) && y >= 0) && x >= 1) && s + 0 == 1) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && y <= 20) && x == -1 * b + y) || (((((((r * y + p * x == a || !(-(q * r) + p * s == 1)) && s * y + q * x == b) && y >= 1) && y >= 0) && x >= 1) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && y <= 20)))) || (((-(q * r) + p * s == 1 && (!(r * y + p * x == a) || s * y + q * x == b)) && x >= 1) && (((((((((y >= 1 && y >= 0) && x == a + y) && -1 * p + 1 == 0) && -1 * r * p + -(r * (-1 * p + 1)) == 1) && -1 * r == 1) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && y <= 20) && r * y + p * x == a) || (((y >= 1 && y >= 0) && y <= 20) && r * y + p * x == a)))) || ((-(q * r) + p * s == 1 && x >= 1) && (((((((((((p == 1 && y >= 1) && y >= 0) && r == 0) && y <= 20) && a == x) && r * y + p * x == a) && s == 1) || ((((((((p == 1 && y >= 1) && y >= 0) && r == 0) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && y <= 20) && a == x) && r * y + p * x == a) && s == 1)) && (!(r * y + p * x == a) || s * y + q * x == b)) && x >= 1) || ((((((((((p == 1 && y >= 1) && y >= 0) && r == 0) && y <= 20) && a == x) && r * y + p * x == a) && s == 1) || ((((((((p == 1 && y >= 1) && y >= 0) && r == 0) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && y <= 20) && a == x) && r * y + p * x == a) && s == 1)) && s * y + q * x == b) && x >= 1)))) || (((((((((((((((((r * y + p * x == a || !(-(q * r) + p * s == 1)) && b == y) && y >= 1) && y >= 0) && q == 0) && (forall ULTIMATE.start_main_~r~0#1 : int :: -(q * ULTIMATE.start_main_~r~0#1) + p * s == 1)) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && y <= 20) && s == 1) || ((((((((b == y && y >= 1) && y >= 0) && q == 0) && (forall ULTIMATE.start_main_~r~0#1 : int :: -(q * ULTIMATE.start_main_~r~0#1) + p * s == 1)) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && y <= 20) && r * y + p * x == a) && s == 1)) && -(q * r) + p * s == 1) && s * y + q * x == b) && b + 1 <= a + b) && p + q == 1) && q == 0) && x >= 1) && s == 1) RESULT: Ultimate proved your program to be correct! [2023-02-18 01:56:01,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE