./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound50.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 3134c54bcf8aadaf562f6870f2277db1ec6f958b1ed6dba99e7410745dba79ba --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 17:14:10,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 17:14:10,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 17:14:10,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 17:14:10,049 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 17:14:10,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 17:14:10,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 17:14:10,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 17:14:10,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 17:14:10,065 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 17:14:10,066 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 17:14:10,068 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 17:14:10,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 17:14:10,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 17:14:10,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 17:14:10,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 17:14:10,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 17:14:10,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 17:14:10,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 17:14:10,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 17:14:10,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 17:14:10,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 17:14:10,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 17:14:10,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 17:14:10,092 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 17:14:10,092 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 17:14:10,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 17:14:10,094 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 17:14:10,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 17:14:10,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 17:14:10,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 17:14:10,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 17:14:10,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 17:14:10,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 17:14:10,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 17:14:10,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 17:14:10,100 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 17:14:10,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 17:14:10,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 17:14:10,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 17:14:10,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 17:14:10,104 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 17:14:10,133 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 17:14:10,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 17:14:10,134 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 17:14:10,134 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 17:14:10,135 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 17:14:10,136 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 17:14:10,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 17:14:10,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 17:14:10,137 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 17:14:10,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 17:14:10,138 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 17:14:10,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 17:14:10,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 17:14:10,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 17:14:10,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 17:14:10,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 17:14:10,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 17:14:10,139 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 17:14:10,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 17:14:10,139 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 17:14:10,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 17:14:10,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 17:14:10,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 17:14:10,140 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 17:14:10,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 17:14:10,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 17:14:10,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 17:14:10,141 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 17:14:10,141 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 17:14:10,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 17:14:10,142 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 17:14:10,142 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 17:14:10,142 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 17:14:10,142 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 17:14:10,143 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 17:14:10,143 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 -> 3134c54bcf8aadaf562f6870f2277db1ec6f958b1ed6dba99e7410745dba79ba [2023-02-18 17:14:10,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 17:14:10,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 17:14:10,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 17:14:10,405 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 17:14:10,405 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 17:14:10,407 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound50.c [2023-02-18 17:14:11,569 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 17:14:11,767 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 17:14:11,768 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound50.c [2023-02-18 17:14:11,772 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/071bcf82e/91a3145712d94070b5fd6f07f87c6ab0/FLAG0eef5ddc4 [2023-02-18 17:14:11,781 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/071bcf82e/91a3145712d94070b5fd6f07f87c6ab0 [2023-02-18 17:14:11,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 17:14:11,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 17:14:11,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 17:14:11,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 17:14:11,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 17:14:11,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 05:14:11" (1/1) ... [2023-02-18 17:14:11,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73b4025e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:14:11, skipping insertion in model container [2023-02-18 17:14:11,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 05:14:11" (1/1) ... [2023-02-18 17:14:11,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 17:14:11,814 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 17:14:11,924 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_valuebound50.c[489,502] [2023-02-18 17:14:11,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 17:14:11,945 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 17:14:11,955 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_valuebound50.c[489,502] [2023-02-18 17:14:11,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 17:14:11,977 INFO L208 MainTranslator]: Completed translation [2023-02-18 17:14:11,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:14:11 WrapperNode [2023-02-18 17:14:11,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 17:14:11,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 17:14:11,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 17:14:11,979 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 17:14:11,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:14:11" (1/1) ... [2023-02-18 17:14:11,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:14:11" (1/1) ... [2023-02-18 17:14:12,008 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2023-02-18 17:14:12,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 17:14:12,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 17:14:12,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 17:14:12,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 17:14:12,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:14:11" (1/1) ... [2023-02-18 17:14:12,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:14:11" (1/1) ... [2023-02-18 17:14:12,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:14:11" (1/1) ... [2023-02-18 17:14:12,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:14:11" (1/1) ... [2023-02-18 17:14:12,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:14:11" (1/1) ... [2023-02-18 17:14:12,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:14:11" (1/1) ... [2023-02-18 17:14:12,023 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:14:11" (1/1) ... [2023-02-18 17:14:12,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:14:11" (1/1) ... [2023-02-18 17:14:12,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 17:14:12,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 17:14:12,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 17:14:12,026 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 17:14:12,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:14:11" (1/1) ... [2023-02-18 17:14:12,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 17:14:12,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:14:12,061 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 17:14:12,062 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 17:14:12,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 17:14:12,088 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-18 17:14:12,088 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-18 17:14:12,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 17:14:12,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 17:14:12,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 17:14:12,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 17:14:12,089 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 17:14:12,145 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 17:14:12,147 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 17:14:12,323 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 17:14:12,334 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 17:14:12,337 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 17:14:12,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 05:14:12 BoogieIcfgContainer [2023-02-18 17:14:12,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 17:14:12,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 17:14:12,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 17:14:12,345 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 17:14:12,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 05:14:11" (1/3) ... [2023-02-18 17:14:12,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4875fb3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 05:14:12, skipping insertion in model container [2023-02-18 17:14:12,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:14:11" (2/3) ... [2023-02-18 17:14:12,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4875fb3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 05:14:12, skipping insertion in model container [2023-02-18 17:14:12,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 05:14:12" (3/3) ... [2023-02-18 17:14:12,350 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_valuebound50.c [2023-02-18 17:14:12,365 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 17:14:12,365 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 17:14:12,419 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 17:14:12,426 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;@5be10316, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 17:14:12,426 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 17:14:12,430 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 17:14:12,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 17:14:12,439 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:14:12,439 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 17:14:12,440 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:14:12,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:14:12,447 INFO L85 PathProgramCache]: Analyzing trace with hash 501437177, now seen corresponding path program 1 times [2023-02-18 17:14:12,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:14:12,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370482757] [2023-02-18 17:14:12,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:14:12,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:14:12,570 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:14:12,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1221493622] [2023-02-18 17:14:12,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:14:12,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:14:12,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:14:12,581 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 17:14:12,602 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 17:14:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:14:12,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 17:14:12,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:14:12,818 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 17:14:12,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:14:12,888 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 17:14:12,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:14:12,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370482757] [2023-02-18 17:14:12,889 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:14:12,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221493622] [2023-02-18 17:14:12,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221493622] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 17:14:12,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 17:14:12,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-02-18 17:14:12,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971345785] [2023-02-18 17:14:12,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 17:14:12,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 17:14:12,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:14:12,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 17:14:12,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-02-18 17:14:12,928 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 17:14:13,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:14:13,103 INFO L93 Difference]: Finished difference Result 79 states and 134 transitions. [2023-02-18 17:14:13,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 17:14:13,105 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 17:14:13,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:14:13,115 INFO L225 Difference]: With dead ends: 79 [2023-02-18 17:14:13,115 INFO L226 Difference]: Without dead ends: 42 [2023-02-18 17:14:13,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-02-18 17:14:13,126 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-02-18 17:14:13,127 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.1s Time] [2023-02-18 17:14:13,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-18 17:14:13,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2023-02-18 17:14:13,164 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 17:14:13,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2023-02-18 17:14:13,167 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 29 [2023-02-18 17:14:13,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:14:13,168 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2023-02-18 17:14:13,168 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 17:14:13,168 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2023-02-18 17:14:13,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-18 17:14:13,170 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:14:13,170 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 17:14:13,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 17:14:13,378 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 17:14:13,379 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:14:13,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:14:13,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1017640517, now seen corresponding path program 1 times [2023-02-18 17:14:13,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:14:13,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520421106] [2023-02-18 17:14:13,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:14:13,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:14:13,416 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:14:13,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1465671648] [2023-02-18 17:14:13,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:14:13,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:14:13,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:14:13,423 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 17:14:13,426 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 17:14:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:14:13,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 17:14:13,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:14:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-18 17:14:13,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:14:13,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:14:13,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520421106] [2023-02-18 17:14:13,651 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:14:13,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465671648] [2023-02-18 17:14:13,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465671648] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 17:14:13,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 17:14:13,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2023-02-18 17:14:13,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258886717] [2023-02-18 17:14:13,654 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 17:14:13,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 17:14:13,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:14:13,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 17:14:13,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-18 17:14:13,659 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-18 17:14:13,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:14:13,815 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2023-02-18 17:14:13,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 17:14:13,816 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2023-02-18 17:14:13,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:14:13,818 INFO L225 Difference]: With dead ends: 48 [2023-02-18 17:14:13,818 INFO L226 Difference]: Without dead ends: 46 [2023-02-18 17:14:13,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-02-18 17:14:13,822 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 17:14:13,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 112 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 17:14:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-18 17:14:13,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2023-02-18 17:14:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-18 17:14:13,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2023-02-18 17:14:13,851 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 34 [2023-02-18 17:14:13,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:14:13,851 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2023-02-18 17:14:13,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-18 17:14:13,852 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2023-02-18 17:14:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-18 17:14:13,853 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:14:13,853 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 17:14:13,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 17:14:14,059 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 17:14:14,060 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:14:14,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:14:14,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1133401081, now seen corresponding path program 1 times [2023-02-18 17:14:14,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:14:14,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302363870] [2023-02-18 17:14:14,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:14:14,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:14:14,093 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:14:14,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1816375079] [2023-02-18 17:14:14,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:14:14,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:14:14,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:14:14,106 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 17:14:14,129 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 17:14:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:14:14,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-18 17:14:14,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:14:14,254 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-18 17:14:14,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:14:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-18 17:14:14,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:14:14,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302363870] [2023-02-18 17:14:14,311 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:14:14,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816375079] [2023-02-18 17:14:14,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816375079] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 17:14:14,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 17:14:14,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 13 [2023-02-18 17:14:14,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075754486] [2023-02-18 17:14:14,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 17:14:14,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 17:14:14,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:14:14,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 17:14:14,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-02-18 17:14:14,315 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-18 17:14:14,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:14:14,394 INFO L93 Difference]: Finished difference Result 70 states and 101 transitions. [2023-02-18 17:14:14,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 17:14:14,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2023-02-18 17:14:14,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:14:14,399 INFO L225 Difference]: With dead ends: 70 [2023-02-18 17:14:14,399 INFO L226 Difference]: Without dead ends: 66 [2023-02-18 17:14:14,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-02-18 17:14:14,402 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 17:14:14,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 120 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 17:14:14,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-02-18 17:14:14,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-02-18 17:14:14,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-18 17:14:14,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2023-02-18 17:14:14,431 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 39 [2023-02-18 17:14:14,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:14:14,431 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2023-02-18 17:14:14,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-18 17:14:14,432 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2023-02-18 17:14:14,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-18 17:14:14,435 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:14:14,435 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 17:14:14,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 17:14:14,640 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 17:14:14,641 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:14:14,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:14:14,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1954831506, now seen corresponding path program 1 times [2023-02-18 17:14:14,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:14:14,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842710210] [2023-02-18 17:14:14,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:14:14,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:14:14,661 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:14:14,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1174046059] [2023-02-18 17:14:14,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:14:14,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:14:14,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:14:14,663 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 17:14:14,665 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 17:14:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:14:14,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 17:14:14,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:14:14,716 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 17:14:14,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 17:14:14,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:14:14,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842710210] [2023-02-18 17:14:14,717 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:14:14,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174046059] [2023-02-18 17:14:14,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174046059] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 17:14:14,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 17:14:14,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 17:14:14,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876936633] [2023-02-18 17:14:14,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 17:14:14,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 17:14:14,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:14:14,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 17:14:14,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 17:14:14,720 INFO L87 Difference]: Start difference. First operand 66 states and 94 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 17:14:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:14:14,764 INFO L93 Difference]: Finished difference Result 72 states and 99 transitions. [2023-02-18 17:14:14,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 17:14:14,768 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 17:14:14,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:14:14,772 INFO L225 Difference]: With dead ends: 72 [2023-02-18 17:14:14,772 INFO L226 Difference]: Without dead ends: 70 [2023-02-18 17:14:14,773 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 17:14:14,775 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 17:14:14,776 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 17:14:14,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-18 17:14:14,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-02-18 17:14:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-18 17:14:14,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 97 transitions. [2023-02-18 17:14:14,802 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 97 transitions. Word has length 45 [2023-02-18 17:14:14,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:14:14,804 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 97 transitions. [2023-02-18 17:14:14,804 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 17:14:14,804 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 97 transitions. [2023-02-18 17:14:14,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-18 17:14:14,805 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:14:14,806 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 17:14:14,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-18 17:14:15,011 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 17:14:15,011 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:14:15,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:14:15,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1322486933, now seen corresponding path program 1 times [2023-02-18 17:14:15,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:14:15,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766369977] [2023-02-18 17:14:15,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:14:15,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:14:15,031 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:14:15,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [368296982] [2023-02-18 17:14:15,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:14:15,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:14:15,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:14:15,038 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 17:14:15,039 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 17:14:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:14:15,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 17:14:15,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:14:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-02-18 17:14:15,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:14:15,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:14:15,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766369977] [2023-02-18 17:14:15,173 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:14:15,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368296982] [2023-02-18 17:14:15,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368296982] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 17:14:15,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 17:14:15,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2023-02-18 17:14:15,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093073653] [2023-02-18 17:14:15,174 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 17:14:15,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 17:14:15,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:14:15,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 17:14:15,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-18 17:14:15,175 INFO L87 Difference]: Start difference. First operand 70 states and 97 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 17:14:15,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:14:15,259 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2023-02-18 17:14:15,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 17:14:15,259 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 17:14:15,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:14:15,260 INFO L225 Difference]: With dead ends: 80 [2023-02-18 17:14:15,260 INFO L226 Difference]: Without dead ends: 77 [2023-02-18 17:14:15,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-02-18 17:14:15,261 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 13 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 17:14:15,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 108 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 17:14:15,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-18 17:14:15,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2023-02-18 17:14:15,273 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 17:14:15,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2023-02-18 17:14:15,274 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 47 [2023-02-18 17:14:15,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:14:15,275 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2023-02-18 17:14:15,275 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 17:14:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2023-02-18 17:14:15,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-18 17:14:15,276 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:14:15,276 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 17:14:15,283 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 17:14:15,481 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 17:14:15,482 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:14:15,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:14:15,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1617953190, now seen corresponding path program 1 times [2023-02-18 17:14:15,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:14:15,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017478231] [2023-02-18 17:14:15,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:14:15,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:14:15,493 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:14:15,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1823334422] [2023-02-18 17:14:15,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:14:15,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:14:15,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:14:15,500 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 17:14:15,502 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 17:14:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:14:15,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-18 17:14:15,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:14:15,601 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 17:14:15,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:14:15,733 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 17:14:15,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:14:15,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017478231] [2023-02-18 17:14:15,735 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:14:15,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823334422] [2023-02-18 17:14:15,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823334422] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:14:15,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:14:15,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2023-02-18 17:14:15,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517412323] [2023-02-18 17:14:15,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:14:15,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 17:14:15,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:14:15,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 17:14:15,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-18 17:14:15,739 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 17:14:15,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:14:15,882 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2023-02-18 17:14:15,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 17:14:15,883 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 17:14:15,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:14:15,884 INFO L225 Difference]: With dead ends: 84 [2023-02-18 17:14:15,884 INFO L226 Difference]: Without dead ends: 80 [2023-02-18 17:14:15,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-02-18 17:14:15,887 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 17:14:15,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 124 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 17:14:15,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-18 17:14:15,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-02-18 17:14:15,905 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 17:14:15,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2023-02-18 17:14:15,906 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 50 [2023-02-18 17:14:15,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:14:15,910 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2023-02-18 17:14:15,910 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 17:14:15,910 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2023-02-18 17:14:15,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-18 17:14:15,912 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:14:15,912 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 17:14:15,920 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 17:14:16,120 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 17:14:16,121 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:14:16,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:14:16,122 INFO L85 PathProgramCache]: Analyzing trace with hash 860577929, now seen corresponding path program 2 times [2023-02-18 17:14:16,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:14:16,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153012953] [2023-02-18 17:14:16,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:14:16,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:14:16,135 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:14:16,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1310594710] [2023-02-18 17:14:16,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 17:14:16,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:14:16,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:14:16,137 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 17:14:16,156 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 17:14:16,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 17:14:16,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 17:14:16,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-18 17:14:16,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:14:16,247 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-02-18 17:14:16,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:14:16,322 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 17:14:16,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:14:16,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153012953] [2023-02-18 17:14:16,322 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:14:16,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310594710] [2023-02-18 17:14:16,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310594710] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:14:16,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:14:16,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-18 17:14:16,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527031311] [2023-02-18 17:14:16,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:14:16,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 17:14:16,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:14:16,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 17:14:16,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-02-18 17:14:16,325 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-18 17:14:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:14:16,904 INFO L93 Difference]: Finished difference Result 106 states and 137 transitions. [2023-02-18 17:14:16,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 17:14:16,905 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) Word has length 52 [2023-02-18 17:14:16,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:14:16,906 INFO L225 Difference]: With dead ends: 106 [2023-02-18 17:14:16,906 INFO L226 Difference]: Without dead ends: 99 [2023-02-18 17:14:16,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2023-02-18 17:14:16,907 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 17:14:16,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 172 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 17:14:16,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-18 17:14:16,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2023-02-18 17:14:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 11 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 17:14:16,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2023-02-18 17:14:16,931 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 52 [2023-02-18 17:14:16,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:14:16,932 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2023-02-18 17:14:16,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-18 17:14:16,933 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2023-02-18 17:14:16,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-18 17:14:16,937 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:14:16,937 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 17:14:16,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-18 17:14:17,143 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 17:14:17,143 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:14:17,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:14:17,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1236716699, now seen corresponding path program 1 times [2023-02-18 17:14:17,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:14:17,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755566305] [2023-02-18 17:14:17,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:14:17,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:14:17,154 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:14:17,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [239558142] [2023-02-18 17:14:17,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:14:17,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:14:17,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:14:17,156 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 17:14:17,178 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 17:14:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:14:17,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-18 17:14:17,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:14:17,266 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 17:14:17,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:14:17,377 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 17:14:17,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:14:17,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755566305] [2023-02-18 17:14:17,378 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:14:17,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239558142] [2023-02-18 17:14:17,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239558142] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:14:17,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:14:17,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-02-18 17:14:17,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104492742] [2023-02-18 17:14:17,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:14:17,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 17:14:17,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:14:17,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 17:14:17,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-02-18 17:14:17,380 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 15 states, 15 states have (on average 2.2) internal successors, (33), 12 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 17:14:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:14:17,909 INFO L93 Difference]: Finished difference Result 99 states and 124 transitions. [2023-02-18 17:14:17,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 17:14:17,910 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 12 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 17:14:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:14:17,910 INFO L225 Difference]: With dead ends: 99 [2023-02-18 17:14:17,910 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 17:14:17,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2023-02-18 17:14:17,911 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 30 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 17:14:17,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 237 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 17:14:17,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 17:14:17,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 17:14:17,912 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 17:14:17,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 17:14:17,912 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2023-02-18 17:14:17,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:14:17,912 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 17:14:17,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 12 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 17:14:17,913 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 17:14:17,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 17:14:17,915 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 17:14:17,923 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 17:14:18,115 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 17:14:18,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 17:14:18,138 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 52) the Hoare annotation is: (let ((.cse11 (- |ULTIMATE.start_main_~q~0#1|)) (.cse8 (* |ULTIMATE.start_main_~r~0#1| (- 1)))) (let ((.cse12 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) (.cse10 (= .cse8 1)) (.cse2 (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~r~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~p~0#1|)))) (.cse4 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse6 (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~s~0#1|))) (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| .cse11)))))) (let ((.cse7 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse9 (or (let ((.cse16 (+ (* |ULTIMATE.start_main_~p~0#1| (- 1)) 1))) (let ((.cse17 (+ (* |ULTIMATE.start_main_~x~0#1| .cse16) (* |ULTIMATE.start_main_~y~0#1| .cse8)))) (and (= .cse16 0) .cse2 .cse4 .cse6 .cse10 (= (+ |ULTIMATE.start_main_~a~0#1| .cse17) |ULTIMATE.start_main_~x~0#1|) (>= .cse17 |ULTIMATE.start_main_~y~0#1|)))) (and .cse2 .cse4 .cse6))) (.cse0 (forall ((|ULTIMATE.start_main_~q~0#1| Int)) (= 1 (+ .cse12 (- (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~q~0#1|)))))) (.cse1 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse3 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~r~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 (= |ULTIMATE.start_main_~s~0#1| (+ .cse8 (- |ULTIMATE.start_main_~r~0#1|))) .cse9 (= (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|) 0) .cse10 (= |ULTIMATE.start_main_~p~0#1| (+ 1 (+ .cse11 (- |ULTIMATE.start_main_~p~0#1|))))) (and (= 1 (+ .cse12 (- (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~q~0#1|)))) .cse7 .cse9) (and .cse2 .cse4 (let ((.cse13 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse14 (= |ULTIMATE.start_main_~b~0#1| (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~s~0#1|)))) (.cse15 (= |ULTIMATE.start_main_~s~0#1| 1))) (or (and .cse4 .cse3 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse13 .cse14 .cse15)))))))) [2023-02-18 17:14:18,138 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 17:14:18,138 INFO L895 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (>= |ULTIMATE.start_main_~x~0#1| 1) [2023-02-18 17:14:18,139 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~r~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~p~0#1|)))) (.cse1 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse2 (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~s~0#1|))) (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (- |ULTIMATE.start_main_~q~0#1|))))))) (or (and .cse0 .cse1 .cse2) (let ((.cse3 (+ (* |ULTIMATE.start_main_~p~0#1| (- 1)) 1)) (.cse4 (* |ULTIMATE.start_main_~r~0#1| (- 1)))) (let ((.cse5 (+ (* |ULTIMATE.start_main_~x~0#1| .cse3) (* |ULTIMATE.start_main_~y~0#1| .cse4)))) (and (= .cse3 0) .cse0 .cse1 .cse2 (= .cse4 1) (= (+ |ULTIMATE.start_main_~a~0#1| .cse5) |ULTIMATE.start_main_~x~0#1|) (>= .cse5 |ULTIMATE.start_main_~y~0#1|)))) (= |ULTIMATE.start_main_~b~0#1| (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~s~0#1|))))) [2023-02-18 17:14:18,139 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (let ((.cse11 (- |ULTIMATE.start_main_~q~0#1|)) (.cse8 (* |ULTIMATE.start_main_~r~0#1| (- 1)))) (let ((.cse12 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) (.cse10 (= .cse8 1)) (.cse2 (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~r~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~p~0#1|)))) (.cse4 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse6 (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~s~0#1|))) (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| .cse11)))))) (let ((.cse7 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse9 (or (let ((.cse16 (+ (* |ULTIMATE.start_main_~p~0#1| (- 1)) 1))) (let ((.cse17 (+ (* |ULTIMATE.start_main_~x~0#1| .cse16) (* |ULTIMATE.start_main_~y~0#1| .cse8)))) (and (= .cse16 0) .cse2 .cse4 .cse6 .cse10 (= (+ |ULTIMATE.start_main_~a~0#1| .cse17) |ULTIMATE.start_main_~x~0#1|) (>= .cse17 |ULTIMATE.start_main_~y~0#1|)))) (and .cse2 .cse4 .cse6))) (.cse0 (forall ((|ULTIMATE.start_main_~q~0#1| Int)) (= 1 (+ .cse12 (- (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~q~0#1|)))))) (.cse1 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse3 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~r~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 (= |ULTIMATE.start_main_~s~0#1| (+ .cse8 (- |ULTIMATE.start_main_~r~0#1|))) .cse9 (= (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|) 0) .cse10 (= |ULTIMATE.start_main_~p~0#1| (+ 1 (+ .cse11 (- |ULTIMATE.start_main_~p~0#1|))))) (and (= 1 (+ .cse12 (- (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~q~0#1|)))) .cse7 .cse9) (and .cse2 .cse4 (let ((.cse13 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse14 (= |ULTIMATE.start_main_~b~0#1| (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~s~0#1|)))) (.cse15 (= |ULTIMATE.start_main_~s~0#1| 1))) (or (and .cse4 .cse3 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse13 .cse14 .cse15)))))))) [2023-02-18 17:14:18,139 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 17:14:18,139 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 18 59) the Hoare annotation is: true [2023-02-18 17:14:18,140 INFO L899 garLoopResultBuilder]: For program point L38(lines 35 52) no Hoare annotation was computed. [2023-02-18 17:14:18,140 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse21 (+ (* |ULTIMATE.start_main_~p~0#1| (- 1)) 1)) (.cse5 (* |ULTIMATE.start_main_~r~0#1| (- 1)))) (let ((.cse20 (+ (* |ULTIMATE.start_main_~x~0#1| .cse21) (* |ULTIMATE.start_main_~y~0#1| .cse5))) (.cse7 (- |ULTIMATE.start_main_~q~0#1|))) (let ((.cse16 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) (.cse13 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse9 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse15 (= |ULTIMATE.start_main_~b~0#1| (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~s~0#1|)))) (.cse10 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse17 (= .cse21 0)) (.cse3 (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~r~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~p~0#1|)))) (.cse4 (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~s~0#1|))) (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| .cse7))))) (.cse6 (= .cse5 1)) (.cse18 (= (+ |ULTIMATE.start_main_~a~0#1| .cse20) |ULTIMATE.start_main_~x~0#1|)) (.cse19 (>= .cse20 |ULTIMATE.start_main_~y~0#1|))) (let ((.cse1 (or (and .cse3 .cse4) (and .cse17 .cse3 .cse4 .cse6 .cse18 .cse19))) (.cse8 (or (and .cse17 .cse13 .cse9 .cse15 .cse4 .cse10 .cse6 .cse18 .cse19) (and .cse3 .cse13 .cse9 .cse15 .cse4 .cse10))) (.cse0 (= 1 (+ .cse16 (- (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~q~0#1|))))) (.cse11 (forall ((|ULTIMATE.start_main_~q~0#1| Int)) (= 1 (+ .cse16 (- (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~q~0#1|)))))) (.cse12 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse2 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse14 (= |ULTIMATE.start_main_~r~0#1| 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2 .cse4) (and .cse1 .cse2 (= |ULTIMATE.start_main_~s~0#1| (+ .cse5 (- |ULTIMATE.start_main_~r~0#1|))) (= (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|) 0) .cse6 (= |ULTIMATE.start_main_~p~0#1| (+ 1 (+ .cse7 (- |ULTIMATE.start_main_~p~0#1|))))) (and .cse8 .cse0 .cse2) (and .cse8 (= |ULTIMATE.start_main_~p~0#1| (+ 1 .cse7)) (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 0) (<= (+ |ULTIMATE.start_main_~b~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) .cse2 .cse9 .cse10) (and .cse11 .cse0 .cse12 .cse3 .cse13 .cse2 .cse14 .cse4) (and .cse11 .cse12 .cse3 .cse13 .cse2 .cse14 .cse9 .cse15 .cse10 (>= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|))))))) [2023-02-18 17:14:18,140 INFO L895 garLoopResultBuilder]: At program point L36-1(line 36) the Hoare annotation is: (let ((.cse21 (+ (* |ULTIMATE.start_main_~p~0#1| (- 1)) 1)) (.cse6 (* |ULTIMATE.start_main_~r~0#1| (- 1)))) (let ((.cse20 (+ (* |ULTIMATE.start_main_~x~0#1| .cse21) (* |ULTIMATE.start_main_~y~0#1| .cse6))) (.cse8 (- |ULTIMATE.start_main_~q~0#1|))) (let ((.cse16 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) (.cse13 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse9 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse15 (= |ULTIMATE.start_main_~b~0#1| (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~s~0#1|)))) (.cse10 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse17 (= .cse21 0)) (.cse3 (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~r~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~p~0#1|)))) (.cse4 (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~s~0#1|))) (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| .cse8))))) (.cse7 (= .cse6 1)) (.cse18 (= (+ |ULTIMATE.start_main_~a~0#1| .cse20) |ULTIMATE.start_main_~x~0#1|)) (.cse19 (>= .cse20 |ULTIMATE.start_main_~y~0#1|))) (let ((.cse1 (or (and .cse3 .cse4) (and .cse17 .cse3 .cse4 .cse7 .cse18 .cse19))) (.cse5 (or (and .cse17 .cse13 .cse9 .cse15 .cse4 .cse10 .cse7 .cse18 .cse19) (and .cse3 .cse13 .cse9 .cse15 .cse4 .cse10))) (.cse0 (= 1 (+ .cse16 (- (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~q~0#1|))))) (.cse11 (forall ((|ULTIMATE.start_main_~q~0#1| Int)) (= 1 (+ .cse16 (- (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~q~0#1|)))))) (.cse12 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse2 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse14 (= |ULTIMATE.start_main_~r~0#1| 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2 .cse4) (and .cse5 .cse0 .cse2) (and .cse1 .cse2 (= |ULTIMATE.start_main_~s~0#1| (+ .cse6 (- |ULTIMATE.start_main_~r~0#1|))) (= (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|) 0) .cse7 (= |ULTIMATE.start_main_~p~0#1| (+ 1 (+ .cse8 (- |ULTIMATE.start_main_~p~0#1|))))) (and .cse5 (= |ULTIMATE.start_main_~p~0#1| (+ 1 .cse8)) (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 0) (<= (+ |ULTIMATE.start_main_~b~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) .cse2 .cse9 .cse10) (and .cse11 .cse0 .cse12 .cse3 .cse13 .cse2 .cse14 .cse4) (and .cse11 .cse12 .cse3 .cse13 .cse2 .cse14 .cse9 .cse15 .cse10 (>= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|))))))) [2023-02-18 17:14:18,140 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 17:14:18,141 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 17:14:18,141 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2023-02-18 17:14:18,141 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2023-02-18 17:14:18,142 INFO L902 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2023-02-18 17:14:18,142 INFO L902 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: true [2023-02-18 17:14:18,142 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse9 (* |ULTIMATE.start_main_~r~0#1| (- 1))) (.cse11 (- |ULTIMATE.start_main_~q~0#1|))) (let ((.cse12 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) (.cse2 (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~r~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~p~0#1|)))) (.cse4 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse6 (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~s~0#1|))) (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| .cse11))))) (.cse10 (= .cse9 1))) (let ((.cse7 (or (and .cse2 .cse4 .cse6) (let ((.cse14 (+ (* |ULTIMATE.start_main_~p~0#1| (- 1)) 1))) (let ((.cse15 (+ (* |ULTIMATE.start_main_~x~0#1| .cse14) (* |ULTIMATE.start_main_~y~0#1| .cse9)))) (and (= .cse14 0) .cse2 .cse4 .cse6 .cse10 (= (+ |ULTIMATE.start_main_~a~0#1| .cse15) |ULTIMATE.start_main_~x~0#1|) (>= .cse15 |ULTIMATE.start_main_~y~0#1|)))))) (.cse8 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse0 (forall ((|ULTIMATE.start_main_~q~0#1| Int)) (= 1 (+ .cse12 (- (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~q~0#1|)))))) (.cse1 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse3 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse13 (= |ULTIMATE.start_main_~b~0#1| (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~s~0#1|))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 (= |ULTIMATE.start_main_~s~0#1| (+ .cse9 (- |ULTIMATE.start_main_~r~0#1|))) (= (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|) 0) .cse10 (= |ULTIMATE.start_main_~p~0#1| (+ 1 (+ .cse11 (- |ULTIMATE.start_main_~p~0#1|))))) (and .cse7 (= 1 (+ .cse12 (- (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~q~0#1|)))) .cse8) (and .cse4 .cse3 (= |ULTIMATE.start_main_~q~0#1| 0) .cse13 (= |ULTIMATE.start_main_~s~0#1| 1)) (and .cse0 .cse1 .cse3 .cse5 .cse13))))) [2023-02-18 17:14:18,142 INFO L902 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2023-02-18 17:14:18,142 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2023-02-18 17:14:18,142 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 51) no Hoare annotation was computed. [2023-02-18 17:14:18,143 INFO L895 garLoopResultBuilder]: At program point L43-2(lines 35 52) the Hoare annotation is: (let ((.cse21 (+ (* |ULTIMATE.start_main_~p~0#1| (- 1)) 1)) (.cse5 (* |ULTIMATE.start_main_~r~0#1| (- 1)))) (let ((.cse20 (+ (* |ULTIMATE.start_main_~x~0#1| .cse21) (* |ULTIMATE.start_main_~y~0#1| .cse5))) (.cse7 (- |ULTIMATE.start_main_~q~0#1|))) (let ((.cse16 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) (.cse13 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse9 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse15 (= |ULTIMATE.start_main_~b~0#1| (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~s~0#1|)))) (.cse10 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse17 (= .cse21 0)) (.cse3 (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~r~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~p~0#1|)))) (.cse4 (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~s~0#1|))) (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| .cse7))))) (.cse6 (= .cse5 1)) (.cse18 (= (+ |ULTIMATE.start_main_~a~0#1| .cse20) |ULTIMATE.start_main_~x~0#1|)) (.cse19 (>= .cse20 |ULTIMATE.start_main_~y~0#1|))) (let ((.cse1 (or (and .cse3 .cse4) (and .cse17 .cse3 .cse4 .cse6 .cse18 .cse19))) (.cse8 (or (and .cse17 .cse13 .cse9 .cse15 .cse4 .cse10 .cse6 .cse18 .cse19) (and .cse3 .cse13 .cse9 .cse15 .cse4 .cse10))) (.cse0 (= 1 (+ .cse16 (- (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~q~0#1|))))) (.cse11 (forall ((|ULTIMATE.start_main_~q~0#1| Int)) (= 1 (+ .cse16 (- (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~q~0#1|)))))) (.cse12 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse2 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse14 (= |ULTIMATE.start_main_~r~0#1| 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2 .cse4) (and .cse1 .cse2 (= |ULTIMATE.start_main_~s~0#1| (+ .cse5 (- |ULTIMATE.start_main_~r~0#1|))) (= (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|) 0) .cse6 (= |ULTIMATE.start_main_~p~0#1| (+ 1 (+ .cse7 (- |ULTIMATE.start_main_~p~0#1|))))) (and .cse8 .cse0 .cse2) (and .cse8 (= |ULTIMATE.start_main_~p~0#1| (+ 1 .cse7)) (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 0) (<= (+ |ULTIMATE.start_main_~b~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) .cse2 .cse9 .cse10) (and .cse11 .cse0 .cse12 .cse3 .cse13 .cse2 .cse14 .cse4) (and .cse11 .cse12 .cse3 .cse13 .cse2 .cse14 .cse9 .cse15 .cse10 (>= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|))))))) [2023-02-18 17:14:18,143 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse21 (+ (* |ULTIMATE.start_main_~p~0#1| (- 1)) 1)) (.cse4 (* |ULTIMATE.start_main_~r~0#1| (- 1)))) (let ((.cse20 (+ (* |ULTIMATE.start_main_~x~0#1| .cse21) (* |ULTIMATE.start_main_~y~0#1| .cse4))) (.cse6 (- |ULTIMATE.start_main_~q~0#1|))) (let ((.cse16 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) (.cse12 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse7 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse15 (= |ULTIMATE.start_main_~b~0#1| (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~s~0#1|)))) (.cse8 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse17 (= .cse21 0)) (.cse11 (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~r~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~p~0#1|)))) (.cse14 (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~s~0#1|))) (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| .cse6))))) (.cse5 (= .cse4 1)) (.cse18 (= (+ |ULTIMATE.start_main_~a~0#1| .cse20) |ULTIMATE.start_main_~x~0#1|)) (.cse19 (>= .cse20 |ULTIMATE.start_main_~y~0#1|))) (let ((.cse3 (or (and .cse11 .cse14) (and .cse17 .cse11 .cse14 .cse5 .cse18 .cse19))) (.cse1 (or (and .cse11 .cse12 .cse7 .cse15 .cse14 .cse8) (and .cse17 .cse11 .cse12 .cse7 .cse15 .cse14 .cse8 .cse5 .cse18 .cse19))) (.cse0 (= 1 (+ .cse16 (- (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~q~0#1|))))) (.cse9 (forall ((|ULTIMATE.start_main_~q~0#1| Int)) (= 1 (+ .cse16 (- (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~q~0#1|)))))) (.cse10 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse2 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse13 (= |ULTIMATE.start_main_~r~0#1| 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse3 .cse2 (= |ULTIMATE.start_main_~s~0#1| (+ .cse4 (- |ULTIMATE.start_main_~r~0#1|))) (= (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|) 0) .cse5 (= |ULTIMATE.start_main_~p~0#1| (+ 1 (+ .cse6 (- |ULTIMATE.start_main_~p~0#1|))))) (and (= |ULTIMATE.start_main_~p~0#1| (+ 1 .cse6)) (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 0) .cse1 (<= (+ |ULTIMATE.start_main_~b~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) .cse2 .cse7 .cse8) (and .cse9 .cse0 .cse10 .cse11 .cse12 .cse2 .cse13 .cse14) (and .cse9 .cse10 .cse11 .cse12 .cse2 .cse13 .cse7 .cse15 .cse8 (>= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|))))))) [2023-02-18 17:14:18,143 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7 9) the Hoare annotation is: true [2023-02-18 17:14:18,143 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2023-02-18 17:14:18,144 INFO L899 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2023-02-18 17:14:18,144 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2023-02-18 17:14:18,144 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2023-02-18 17:14:18,144 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 14) no Hoare annotation was computed. [2023-02-18 17:14:18,144 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 16) no Hoare annotation was computed. [2023-02-18 17:14:18,144 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 10 16) the Hoare annotation is: true [2023-02-18 17:14:18,144 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 16) no Hoare annotation was computed. [2023-02-18 17:14:18,145 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2023-02-18 17:14:18,148 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2023-02-18 17:14:18,150 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 17:14:18,167 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0#1,QUANTIFIED] [2023-02-18 17:14:18,168 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0#1,QUANTIFIED] [2023-02-18 17:14:18,182 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0#1,QUANTIFIED] [2023-02-18 17:14:18,187 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0#1,QUANTIFIED] [2023-02-18 17:14:18,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 05:14:18 BoogieIcfgContainer [2023-02-18 17:14:18,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 17:14:18,193 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 17:14:18,193 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 17:14:18,193 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 17:14:18,194 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 05:14:12" (3/4) ... [2023-02-18 17:14:18,196 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 17:14:18,202 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-18 17:14:18,202 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 17:14:18,207 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-18 17:14:18,207 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 17:14:18,207 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 17:14:18,208 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 17:14:18,242 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 17:14:18,243 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 17:14:18,243 INFO L158 Benchmark]: Toolchain (without parser) took 6459.08ms. Allocated memory was 148.9MB in the beginning and 186.6MB in the end (delta: 37.7MB). Free memory was 118.5MB in the beginning and 124.7MB in the end (delta: -6.2MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2023-02-18 17:14:18,243 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 68.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 17:14:18,244 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.74ms. Allocated memory is still 148.9MB. Free memory was 117.9MB in the beginning and 107.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 17:14:18,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.08ms. Allocated memory is still 148.9MB. Free memory was 107.4MB in the beginning and 105.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 17:14:18,244 INFO L158 Benchmark]: Boogie Preprocessor took 16.01ms. Allocated memory is still 148.9MB. Free memory was 105.9MB in the beginning and 104.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 17:14:18,245 INFO L158 Benchmark]: RCFGBuilder took 313.98ms. Allocated memory is still 148.9MB. Free memory was 104.7MB in the beginning and 94.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 17:14:18,245 INFO L158 Benchmark]: TraceAbstraction took 5850.47ms. Allocated memory was 148.9MB in the beginning and 186.6MB in the end (delta: 37.7MB). Free memory was 93.3MB in the beginning and 127.8MB in the end (delta: -34.5MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2023-02-18 17:14:18,246 INFO L158 Benchmark]: Witness Printer took 49.59ms. Allocated memory is still 186.6MB. Free memory was 127.8MB in the beginning and 124.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-18 17:14:18,248 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.17ms. Allocated memory is still 117.4MB. Free memory is still 68.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.74ms. Allocated memory is still 148.9MB. Free memory was 117.9MB in the beginning and 107.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.08ms. Allocated memory is still 148.9MB. Free memory was 107.4MB in the beginning and 105.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.01ms. Allocated memory is still 148.9MB. Free memory was 105.9MB in the beginning and 104.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 313.98ms. Allocated memory is still 148.9MB. Free memory was 104.7MB in the beginning and 94.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5850.47ms. Allocated memory was 148.9MB in the beginning and 186.6MB in the end (delta: 37.7MB). Free memory was 93.3MB in the beginning and 127.8MB in the end (delta: -34.5MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. * Witness Printer took 49.59ms. Allocated memory is still 186.6MB. Free memory was 127.8MB in the beginning and 124.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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_~q~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~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: 5.7s, OverallIterations: 8, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 1141 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 869 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1162 IncrementalHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 272 mSDtfsCounter, 1162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 615 GetRequests, 516 SyntacticMatches, 8 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=7, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 63 PreInvPairs, 111 NumberOfFragments, 4033 HoareAnnotationTreeSize, 63 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, 361 NumberOfCodeBlocks, 361 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 583 ConstructedInterpolants, 2 QuantifiedInterpolants, 2190 SizeOfPredicates, 52 NumberOfNonLiveVariables, 959 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 608/666 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 17:14:18,264 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0#1,QUANTIFIED] [2023-02-18 17:14:18,264 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0#1,QUANTIFIED] [2023-02-18 17:14:18,265 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0#1,QUANTIFIED] [2023-02-18 17:14:18,266 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~q~0#1,QUANTIFIED] Derived loop invariant: (((((((1 == p * s + -(r * q) && ((a == y * r + x * p && a + -b == y * (r + -s) + x * (p + -q)) || (((((p * -1 + 1 == 0 && a == y * r + x * p) && a + -b == y * (r + -s) + x * (p + -q)) && r * -1 == 1) && a + (x * (p * -1 + 1) + y * (r * -1)) == x) && x * (p * -1 + 1) + y * (r * -1) >= y))) && x >= 1) || (((1 == p * s + -(r * q) && a == y * r + x * p) && x >= 1) && a + -b == y * (r + -s) + x * (p + -q))) || (((((((a == y * r + x * p && a + -b == y * (r + -s) + x * (p + -q)) || (((((p * -1 + 1 == 0 && a == y * r + x * p) && a + -b == y * (r + -s) + x * (p + -q)) && r * -1 == 1) && a + (x * (p * -1 + 1) + y * (r * -1)) == x) && x * (p * -1 + 1) + y * (r * -1) >= y)) && x >= 1) && s == r * -1 + -r) && q + p == 0) && r * -1 == 1) && p == 1 + (-q + -p))) || (((((((((((p * -1 + 1 == 0 && p == 1) && q == 0) && b == x * q + y * s) && a + -b == y * (r + -s) + x * (p + -q)) && s == 1) && r * -1 == 1) && a + (x * (p * -1 + 1) + y * (r * -1)) == x) && x * (p * -1 + 1) + y * (r * -1) >= y) || (((((a == y * r + x * p && p == 1) && q == 0) && b == x * q + y * s) && a + -b == y * (r + -s) + x * (p + -q)) && s == 1)) && 1 == p * s + -(r * q)) && x >= 1)) || (((((((((((((((p * -1 + 1 == 0 && p == 1) && q == 0) && b == x * q + y * s) && a + -b == y * (r + -s) + x * (p + -q)) && s == 1) && r * -1 == 1) && a + (x * (p * -1 + 1) + y * (r * -1)) == x) && x * (p * -1 + 1) + y * (r * -1) >= y) || (((((a == y * r + x * p && p == 1) && q == 0) && b == x * q + y * s) && a + -b == y * (r + -s) + x * (p + -q)) && s == 1)) && p == 1 + -q) && r + s == 0) && b + 1 <= a + b) && x >= 1) && q == 0) && s == 1)) || ((((((((forall ULTIMATE.start_main_~q~0#1 : int :: 1 == p * s + -(r * ULTIMATE.start_main_~q~0#1)) && 1 == p * s + -(r * q)) && a == x) && a == y * r + x * p) && p == 1) && x >= 1) && r == 0) && a + -b == y * (r + -s) + x * (p + -q))) || ((((((((((forall ULTIMATE.start_main_~q~0#1 : int :: 1 == p * s + -(r * ULTIMATE.start_main_~q~0#1)) && a == x) && a == y * r + x * p) && p == 1) && x >= 1) && r == 0) && q == 0) && b == x * q + y * s) && s == 1) && b >= y) RESULT: Ultimate proved your program to be correct! [2023-02-18 17:14:18,278 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