/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 17:21:48,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 17:21:48,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 17:21:48,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 17:21:48,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 17:21:48,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 17:21:48,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 17:21:48,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 17:21:48,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 17:21:48,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 17:21:48,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 17:21:48,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 17:21:48,166 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 17:21:48,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 17:21:48,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 17:21:48,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 17:21:48,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 17:21:48,172 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 17:21:48,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 17:21:48,177 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 17:21:48,179 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 17:21:48,182 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 17:21:48,184 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 17:21:48,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 17:21:48,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 17:21:48,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 17:21:48,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 17:21:48,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 17:21:48,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 17:21:48,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 17:21:48,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 17:21:48,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 17:21:48,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 17:21:48,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 17:21:48,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 17:21:48,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 17:21:48,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 17:21:48,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 17:21:48,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 17:21:48,216 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 17:21:48,217 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 17:21:48,222 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 17:21:48,276 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 17:21:48,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 17:21:48,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 17:21:48,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 17:21:48,279 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 17:21:48,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 17:21:48,280 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 17:21:48,280 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 17:21:48,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 17:21:48,280 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 17:21:48,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 17:21:48,282 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 17:21:48,282 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 17:21:48,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 17:21:48,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 17:21:48,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 17:21:48,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 17:21:48,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 17:21:48,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 17:21:48,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 17:21:48,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 17:21:48,284 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 17:21:48,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 17:21:48,284 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 17:21:48,285 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 17:21:48,285 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-bitabs/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 [2021-01-06 17:21:48,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 17:21:48,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 17:21:48,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 17:21:48,745 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 17:21:48,745 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 17:21:48,746 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound10.c [2021-01-06 17:21:48,816 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/20cdd219d/b4b033ca9c6b4cab809d439c663b2e38/FLAGbf6c9eaf5 [2021-01-06 17:21:49,421 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 17:21:49,422 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound10.c [2021-01-06 17:21:49,429 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/20cdd219d/b4b033ca9c6b4cab809d439c663b2e38/FLAGbf6c9eaf5 [2021-01-06 17:21:49,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/20cdd219d/b4b033ca9c6b4cab809d439c663b2e38 [2021-01-06 17:21:49,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 17:21:49,821 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 17:21:49,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 17:21:49,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 17:21:49,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 17:21:49,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 05:21:49" (1/1) ... [2021-01-06 17:21:49,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35c7f8a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 05:21:49, skipping insertion in model container [2021-01-06 17:21:49,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 05:21:49" (1/1) ... [2021-01-06 17:21:49,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 17:21:49,858 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 17:21:50,022 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound10.c[576,589] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~y~0,] left hand side expression in assignment: lhs: VariableLHS[~q~0,] left hand side expression in assignment: lhs: VariableLHS[~r~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] left hand side expression in assignment: lhs: VariableLHS[~r~0,] left hand side expression in assignment: lhs: VariableLHS[~q~0,] [2021-01-06 17:21:50,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 17:21:50,054 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 17:21:50,068 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound10.c[576,589] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~y~0,] left hand side expression in assignment: lhs: VariableLHS[~q~0,] left hand side expression in assignment: lhs: VariableLHS[~r~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] left hand side expression in assignment: lhs: VariableLHS[~r~0,] left hand side expression in assignment: lhs: VariableLHS[~q~0,] [2021-01-06 17:21:50,077 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 17:21:50,093 INFO L208 MainTranslator]: Completed translation [2021-01-06 17:21:50,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 05:21:50 WrapperNode [2021-01-06 17:21:50,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 17:21:50,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 17:21:50,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 17:21:50,097 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 17:21:50,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 05:21:50" (1/1) ... [2021-01-06 17:21:50,118 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 05:21:50" (1/1) ... [2021-01-06 17:21:50,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 17:21:50,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 17:21:50,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 17:21:50,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 17:21:50,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 05:21:50" (1/1) ... [2021-01-06 17:21:50,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 05:21:50" (1/1) ... [2021-01-06 17:21:50,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 05:21:50" (1/1) ... [2021-01-06 17:21:50,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 05:21:50" (1/1) ... [2021-01-06 17:21:50,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 05:21:50" (1/1) ... [2021-01-06 17:21:50,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 05:21:50" (1/1) ... [2021-01-06 17:21:50,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 05:21:50" (1/1) ... [2021-01-06 17:21:50,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 17:21:50,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 17:21:50,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 17:21:50,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 17:21:50,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 05:21:50" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 17:21:50,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 17:21:50,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 17:21:50,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 17:21:50,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 17:21:50,893 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 17:21:50,893 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-01-06 17:21:50,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 05:21:50 BoogieIcfgContainer [2021-01-06 17:21:50,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 17:21:50,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 17:21:50,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 17:21:50,904 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 17:21:50,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 05:21:49" (1/3) ... [2021-01-06 17:21:50,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@211bb55f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 05:21:50, skipping insertion in model container [2021-01-06 17:21:50,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 05:21:50" (2/3) ... [2021-01-06 17:21:50,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@211bb55f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 05:21:50, skipping insertion in model container [2021-01-06 17:21:50,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 05:21:50" (3/3) ... [2021-01-06 17:21:50,910 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound10.c [2021-01-06 17:21:50,921 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 17:21:50,927 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2021-01-06 17:21:50,946 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-01-06 17:21:51,029 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 17:21:51,032 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 17:21:51,033 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 17:21:51,033 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 17:21:51,033 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 17:21:51,033 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 17:21:51,033 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 17:21:51,033 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 17:21:51,078 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2021-01-06 17:21:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-06 17:21:51,087 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 17:21:51,088 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 17:21:51,088 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 17:21:51,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 17:21:51,095 INFO L82 PathProgramCache]: Analyzing trace with hash 330581779, now seen corresponding path program 1 times [2021-01-06 17:21:51,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 17:21:51,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858988843] [2021-01-06 17:21:51,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 17:21:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 17:21:51,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 17:21:51,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858988843] [2021-01-06 17:21:51,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 17:21:51,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 17:21:51,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254095674] [2021-01-06 17:21:51,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 17:21:51,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 17:21:51,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 17:21:51,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 17:21:51,279 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2021-01-06 17:21:51,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 17:21:51,301 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2021-01-06 17:21:51,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 17:21:51,303 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2021-01-06 17:21:51,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 17:21:51,312 INFO L225 Difference]: With dead ends: 83 [2021-01-06 17:21:51,312 INFO L226 Difference]: Without dead ends: 39 [2021-01-06 17:21:51,316 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 17:21:51,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-01-06 17:21:51,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-01-06 17:21:51,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2021-01-06 17:21:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2021-01-06 17:21:51,358 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 11 [2021-01-06 17:21:51,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 17:21:51,358 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2021-01-06 17:21:51,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 17:21:51,359 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2021-01-06 17:21:51,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-06 17:21:51,359 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 17:21:51,359 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 17:21:51,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 17:21:51,360 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 17:21:51,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 17:21:51,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1507472743, now seen corresponding path program 1 times [2021-01-06 17:21:51,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 17:21:51,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039364677] [2021-01-06 17:21:51,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 17:21:51,385 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 17:21:51,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1380184732] [2021-01-06 17:21:51,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:21:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 17:21:51,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 25 conjunts are in the unsatisfiable core [2021-01-06 17:21:51,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 17:21:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 17:21:51,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039364677] [2021-01-06 17:21:51,771 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 17:21:51,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380184732] [2021-01-06 17:21:51,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 17:21:51,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 17:21:51,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651749321] [2021-01-06 17:21:51,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 17:21:51,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 17:21:51,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 17:21:51,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-01-06 17:21:51,774 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 9 states. [2021-01-06 17:21:52,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 17:21:52,186 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2021-01-06 17:21:52,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 17:21:52,187 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2021-01-06 17:21:52,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 17:21:52,189 INFO L225 Difference]: With dead ends: 52 [2021-01-06 17:21:52,189 INFO L226 Difference]: Without dead ends: 50 [2021-01-06 17:21:52,190 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-01-06 17:21:52,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-01-06 17:21:52,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2021-01-06 17:21:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2021-01-06 17:21:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2021-01-06 17:21:52,209 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 11 [2021-01-06 17:21:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 17:21:52,209 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2021-01-06 17:21:52,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 17:21:52,210 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2021-01-06 17:21:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-01-06 17:21:52,213 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 17:21:52,214 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 17:21:52,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-01-06 17:21:52,415 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 17:21:52,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 17:21:52,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1277171076, now seen corresponding path program 1 times [2021-01-06 17:21:52,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 17:21:52,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011585529] [2021-01-06 17:21:52,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 17:21:52,436 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 17:21:52,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [289703192] [2021-01-06 17:21:52,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:21:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 17:21:52,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 25 conjunts are in the unsatisfiable core [2021-01-06 17:21:52,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 17:21:52,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 17:21:52,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011585529] [2021-01-06 17:21:52,731 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 17:21:52,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289703192] [2021-01-06 17:21:52,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 17:21:52,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 17:21:52,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414356021] [2021-01-06 17:21:52,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 17:21:52,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 17:21:52,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 17:21:52,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-01-06 17:21:52,734 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 10 states. [2021-01-06 17:21:53,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 17:21:53,226 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2021-01-06 17:21:53,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 17:21:53,227 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2021-01-06 17:21:53,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 17:21:53,228 INFO L225 Difference]: With dead ends: 70 [2021-01-06 17:21:53,228 INFO L226 Difference]: Without dead ends: 60 [2021-01-06 17:21:53,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2021-01-06 17:21:53,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-01-06 17:21:53,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2021-01-06 17:21:53,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2021-01-06 17:21:53,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2021-01-06 17:21:53,240 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 13 [2021-01-06 17:21:53,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 17:21:53,240 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2021-01-06 17:21:53,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 17:21:53,241 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2021-01-06 17:21:53,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 17:21:53,241 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 17:21:53,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 17:21:53,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:21:53,455 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 17:21:53,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 17:21:53,457 INFO L82 PathProgramCache]: Analyzing trace with hash 916732292, now seen corresponding path program 1 times [2021-01-06 17:21:53,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 17:21:53,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062116704] [2021-01-06 17:21:53,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 17:21:53,474 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 17:21:53,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [861797466] [2021-01-06 17:21:53,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:21:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 17:21:53,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2021-01-06 17:21:53,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 17:21:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 17:21:53,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062116704] [2021-01-06 17:21:53,574 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 17:21:53,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861797466] [2021-01-06 17:21:53,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 17:21:53,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 17:21:53,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554129647] [2021-01-06 17:21:53,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 17:21:53,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 17:21:53,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 17:21:53,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 17:21:53,576 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 5 states. [2021-01-06 17:21:53,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 17:21:53,711 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2021-01-06 17:21:53,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 17:21:53,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2021-01-06 17:21:53,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 17:21:53,713 INFO L225 Difference]: With dead ends: 95 [2021-01-06 17:21:53,714 INFO L226 Difference]: Without dead ends: 89 [2021-01-06 17:21:53,714 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 17:21:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-01-06 17:21:53,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2021-01-06 17:21:53,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2021-01-06 17:21:53,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2021-01-06 17:21:53,726 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 16 [2021-01-06 17:21:53,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 17:21:53,727 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2021-01-06 17:21:53,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 17:21:53,727 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2021-01-06 17:21:53,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 17:21:53,728 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 17:21:53,728 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 17:21:53,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:21:53,939 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 17:21:53,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 17:21:53,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1552659725, now seen corresponding path program 1 times [2021-01-06 17:21:53,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 17:21:53,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520646578] [2021-01-06 17:21:53,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 17:21:53,957 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 17:21:53,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1468506473] [2021-01-06 17:21:53,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:21:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 17:21:54,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 26 conjunts are in the unsatisfiable core [2021-01-06 17:21:54,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 17:21:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 17:21:54,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520646578] [2021-01-06 17:21:54,126 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 17:21:54,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468506473] [2021-01-06 17:21:54,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 17:21:54,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2021-01-06 17:21:54,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569205193] [2021-01-06 17:21:54,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 17:21:54,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 17:21:54,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 17:21:54,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-01-06 17:21:54,129 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 8 states. [2021-01-06 17:21:54,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 17:21:54,456 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2021-01-06 17:21:54,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 17:21:54,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2021-01-06 17:21:54,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 17:21:54,462 INFO L225 Difference]: With dead ends: 129 [2021-01-06 17:21:54,462 INFO L226 Difference]: Without dead ends: 123 [2021-01-06 17:21:54,463 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-01-06 17:21:54,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-01-06 17:21:54,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 90. [2021-01-06 17:21:54,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2021-01-06 17:21:54,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2021-01-06 17:21:54,483 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 25 [2021-01-06 17:21:54,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 17:21:54,484 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2021-01-06 17:21:54,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 17:21:54,484 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2021-01-06 17:21:54,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 17:21:54,485 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 17:21:54,485 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 17:21:54,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:21:54,699 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 17:21:54,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 17:21:54,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1755069467, now seen corresponding path program 1 times [2021-01-06 17:21:54,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 17:21:54,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181150493] [2021-01-06 17:21:54,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 17:21:54,723 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 17:21:54,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [589433548] [2021-01-06 17:21:54,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:21:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 17:21:54,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 25 conjunts are in the unsatisfiable core [2021-01-06 17:21:54,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 17:21:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 17:21:54,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181150493] [2021-01-06 17:21:54,956 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 17:21:54,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589433548] [2021-01-06 17:21:54,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 17:21:54,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-01-06 17:21:54,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287678273] [2021-01-06 17:21:54,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 17:21:54,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 17:21:54,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 17:21:54,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-01-06 17:21:54,969 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 9 states. [2021-01-06 17:21:55,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 17:21:55,413 INFO L93 Difference]: Finished difference Result 155 states and 174 transitions. [2021-01-06 17:21:55,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 17:21:55,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2021-01-06 17:21:55,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 17:21:55,415 INFO L225 Difference]: With dead ends: 155 [2021-01-06 17:21:55,415 INFO L226 Difference]: Without dead ends: 96 [2021-01-06 17:21:55,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-01-06 17:21:55,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-01-06 17:21:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2021-01-06 17:21:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2021-01-06 17:21:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2021-01-06 17:21:55,430 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 26 [2021-01-06 17:21:55,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 17:21:55,430 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2021-01-06 17:21:55,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 17:21:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2021-01-06 17:21:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-06 17:21:55,431 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 17:21:55,431 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 17:21:55,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-01-06 17:21:55,645 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 17:21:55,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 17:21:55,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1828677220, now seen corresponding path program 2 times [2021-01-06 17:21:55,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 17:21:55,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971144660] [2021-01-06 17:21:55,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 17:21:55,662 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 17:21:55,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [923780220] [2021-01-06 17:21:55,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:21:55,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 17:21:55,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 17:21:55,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 30 conjunts are in the unsatisfiable core [2021-01-06 17:21:55,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 17:21:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 17:21:55,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971144660] [2021-01-06 17:21:55,876 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 17:21:55,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923780220] [2021-01-06 17:21:55,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 17:21:55,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-01-06 17:21:55,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475122088] [2021-01-06 17:21:55,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 17:21:55,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 17:21:55,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 17:21:55,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-01-06 17:21:55,879 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand 9 states. [2021-01-06 17:21:56,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 17:21:56,373 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2021-01-06 17:21:56,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 17:21:56,374 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2021-01-06 17:21:56,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 17:21:56,377 INFO L225 Difference]: With dead ends: 163 [2021-01-06 17:21:56,378 INFO L226 Difference]: Without dead ends: 157 [2021-01-06 17:21:56,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2021-01-06 17:21:56,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-01-06 17:21:56,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 108. [2021-01-06 17:21:56,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-01-06 17:21:56,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2021-01-06 17:21:56,414 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 34 [2021-01-06 17:21:56,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 17:21:56,416 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2021-01-06 17:21:56,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 17:21:56,416 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2021-01-06 17:21:56,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 17:21:56,421 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 17:21:56,421 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 17:21:56,636 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:21:56,637 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 17:21:56,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 17:21:56,638 INFO L82 PathProgramCache]: Analyzing trace with hash -797667638, now seen corresponding path program 1 times [2021-01-06 17:21:56,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 17:21:56,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568773743] [2021-01-06 17:21:56,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 17:21:56,655 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 17:21:56,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1426367217] [2021-01-06 17:21:56,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:21:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 17:21:56,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 40 conjunts are in the unsatisfiable core [2021-01-06 17:21:56,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 17:21:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 17:21:57,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568773743] [2021-01-06 17:21:57,122 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 17:21:57,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426367217] [2021-01-06 17:21:57,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 17:21:57,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2021-01-06 17:21:57,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258634498] [2021-01-06 17:21:57,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 17:21:57,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 17:21:57,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 17:21:57,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-01-06 17:21:57,125 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand 14 states. [2021-01-06 17:21:57,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 17:21:57,864 INFO L93 Difference]: Finished difference Result 173 states and 196 transitions. [2021-01-06 17:21:57,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 17:21:57,865 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2021-01-06 17:21:57,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 17:21:57,866 INFO L225 Difference]: With dead ends: 173 [2021-01-06 17:21:57,867 INFO L226 Difference]: Without dead ends: 163 [2021-01-06 17:21:57,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2021-01-06 17:21:57,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-01-06 17:21:57,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 130. [2021-01-06 17:21:57,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2021-01-06 17:21:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2021-01-06 17:21:57,887 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 35 [2021-01-06 17:21:57,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 17:21:57,887 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2021-01-06 17:21:57,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 17:21:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2021-01-06 17:21:57,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-01-06 17:21:57,889 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 17:21:57,889 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 17:21:58,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:21:58,105 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 17:21:58,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 17:21:58,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1020421613, now seen corresponding path program 3 times [2021-01-06 17:21:58,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 17:21:58,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302863792] [2021-01-06 17:21:58,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 17:21:58,135 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 17:21:58,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [506880524] [2021-01-06 17:21:58,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:21:58,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-01-06 17:21:58,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 17:21:58,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 22 conjunts are in the unsatisfiable core [2021-01-06 17:21:58,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 17:21:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 17:21:58,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302863792] [2021-01-06 17:21:58,343 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 17:21:58,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506880524] [2021-01-06 17:21:58,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 17:21:58,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-01-06 17:21:58,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186538036] [2021-01-06 17:21:58,344 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 17:21:58,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 17:21:58,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 17:21:58,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-06 17:21:58,345 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand 7 states. [2021-01-06 17:22:02,369 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (= c_ULTIMATE.start_main_~b~0 (* c_ULTIMATE.start_main_~a~0 c_ULTIMATE.start_main_~y~0)))) (or (and (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond) (not .cse0)) (and (= 1 c_ULTIMATE.start___VERIFIER_assert_~cond) .cse0))) (= (mod c_ULTIMATE.start_main_~a~0 (- 2)) 0) (= c_ULTIMATE.start_main_~b~0 (* 2 (* (div (* c_ULTIMATE.start_main_~a~0 (- 1)) (- 2)) c_ULTIMATE.start_main_~y~0)))) is different from false [2021-01-06 17:22:15,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 17:22:15,887 INFO L93 Difference]: Finished difference Result 130 states and 147 transitions. [2021-01-06 17:22:15,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 17:22:15,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2021-01-06 17:22:15,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 17:22:15,889 INFO L225 Difference]: With dead ends: 130 [2021-01-06 17:22:15,890 INFO L226 Difference]: Without dead ends: 124 [2021-01-06 17:22:15,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=4, NotChecked=16, Total=110 [2021-01-06 17:22:15,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-01-06 17:22:15,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 69. [2021-01-06 17:22:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2021-01-06 17:22:15,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2021-01-06 17:22:15,903 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 43 [2021-01-06 17:22:15,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 17:22:15,903 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2021-01-06 17:22:15,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 17:22:15,903 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2021-01-06 17:22:15,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 17:22:15,904 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 17:22:15,904 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 17:22:16,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-01-06 17:22:16,106 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 17:22:16,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 17:22:16,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1074581755, now seen corresponding path program 2 times [2021-01-06 17:22:16,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 17:22:16,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068473983] [2021-01-06 17:22:16,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 17:22:16,120 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 17:22:16,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1461971411] [2021-01-06 17:22:16,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:22:16,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 17:22:16,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 17:22:16,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 46 conjunts are in the unsatisfiable core [2021-01-06 17:22:16,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 17:22:16,923 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 17:22:16,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 17:22:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 17:22:16,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068473983] [2021-01-06 17:22:16,987 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 17:22:16,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461971411] [2021-01-06 17:22:16,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 17:22:16,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2021-01-06 17:22:16,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474548227] [2021-01-06 17:22:16,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 17:22:16,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 17:22:16,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 17:22:16,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2021-01-06 17:22:16,991 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 16 states. [2021-01-06 17:22:17,572 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2021-01-06 17:22:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 17:22:18,698 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2021-01-06 17:22:18,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 17:22:18,698 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2021-01-06 17:22:18,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 17:22:18,700 INFO L225 Difference]: With dead ends: 119 [2021-01-06 17:22:18,700 INFO L226 Difference]: Without dead ends: 109 [2021-01-06 17:22:18,701 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=228, Invalid=764, Unknown=0, NotChecked=0, Total=992 [2021-01-06 17:22:18,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-01-06 17:22:18,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 78. [2021-01-06 17:22:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2021-01-06 17:22:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2021-01-06 17:22:18,715 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 44 [2021-01-06 17:22:18,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 17:22:18,716 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2021-01-06 17:22:18,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 17:22:18,716 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2021-01-06 17:22:18,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-06 17:22:18,717 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 17:22:18,717 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 17:22:18,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:22:18,932 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 17:22:18,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 17:22:18,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1128629901, now seen corresponding path program 3 times [2021-01-06 17:22:18,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 17:22:18,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656259164] [2021-01-06 17:22:18,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 17:22:18,956 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 17:22:18,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [201862293] [2021-01-06 17:22:18,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:22:19,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-06 17:22:19,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 17:22:19,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 30 conjunts are in the unsatisfiable core [2021-01-06 17:22:19,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 17:22:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 17:22:19,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656259164] [2021-01-06 17:22:19,257 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 17:22:19,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201862293] [2021-01-06 17:22:19,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 17:22:19,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2021-01-06 17:22:19,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002130470] [2021-01-06 17:22:19,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 17:22:19,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 17:22:19,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 17:22:19,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-01-06 17:22:19,259 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 10 states. [2021-01-06 17:22:23,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 17:22:23,866 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2021-01-06 17:22:23,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 17:22:23,866 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2021-01-06 17:22:23,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 17:22:23,867 INFO L225 Difference]: With dead ends: 129 [2021-01-06 17:22:23,867 INFO L226 Difference]: Without dead ends: 94 [2021-01-06 17:22:23,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-01-06 17:22:23,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-01-06 17:22:23,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2021-01-06 17:22:23,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2021-01-06 17:22:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2021-01-06 17:22:23,897 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 48 [2021-01-06 17:22:23,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 17:22:23,897 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2021-01-06 17:22:23,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 17:22:23,897 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2021-01-06 17:22:23,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-06 17:22:23,898 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 17:22:23,898 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 17:22:24,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:22:24,112 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 17:22:24,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 17:22:24,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1934789142, now seen corresponding path program 4 times [2021-01-06 17:22:24,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 17:22:24,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537835259] [2021-01-06 17:22:24,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 17:22:24,128 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 17:22:24,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1207988662] [2021-01-06 17:22:24,128 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:22:24,196 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-06 17:22:24,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 17:22:24,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 44 conjunts are in the unsatisfiable core [2021-01-06 17:22:24,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 17:22:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 17:22:24,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537835259] [2021-01-06 17:22:24,603 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 17:22:24,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207988662] [2021-01-06 17:22:24,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 17:22:24,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-01-06 17:22:24,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742955326] [2021-01-06 17:22:24,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 17:22:24,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 17:22:24,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 17:22:24,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-01-06 17:22:24,606 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 15 states. [2021-01-06 17:22:25,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 17:22:25,820 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2021-01-06 17:22:25,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 17:22:25,821 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2021-01-06 17:22:25,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 17:22:25,822 INFO L225 Difference]: With dead ends: 137 [2021-01-06 17:22:25,822 INFO L226 Difference]: Without dead ends: 133 [2021-01-06 17:22:25,823 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=192, Invalid=678, Unknown=0, NotChecked=0, Total=870 [2021-01-06 17:22:25,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-01-06 17:22:25,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 95. [2021-01-06 17:22:25,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2021-01-06 17:22:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2021-01-06 17:22:25,843 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 53 [2021-01-06 17:22:25,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 17:22:25,844 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2021-01-06 17:22:25,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 17:22:25,844 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2021-01-06 17:22:25,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-06 17:22:25,845 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 17:22:25,845 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 17:22:26,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-06 17:22:26,060 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 17:22:26,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 17:22:26,061 INFO L82 PathProgramCache]: Analyzing trace with hash -413997928, now seen corresponding path program 5 times [2021-01-06 17:22:26,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 17:22:26,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146146594] [2021-01-06 17:22:26,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 17:22:26,086 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 17:22:26,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [828459195] [2021-01-06 17:22:26,087 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:22:26,143 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-01-06 17:22:26,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 17:22:26,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 17:22:26,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 17:22:26,260 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 37 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 17:22:26,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146146594] [2021-01-06 17:22:26,260 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 17:22:26,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828459195] [2021-01-06 17:22:26,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 17:22:26,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-01-06 17:22:26,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178202139] [2021-01-06 17:22:26,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 17:22:26,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 17:22:26,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 17:22:26,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-06 17:22:26,262 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 7 states. [2021-01-06 17:22:26,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 17:22:26,445 INFO L93 Difference]: Finished difference Result 186 states and 196 transitions. [2021-01-06 17:22:26,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 17:22:26,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2021-01-06 17:22:26,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 17:22:26,447 INFO L225 Difference]: With dead ends: 186 [2021-01-06 17:22:26,447 INFO L226 Difference]: Without dead ends: 137 [2021-01-06 17:22:26,448 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-01-06 17:22:26,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-01-06 17:22:26,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2021-01-06 17:22:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2021-01-06 17:22:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2021-01-06 17:22:26,487 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 57 [2021-01-06 17:22:26,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 17:22:26,488 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2021-01-06 17:22:26,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 17:22:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2021-01-06 17:22:26,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-06 17:22:26,489 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 17:22:26,489 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 17:22:26,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-06 17:22:26,705 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 17:22:26,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 17:22:26,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1860833829, now seen corresponding path program 6 times [2021-01-06 17:22:26,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 17:22:26,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588785066] [2021-01-06 17:22:26,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 17:22:26,727 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 17:22:26,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1622245848] [2021-01-06 17:22:26,728 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:22:26,802 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-01-06 17:22:26,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 17:22:26,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 30 conjunts are in the unsatisfiable core [2021-01-06 17:22:26,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 17:22:26,968 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-01-06 17:22:26,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588785066] [2021-01-06 17:22:26,968 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 17:22:26,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622245848] [2021-01-06 17:22:26,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 17:22:26,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2021-01-06 17:22:26,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79266235] [2021-01-06 17:22:26,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 17:22:26,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 17:22:26,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 17:22:26,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-01-06 17:22:26,970 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand 8 states. [2021-01-06 17:22:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 17:22:31,185 INFO L93 Difference]: Finished difference Result 171 states and 185 transitions. [2021-01-06 17:22:31,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 17:22:31,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2021-01-06 17:22:31,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 17:22:31,187 INFO L225 Difference]: With dead ends: 171 [2021-01-06 17:22:31,187 INFO L226 Difference]: Without dead ends: 169 [2021-01-06 17:22:31,188 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-01-06 17:22:31,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-01-06 17:22:31,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 139. [2021-01-06 17:22:31,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2021-01-06 17:22:31,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 149 transitions. [2021-01-06 17:22:31,220 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 149 transitions. Word has length 62 [2021-01-06 17:22:31,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 17:22:31,220 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 149 transitions. [2021-01-06 17:22:31,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 17:22:31,220 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2021-01-06 17:22:31,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 17:22:31,221 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 17:22:31,221 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 17:22:31,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-06 17:22:31,437 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 17:22:31,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 17:22:31,438 INFO L82 PathProgramCache]: Analyzing trace with hash 300678153, now seen corresponding path program 7 times [2021-01-06 17:22:31,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 17:22:31,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965154517] [2021-01-06 17:22:31,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 17:22:31,448 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 17:22:31,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [771493946] [2021-01-06 17:22:31,449 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:22:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 17:22:31,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 57 conjunts are in the unsatisfiable core [2021-01-06 17:22:31,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 17:22:32,164 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 17:22:32,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965154517] [2021-01-06 17:22:32,165 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 17:22:32,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771493946] [2021-01-06 17:22:32,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 17:22:32,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2021-01-06 17:22:32,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123178539] [2021-01-06 17:22:32,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 17:22:32,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 17:22:32,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 17:22:32,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2021-01-06 17:22:32,167 INFO L87 Difference]: Start difference. First operand 139 states and 149 transitions. Second operand 18 states. [2021-01-06 17:22:33,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 17:22:33,861 INFO L93 Difference]: Finished difference Result 229 states and 247 transitions. [2021-01-06 17:22:33,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-06 17:22:33,861 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2021-01-06 17:22:33,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 17:22:33,862 INFO L225 Difference]: With dead ends: 229 [2021-01-06 17:22:33,862 INFO L226 Difference]: Without dead ends: 139 [2021-01-06 17:22:33,864 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=268, Invalid=922, Unknown=0, NotChecked=0, Total=1190 [2021-01-06 17:22:33,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-01-06 17:22:33,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-01-06 17:22:33,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2021-01-06 17:22:33,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 148 transitions. [2021-01-06 17:22:33,888 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 148 transitions. Word has length 66 [2021-01-06 17:22:33,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 17:22:33,888 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 148 transitions. [2021-01-06 17:22:33,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 17:22:33,889 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 148 transitions. [2021-01-06 17:22:33,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 17:22:33,889 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 17:22:33,889 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 17:22:34,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:22:34,096 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 17:22:34,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 17:22:34,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1572252437, now seen corresponding path program 1 times [2021-01-06 17:22:34,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 17:22:34,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451078277] [2021-01-06 17:22:34,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 17:22:34,106 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 17:22:34,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [932107935] [2021-01-06 17:22:34,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:22:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 17:22:34,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 17:22:34,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 17:22:34,457 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 17:22:34,471 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 17:22:34,477 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 17:22:34,488 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 17:22:34,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 17:22:34,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 17:22:34,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 17:22:34,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 17:22:34,522 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 17:22:34,529 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 17:22:34,533 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 17:22:34,568 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 17:22:34,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 17:22:34,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 17:22:34,623 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 17:22:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 5 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 17:22:34,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451078277] [2021-01-06 17:22:34,671 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 17:22:34,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932107935] [2021-01-06 17:22:34,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 17:22:34,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-01-06 17:22:34,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626052603] [2021-01-06 17:22:34,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 17:22:34,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 17:22:34,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 17:22:34,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-01-06 17:22:34,673 INFO L87 Difference]: Start difference. First operand 139 states and 148 transitions. Second operand 11 states. [2021-01-06 17:22:36,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 17:22:36,616 INFO L93 Difference]: Finished difference Result 332 states and 353 transitions. [2021-01-06 17:22:36,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-01-06 17:22:36,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2021-01-06 17:22:36,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 17:22:36,620 INFO L225 Difference]: With dead ends: 332 [2021-01-06 17:22:36,620 INFO L226 Difference]: Without dead ends: 323 [2021-01-06 17:22:36,621 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=335, Invalid=855, Unknown=0, NotChecked=0, Total=1190 [2021-01-06 17:22:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-01-06 17:22:36,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 243. [2021-01-06 17:22:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2021-01-06 17:22:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 265 transitions. [2021-01-06 17:22:36,674 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 265 transitions. Word has length 69 [2021-01-06 17:22:36,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 17:22:36,675 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 265 transitions. [2021-01-06 17:22:36,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 17:22:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 265 transitions. [2021-01-06 17:22:36,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 17:22:36,676 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 17:22:36,676 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 17:22:36,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-06 17:22:36,890 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 17:22:36,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 17:22:36,891 INFO L82 PathProgramCache]: Analyzing trace with hash 822588344, now seen corresponding path program 8 times [2021-01-06 17:22:36,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 17:22:36,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510731100] [2021-01-06 17:22:36,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 17:22:36,900 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 17:22:36,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [946359799] [2021-01-06 17:22:36,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 17:22:36,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 17:22:36,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 17:22:36,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 55 conjunts are in the unsatisfiable core [2021-01-06 17:22:36,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 17:22:37,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 17:22:37,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 17:22:37,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 17:22:37,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 17:22:37,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 17:22:37,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 17:22:37,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 17:22:37,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 17:22:37,768 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 17:22:37,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 17:22:37,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 17:22:37,773 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 17:22:37,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 17:22:37,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 17:22:37,780 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 17:22:37,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 17:22:37,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 17:22:37,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 17:22:37,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 17:22:37,793 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 17:22:37,794 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 17:22:37,796 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 17:22:37,870 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 17:22:37,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510731100] [2021-01-06 17:22:37,870 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 17:22:37,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946359799] [2021-01-06 17:22:37,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 17:22:37,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2021-01-06 17:22:37,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506442125] [2021-01-06 17:22:37,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 17:22:37,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 17:22:37,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 17:22:37,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-01-06 17:22:37,873 INFO L87 Difference]: Start difference. First operand 243 states and 265 transitions. Second operand 19 states. [2021-01-06 17:22:39,686 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2021-01-06 17:22:39,827 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2021-01-06 17:22:40,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 17:22:40,113 INFO L93 Difference]: Finished difference Result 249 states and 272 transitions. [2021-01-06 17:22:40,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-01-06 17:22:40,113 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2021-01-06 17:22:40,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 17:22:40,114 INFO L225 Difference]: With dead ends: 249 [2021-01-06 17:22:40,114 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 17:22:40,115 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=313, Invalid=1247, Unknown=0, NotChecked=0, Total=1560 [2021-01-06 17:22:40,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 17:22:40,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 17:22:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 17:22:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 17:22:40,116 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2021-01-06 17:22:40,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 17:22:40,116 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 17:22:40,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 17:22:40,116 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 17:22:40,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 17:22:40,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-06 17:22:40,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 17:22:40,444 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 128 [2021-01-06 17:22:40,560 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 130 [2021-01-06 17:22:40,682 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 146 [2021-01-06 17:22:40,969 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 163 [2021-01-06 17:22:41,125 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 140 [2021-01-06 17:22:42,286 WARN L197 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 106 [2021-01-06 17:22:43,691 WARN L197 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 129 DAG size of output: 93 [2021-01-06 17:22:45,065 WARN L197 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 146 DAG size of output: 93 [2021-01-06 17:22:45,751 WARN L197 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 101 [2021-01-06 17:22:48,186 WARN L197 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 156 DAG size of output: 104 [2021-01-06 17:22:49,286 WARN L197 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 140 DAG size of output: 78 [2021-01-06 17:22:50,830 WARN L197 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 136 DAG size of output: 104 [2021-01-06 17:22:52,284 WARN L197 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 146 DAG size of output: 103 [2021-01-06 17:22:52,289 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-01-06 17:22:52,289 INFO L189 CegarLoopUtils]: For program point L11(lines 11 13) no Hoare annotation was computed. [2021-01-06 17:22:52,289 INFO L189 CegarLoopUtils]: For program point L11-1(lines 11 13) no Hoare annotation was computed. [2021-01-06 17:22:52,289 INFO L189 CegarLoopUtils]: For program point L11-2(lines 11 13) no Hoare annotation was computed. [2021-01-06 17:22:52,289 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-01-06 17:22:52,289 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 17:22:52,289 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 17:22:52,289 INFO L189 CegarLoopUtils]: For program point L12(line 12) no Hoare annotation was computed. [2021-01-06 17:22:52,289 INFO L189 CegarLoopUtils]: For program point L12-2(line 12) no Hoare annotation was computed. [2021-01-06 17:22:52,289 INFO L189 CegarLoopUtils]: For program point L12-4(line 12) no Hoare annotation was computed. [2021-01-06 17:22:52,290 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-01-06 17:22:52,290 INFO L185 CegarLoopUtils]: At program point L38-2(lines 38 62) the Hoare annotation is: (let ((.cse8 (* 2 ULTIMATE.start_main_~r~0)) (.cse4 (<= 1 ULTIMATE.start_main_~y~0)) (.cse5 (<= ULTIMATE.start_main_~y~0 10)) (.cse6 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse7 (<= 0 ULTIMATE.start_main_~x~0)) (.cse9 (<= ULTIMATE.start_main_~x~0 10)) (.cse10 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse11 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0))) (.cse2 (* ULTIMATE.start_main_~b~0 (- 1)))) (let ((.cse1 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse12 (<= (div .cse2 (- 2)) ULTIMATE.start_main_~y~0)) (.cse0 (let ((.cse13 (* ULTIMATE.start_main_~y~0 2))) (or (and (= ULTIMATE.start_main_~q~0 2) .cse6 (or (and .cse9 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (and .cse9 (= ULTIMATE.start_main_~a~0 4)) (and (= ULTIMATE.start_main_~b~0 .cse13) .cse9)) (< .cse8 ULTIMATE.start_main_~x~0) .cse10 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse13)) .cse11 (<= (* 2 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0)) (and .cse4 .cse5 (= 0 (mod ULTIMATE.start_main_~q~0 (- 2))) .cse6 .cse7 (< ULTIMATE.start_main_~r~0 (* 4 ULTIMATE.start_main_~y~0)) .cse9 (<= 0 ULTIMATE.start_main_~r~0) .cse10 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~y~0 4))) .cse11 (= .cse13 (* (div (* ULTIMATE.start_main_~q~0 (- 1)) (- 2)) ULTIMATE.start_main_~y~0))) (and .cse4 (= ULTIMATE.start_main_~q~0 8) .cse5 .cse6 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~y~0 8))) .cse7 (<= (* 8 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0) .cse9 .cse10 .cse11))))) (or (and .cse0 (= ULTIMATE.start_main_~q~0 4)) (and (<= ULTIMATE.start_main_~y~0 (div (div (div (+ .cse1 ULTIMATE.start_main_~x~0) 2) 2) 2)) (<= (div (div (div .cse2 2) 2) (- 2)) ULTIMATE.start_main_~y~0) .cse0) (let ((.cse3 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse3)) .cse4 .cse5 (<= .cse3 ULTIMATE.start_main_~x~0) .cse6 .cse7 (< (+ .cse8 .cse3) (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)) .cse9 .cse10 .cse11)) (and .cse4 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~y~0 6))) .cse5 (= ULTIMATE.start_main_~q~0 6) (<= (* 6 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0) .cse6 .cse12 .cse7 (< (div (+ .cse1 (- 1)) (- 2)) (+ ULTIMATE.start_main_~y~0 1)) .cse9 .cse10 .cse11) (and .cse4 .cse5 .cse7 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0) .cse9 .cse10 .cse11 (= ULTIMATE.start_main_~b~0 0)) (and .cse12 .cse0)))) [2021-01-06 17:22:52,290 INFO L189 CegarLoopUtils]: For program point L38-3(lines 38 62) no Hoare annotation was computed. [2021-01-06 17:22:52,290 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-01-06 17:22:52,291 INFO L185 CegarLoopUtils]: At program point L47-2(lines 47 59) the Hoare annotation is: (let ((.cse11 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0))) (.cse4 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (.cse21 (= ULTIMATE.start_main_~b~0 (* (* (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2)) ULTIMATE.start_main_~y~0) 2))) (.cse7 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse6 (<= 1 ULTIMATE.start_main_~y~0)) (.cse22 (<= ULTIMATE.start_main_~y~0 10)) (.cse23 (<= 0 ULTIMATE.start_main_~x~0)) (.cse8 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (.cse9 (= ULTIMATE.start_main_~q~0 0)) (.cse10 (<= ULTIMATE.start_main_~x~0 10)) (.cse24 (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)) (.cse20 (* 2 ULTIMATE.start_main_~y~0)) (.cse19 (* ULTIMATE.start_main_~y~0 2))) (let ((.cse14 (let ((.cse25 (= ULTIMATE.start_main_~q~0 2)) (.cse26 (< (* 2 ULTIMATE.start_main_~r~0) ULTIMATE.start_main_~x~0)) (.cse27 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse19))) (.cse28 (<= .cse20 ULTIMATE.start_main_~x~0))) (or (and .cse25 .cse7 .cse26 .cse10 .cse27 .cse11 .cse4 .cse28) (and .cse21 .cse7 (or (and .cse25 .cse26 .cse10 .cse27 .cse28) (and .cse6 .cse22 .cse23 .cse8 .cse9 .cse10)) .cse24)))) (.cse13 (* 4 ULTIMATE.start_main_~y~0)) (.cse2 (or (and .cse6 .cse21 .cse22 .cse7 .cse23 .cse10 .cse24) (and .cse6 .cse22 .cse7 .cse23 .cse10 .cse11 .cse4))) (.cse3 (= ULTIMATE.start_assume_abort_if_not_~cond 1))) (let ((.cse17 (and (= 0 (mod ULTIMATE.start_main_~q~0 (- 2))) (< ULTIMATE.start_main_~r~0 .cse13) .cse2 (<= 0 ULTIMATE.start_main_~r~0) .cse3 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~y~0 4))) (= .cse19 (* (div (* ULTIMATE.start_main_~q~0 (- 1)) (- 2)) ULTIMATE.start_main_~y~0)))) (.cse18 (and .cse3 .cse14))) (let ((.cse15 (div (div ULTIMATE.start_main_~b~0 2) 2)) (.cse16 (div (* ULTIMATE.start_main_~b~0 (- 1)) 2)) (.cse12 (or .cse17 .cse18)) (.cse5 (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~r~0)) (.cse0 (= ULTIMATE.start_main_~q~0 8)) (.cse1 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~y~0 8))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5) (and .cse4 .cse5 .cse12) (and (<= .cse13 ULTIMATE.start_main_~r~0) .cse3 .cse14 (<= ULTIMATE.start_main_~y~0 .cse15) (<= (div .cse16 (- 2)) ULTIMATE.start_main_~y~0)) (and (<= ULTIMATE.start_main_~y~0 (div .cse15 2)) (<= (div (div .cse16 2) (- 2)) ULTIMATE.start_main_~y~0) (<= (* 8 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) .cse12) (and (< ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) .cse2 .cse3 .cse4 .cse5) (and (or .cse17 (and .cse0 .cse1 .cse2 .cse3) .cse18) (= ULTIMATE.start_main_~b~0 .cse19) (<= .cse20 ULTIMATE.start_main_~r~0))))))) [2021-01-06 17:22:52,291 INFO L189 CegarLoopUtils]: For program point L47-3(lines 47 59) no Hoare annotation was computed. [2021-01-06 17:22:52,291 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-01-06 17:22:52,291 INFO L189 CegarLoopUtils]: For program point L15(lines 15 18) no Hoare annotation was computed. [2021-01-06 17:22:52,292 INFO L185 CegarLoopUtils]: At program point L15-2(lines 14 20) the Hoare annotation is: (let ((.cse13 (* 2 ULTIMATE.start_main_~r~0))) (let ((.cse4 (<= 1 ULTIMATE.start_main_~y~0)) (.cse5 (<= ULTIMATE.start_main_~y~0 10)) (.cse6 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse11 (< .cse13 ULTIMATE.start_main_~x~0)) (.cse7 (<= 0 ULTIMATE.start_main_~x~0)) (.cse8 (<= ULTIMATE.start_main_~x~0 10)) (.cse9 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse10 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0))) (.cse1 (* ULTIMATE.start_main_~b~0 (- 1)))) (let ((.cse3 (<= (div .cse1 (- 2)) ULTIMATE.start_main_~y~0)) (.cse0 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse2 (let ((.cse14 (* ULTIMATE.start_main_~y~0 2))) (or (and .cse4 .cse5 (= 0 (mod ULTIMATE.start_main_~q~0 (- 2))) .cse6 .cse7 (< ULTIMATE.start_main_~r~0 (* 4 ULTIMATE.start_main_~y~0)) .cse8 .cse9 (<= 0 ULTIMATE.start_main_~r~0) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~y~0 4))) .cse10 (= .cse14 (* (div (* ULTIMATE.start_main_~q~0 (- 1)) (- 2)) ULTIMATE.start_main_~y~0))) (and .cse4 (= ULTIMATE.start_main_~q~0 8) .cse5 .cse6 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~y~0 8))) .cse7 (<= (* 8 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0) .cse8 .cse9 .cse10) (and .cse4 .cse5 (= ULTIMATE.start_main_~q~0 2) .cse6 .cse11 .cse7 .cse8 .cse9 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse14)) .cse10 (<= (* 2 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0)))))) (or (and (<= ULTIMATE.start_main_~y~0 (div (div (div (+ .cse0 ULTIMATE.start_main_~x~0) 2) 2) 2)) (<= (div (div (div .cse1 2) 2) (- 2)) ULTIMATE.start_main_~y~0) .cse2) (and .cse3 .cse2) (and .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0) .cse8 .cse9 .cse10) (and .cse4 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~y~0 6))) .cse5 (= ULTIMATE.start_main_~q~0 6) (<= (* 6 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0) .cse6 .cse3 .cse7 (< (div (+ .cse0 (- 1)) (- 2)) (+ ULTIMATE.start_main_~y~0 1)) .cse8 .cse9 .cse10) (and (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0) .cse11 .cse8 .cse9) (let ((.cse12 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse12)) .cse4 .cse5 (<= .cse12 ULTIMATE.start_main_~x~0) .cse6 .cse7 (< (+ .cse13 .cse12) (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)) .cse8 .cse9 .cse10)) (and .cse2 (= ULTIMATE.start_main_~q~0 4)))))) [2021-01-06 17:22:52,292 INFO L189 CegarLoopUtils]: For program point L15-3(lines 15 18) no Hoare annotation was computed. [2021-01-06 17:22:52,292 INFO L185 CegarLoopUtils]: At program point L15-5(lines 42 43) the Hoare annotation is: (let ((.cse15 (* 2 ULTIMATE.start_main_~r~0))) (let ((.cse2 (* ULTIMATE.start_main_~b~0 (- 1))) (.cse13 (< .cse15 ULTIMATE.start_main_~x~0)) (.cse4 (<= 1 ULTIMATE.start_main_~y~0)) (.cse5 (<= ULTIMATE.start_main_~y~0 10)) (.cse6 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse8 (<= 0 ULTIMATE.start_main_~x~0)) (.cse10 (<= ULTIMATE.start_main_~x~0 10)) (.cse11 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse12 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0))) (.cse1 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse14 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (let ((.cse3 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse14))) (.cse9 (< (div (+ .cse1 (- 1)) (- 2)) (+ ULTIMATE.start_main_~y~0 1))) (.cse0 (or (and (let ((.cse16 (* ULTIMATE.start_main_~y~0 2))) (or (and .cse4 .cse5 (= ULTIMATE.start_main_~q~0 2) .cse13 .cse8 .cse10 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse16)) .cse12 (<= (* 2 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0)) (and .cse4 .cse5 (= 0 (mod ULTIMATE.start_main_~q~0 (- 2))) .cse8 (< ULTIMATE.start_main_~r~0 (* 4 ULTIMATE.start_main_~y~0)) .cse10 (<= 0 ULTIMATE.start_main_~r~0) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~y~0 4))) .cse12 (= .cse16 (* (div (* ULTIMATE.start_main_~q~0 (- 1)) (- 2)) ULTIMATE.start_main_~y~0))))) .cse6 .cse11) (and .cse4 (= ULTIMATE.start_main_~q~0 8) .cse5 .cse6 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~y~0 8))) .cse8 (<= (* 8 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0) .cse10 .cse11 .cse12))) (.cse7 (<= (div .cse2 (- 2)) ULTIMATE.start_main_~y~0))) (or (and .cse0 (<= ULTIMATE.start_main_~y~0 (div (div (div (+ .cse1 ULTIMATE.start_main_~x~0) 2) 2) 2)) (<= (div (div (div .cse2 2) 2) (- 2)) ULTIMATE.start_main_~y~0)) (and (< ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~b~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse4 .cse5 .cse6 .cse8 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0) .cse10 .cse11 .cse12) (and (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) .cse6 (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0) .cse13 .cse10 .cse11) (and .cse3 .cse4 .cse5 (<= .cse14 ULTIMATE.start_main_~x~0) .cse6 .cse8 (< (+ .cse15 .cse14) (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)) .cse10 .cse11 .cse12) (and .cse4 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~y~0 6))) .cse5 (= ULTIMATE.start_main_~q~0 6) (<= (* 6 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (= ULTIMATE.start_main_~q~0 4)) (and .cse0 .cse7))))) [2021-01-06 17:22:52,292 INFO L189 CegarLoopUtils]: For program point L15-6(lines 15 18) no Hoare annotation was computed. [2021-01-06 17:22:52,293 INFO L185 CegarLoopUtils]: At program point L15-8(lines 14 20) the Hoare annotation is: (let ((.cse13 (* ULTIMATE.start_main_~y~0 2)) (.cse14 (* 2 ULTIMATE.start_main_~y~0)) (.cse0 (<= ULTIMATE.start_main_~y~0 10)) (.cse2 (<= 0 ULTIMATE.start_main_~x~0)) (.cse3 (<= ULTIMATE.start_main_~x~0 10))) (let ((.cse15 (* 4 ULTIMATE.start_main_~y~0)) (.cse8 (<= 1 ULTIMATE.start_main_~y~0)) (.cse16 (or (and (= ULTIMATE.start_main_~q~0 2) (< (* 2 ULTIMATE.start_main_~r~0) ULTIMATE.start_main_~x~0) .cse3 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse13)) (<= .cse14 ULTIMATE.start_main_~x~0)) (and .cse0 .cse2 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0) .cse3))) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse4 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse6 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0)))) (let ((.cse11 (and .cse8 .cse16 .cse1 .cse4 .cse6)) (.cse12 (and (= 0 (mod ULTIMATE.start_main_~q~0 (- 2))) .cse1 (< ULTIMATE.start_main_~r~0 .cse15) (<= 0 ULTIMATE.start_main_~r~0) .cse3 .cse4 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~y~0 4))) .cse6 (= .cse13 (* (div (* ULTIMATE.start_main_~q~0 (- 1)) (- 2)) ULTIMATE.start_main_~y~0))))) (let ((.cse9 (= ULTIMATE.start_main_~q~0 8)) (.cse10 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~y~0 8)))) (.cse5 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (.cse7 (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~r~0)) (.cse19 (or .cse11 .cse12)) (.cse17 (div (div ULTIMATE.start_main_~b~0 2) 2)) (.cse18 (div (* ULTIMATE.start_main_~b~0 (- 1)) 2))) (or (and (< ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse1 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7) (and (or (and .cse9 .cse1 .cse10 .cse3 .cse4 (< ULTIMATE.start_main_~x~0 (* 16 ULTIMATE.start_main_~y~0)) .cse6) .cse11 .cse12) (= ULTIMATE.start_main_~b~0 .cse13) (<= .cse14 ULTIMATE.start_main_~r~0)) (and .cse8 (<= .cse15 ULTIMATE.start_main_~r~0) .cse16 .cse1 .cse4 .cse6 (<= ULTIMATE.start_main_~y~0 .cse17) (<= (div .cse18 (- 2)) ULTIMATE.start_main_~y~0)) (and .cse19 .cse5 .cse7) (and .cse19 (<= ULTIMATE.start_main_~y~0 (div .cse17 2)) (<= (div (div .cse18 2) (- 2)) ULTIMATE.start_main_~y~0) (<= (* 8 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0))))))) [2021-01-06 17:22:52,293 INFO L189 CegarLoopUtils]: For program point L15-9(lines 15 18) no Hoare annotation was computed. [2021-01-06 17:22:52,293 INFO L185 CegarLoopUtils]: At program point L15-11(lines 14 20) the Hoare annotation is: (let ((.cse24 (* ULTIMATE.start_main_~y~0 2)) (.cse23 (* 2 ULTIMATE.start_main_~y~0)) (.cse0 (<= ULTIMATE.start_main_~y~0 10)) (.cse2 (<= 0 ULTIMATE.start_main_~x~0)) (.cse15 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (.cse16 (= ULTIMATE.start_main_~q~0 0)) (.cse3 (<= ULTIMATE.start_main_~x~0 10))) (let ((.cse8 (<= 1 ULTIMATE.start_main_~y~0)) (.cse18 (or (and (= ULTIMATE.start_main_~q~0 2) (< (* 2 ULTIMATE.start_main_~r~0) ULTIMATE.start_main_~x~0) .cse3 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse24)) (<= .cse23 ULTIMATE.start_main_~x~0)) (and .cse0 .cse2 .cse15 .cse16 .cse3))) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse17 (* 4 ULTIMATE.start_main_~y~0)) (.cse6 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0)))) (let ((.cse9 (= ULTIMATE.start_main_~q~0 8)) (.cse10 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~y~0 8)))) (.cse21 (and (= 0 (mod ULTIMATE.start_main_~q~0 (- 2))) .cse1 (< ULTIMATE.start_main_~r~0 .cse17) (<= 0 ULTIMATE.start_main_~r~0) .cse3 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~y~0 4))) .cse6 (= .cse24 (* (div (* ULTIMATE.start_main_~q~0 (- 1)) (- 2)) ULTIMATE.start_main_~y~0)))) (.cse22 (and .cse8 .cse18 .cse6))) (let ((.cse5 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (.cse7 (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~r~0)) (.cse12 (or (and .cse9 .cse1 .cse10 .cse3 (< ULTIMATE.start_main_~x~0 (* 16 ULTIMATE.start_main_~y~0)) .cse6) .cse21 .cse22)) (.cse13 (= ULTIMATE.start_main_~b~0 .cse24)) (.cse14 (<= .cse23 ULTIMATE.start_main_~r~0)) (.cse11 (or .cse21 .cse22)) (.cse19 (div (div ULTIMATE.start_main_~b~0 2) 2)) (.cse20 (div (* ULTIMATE.start_main_~b~0 (- 1)) 2)) (.cse4 (= ULTIMATE.start_assume_abort_if_not_~cond 1))) (or (and (< ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse1 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse11 .cse1 .cse4 .cse5 .cse7) (and .cse12 (<= ULTIMATE.start_main_~y~0 (div (div (div (+ (* ULTIMATE.start_main_~r~0 (- 1)) ULTIMATE.start_main_~x~0) 2) 2) 2)) .cse13 .cse14 .cse4) (and .cse8 .cse1 (= ULTIMATE.start_main_~a~0 2) .cse15 .cse16 .cse14 .cse3 .cse4 .cse6) (and .cse8 (<= .cse17 ULTIMATE.start_main_~r~0) .cse18 .cse1 .cse4 .cse6 (<= ULTIMATE.start_main_~y~0 .cse19) (<= (div .cse20 (- 2)) ULTIMATE.start_main_~y~0)) (and .cse12 .cse13 .cse14 .cse4 (= ULTIMATE.start_main_~q~0 4)) (and .cse11 .cse1 (<= ULTIMATE.start_main_~y~0 (div .cse19 2)) (<= (div (div .cse20 2) (- 2)) ULTIMATE.start_main_~y~0) .cse4 (<= (* 8 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0))))))) [2021-01-06 17:22:52,293 INFO L189 CegarLoopUtils]: For program point L15-12(lines 15 18) no Hoare annotation was computed. [2021-01-06 17:22:52,293 INFO L185 CegarLoopUtils]: At program point L15-14(lines 52 53) the Hoare annotation is: (let ((.cse18 (* ULTIMATE.start_main_~y~0 2)) (.cse19 (* 2 ULTIMATE.start_main_~y~0)) (.cse0 (<= ULTIMATE.start_main_~y~0 10)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (<= 0 ULTIMATE.start_main_~x~0)) (.cse3 (<= ULTIMATE.start_main_~x~0 10))) (let ((.cse9 (* 4 ULTIMATE.start_main_~y~0)) (.cse4 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse8 (<= 1 ULTIMATE.start_main_~y~0)) (.cse10 (or (and (= ULTIMATE.start_main_~q~0 2) .cse1 (< (* 2 ULTIMATE.start_main_~r~0) ULTIMATE.start_main_~x~0) .cse3 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse18)) (<= .cse19 ULTIMATE.start_main_~x~0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0) .cse3))) (.cse6 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0)))) (let ((.cse16 (and .cse8 .cse10 .cse6)) (.cse17 (and (= 0 (mod ULTIMATE.start_main_~q~0 (- 2))) .cse1 (< ULTIMATE.start_main_~r~0 .cse9) (<= 0 ULTIMATE.start_main_~r~0) .cse3 .cse4 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~y~0 4))) .cse6 (= .cse18 (* (div (* ULTIMATE.start_main_~q~0 (- 1)) (- 2)) ULTIMATE.start_main_~y~0))))) (let ((.cse11 (div (div ULTIMATE.start_main_~b~0 2) 2)) (.cse12 (div (* ULTIMATE.start_main_~b~0 (- 1)) 2)) (.cse13 (= ULTIMATE.start_main_~q~0 8)) (.cse14 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~y~0 8)))) (.cse15 (or .cse16 .cse17)) (.cse5 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (.cse7 (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~r~0))) (or (and (< ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 (<= .cse9 ULTIMATE.start_main_~r~0) .cse10 .cse4 .cse6 (<= ULTIMATE.start_main_~y~0 .cse11) (<= (div .cse12 (- 2)) ULTIMATE.start_main_~y~0)) (and .cse8 .cse13 .cse1 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse15 (<= ULTIMATE.start_main_~y~0 (div .cse11 2)) (<= (div (div .cse12 2) (- 2)) ULTIMATE.start_main_~y~0) .cse4 (<= (* 8 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0)) (and (or (and .cse13 .cse1 .cse14 .cse3 (< ULTIMATE.start_main_~x~0 (* 16 ULTIMATE.start_main_~y~0)) .cse6) .cse16 .cse17) (= ULTIMATE.start_main_~b~0 .cse18) (<= .cse19 ULTIMATE.start_main_~r~0) .cse4) (and .cse15 .cse4 .cse5 .cse7)))))) [2021-01-06 17:22:52,294 INFO L192 CegarLoopUtils]: At program point L65(lines 22 66) the Hoare annotation is: true [2021-01-06 17:22:52,294 INFO L189 CegarLoopUtils]: For program point L15-15(lines 15 18) no Hoare annotation was computed. [2021-01-06 17:22:52,294 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 17:22:52,294 INFO L185 CegarLoopUtils]: At program point L15-17(lines 14 20) the Hoare annotation is: (let ((.cse8 (<= 1 ULTIMATE.start_main_~y~0)) (.cse9 (<= ULTIMATE.start_main_~y~0 10)) (.cse10 (<= 0 ULTIMATE.start_main_~x~0)) (.cse11 (* ULTIMATE.start_main_~y~0 2))) (let ((.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (or (and .cse8 .cse9 .cse10 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0)) (and .cse8 .cse9 (= ULTIMATE.start_main_~q~0 2) (< (* 2 ULTIMATE.start_main_~r~0) ULTIMATE.start_main_~x~0) .cse10 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse11)) (<= (* 2 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0)))) (.cse5 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0)))) (let ((.cse0 (<= (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~r~0)) (.cse6 (and .cse1 .cse2 .cse5)) (.cse7 (and .cse8 (= 0 (mod ULTIMATE.start_main_~q~0 (- 2))) .cse9 .cse10 (< ULTIMATE.start_main_~r~0 (* 4 ULTIMATE.start_main_~y~0)) (<= 0 ULTIMATE.start_main_~r~0) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~y~0 4))) .cse5 (= .cse11 (* (div (* ULTIMATE.start_main_~q~0 (- 1)) (- 2)) ULTIMATE.start_main_~y~0)))) (.cse3 (<= ULTIMATE.start_main_~x~0 10)) (.cse4 (= ULTIMATE.start_assume_abort_if_not_~cond 1))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~a~0 2) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (or .cse6 .cse7 (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) .cse8 .cse9 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~y~0 8))) .cse10 .cse5)) .cse3 .cse4 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (and .cse0 (or .cse6 .cse7) .cse3 .cse4 (<= ULTIMATE.start_main_~y~0 (div (div ULTIMATE.start_main_~b~0 2) 2)) (<= (div (div (* ULTIMATE.start_main_~b~0 (- 1)) 2) (- 2)) ULTIMATE.start_main_~y~0)))))) [2021-01-06 17:22:52,294 INFO L189 CegarLoopUtils]: For program point L15-18(lines 15 18) no Hoare annotation was computed. [2021-01-06 17:22:52,294 INFO L192 CegarLoopUtils]: At program point L15-20(lines 14 20) the Hoare annotation is: true [2021-01-06 17:22:52,294 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-01-06 17:22:52,294 INFO L189 CegarLoopUtils]: For program point L16(lines 16 17) no Hoare annotation was computed. [2021-01-06 17:22:52,294 INFO L189 CegarLoopUtils]: For program point L16-1(lines 16 17) no Hoare annotation was computed. [2021-01-06 17:22:52,295 INFO L189 CegarLoopUtils]: For program point L16-2(lines 16 17) no Hoare annotation was computed. [2021-01-06 17:22:52,295 INFO L189 CegarLoopUtils]: For program point L16-3(lines 16 17) no Hoare annotation was computed. [2021-01-06 17:22:52,295 INFO L189 CegarLoopUtils]: For program point L16-4(lines 16 17) no Hoare annotation was computed. [2021-01-06 17:22:52,295 INFO L189 CegarLoopUtils]: For program point L16-5(lines 16 17) no Hoare annotation was computed. [2021-01-06 17:22:52,295 INFO L189 CegarLoopUtils]: For program point L16-6(lines 16 17) no Hoare annotation was computed. [2021-01-06 17:22:52,295 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 17:22:52,295 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-01-06 17:22:52,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 05:22:52 BoogieIcfgContainer [2021-01-06 17:22:52,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 17:22:52,372 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 17:22:52,373 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 17:22:52,373 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 17:22:52,373 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 05:21:50" (3/4) ... [2021-01-06 17:22:52,377 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 17:22:52,390 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2021-01-06 17:22:52,391 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 17:22:52,391 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 17:22:52,391 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 17:22:52,455 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/nla-digbench-scaling/cohendiv-ll_valuebound10.c-witness.graphml [2021-01-06 17:22:52,455 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 17:22:52,456 INFO L168 Benchmark]: Toolchain (without parser) took 62635.39 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 125.6 MB in the beginning and 64.8 MB in the end (delta: 60.9 MB). Peak memory consumption was 92.9 MB. Max. memory is 8.0 GB. [2021-01-06 17:22:52,457 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 151.0 MB. Free memory is still 122.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 17:22:52,457 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.30 ms. Allocated memory is still 151.0 MB. Free memory was 125.4 MB in the beginning and 115.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-01-06 17:22:52,457 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.04 ms. Allocated memory is still 151.0 MB. Free memory was 115.3 MB in the beginning and 113.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 17:22:52,458 INFO L168 Benchmark]: Boogie Preprocessor took 54.12 ms. Allocated memory is still 151.0 MB. Free memory was 113.7 MB in the beginning and 112.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-06 17:22:52,458 INFO L168 Benchmark]: RCFGBuilder took 680.88 ms. Allocated memory is still 151.0 MB. Free memory was 112.5 MB in the beginning and 95.5 MB in the end (delta: 17.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2021-01-06 17:22:52,459 INFO L168 Benchmark]: TraceAbstraction took 61472.55 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 95.0 MB in the beginning and 71.0 MB in the end (delta: 24.0 MB). Peak memory consumption was 71.0 MB. Max. memory is 8.0 GB. [2021-01-06 17:22:52,459 INFO L168 Benchmark]: Witness Printer took 82.75 ms. Allocated memory is still 181.4 MB. Free memory was 71.0 MB in the beginning and 64.8 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2021-01-06 17:22:52,461 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.19 ms. Allocated memory is still 151.0 MB. Free memory is still 122.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 271.30 ms. Allocated memory is still 151.0 MB. Free memory was 125.4 MB in the beginning and 115.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 60.04 ms. Allocated memory is still 151.0 MB. Free memory was 115.3 MB in the beginning and 113.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 54.12 ms. Allocated memory is still 151.0 MB. Free memory was 113.7 MB in the beginning and 112.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 680.88 ms. Allocated memory is still 151.0 MB. Free memory was 112.5 MB in the beginning and 95.5 MB in the end (delta: 17.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 61472.55 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 95.0 MB in the beginning and 71.0 MB in the end (delta: 24.0 MB). Peak memory consumption was 71.0 MB. Max. memory is 8.0 GB. * Witness Printer took 82.75 ms. Allocated memory is still 181.4 MB. Free memory was 71.0 MB in the beginning and 64.8 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: ((((((((((((((((((((1 <= y && y <= 10) && q == 2) && 2 * r < x) && 0 <= x) && x <= 10) && x == r + y * 2) && b == a * y) && 2 * y <= x) || (((((((((1 <= y && y <= 10) && 0 == q % -2) && 0 <= x) && r < 4 * y) && x <= 10) && 0 <= r) && x == r + y * 4) && b == a * y) && y * 2 == q * -1 / -2 * y)) && 1 == cond) && cond == 1) || (((((((((1 <= y && q == 8) && y <= 10) && 1 == cond) && x == r + y * 8) && 0 <= x) && 8 * y <= x) && x <= 10) && cond == 1) && b == a * y)) && y <= (r * -1 + x) / 2 / 2 / 2) && b * -1 / 2 / 2 / -2 <= y) || ((((((((((r < 2 * b && x == r + q * y) && 1 <= y) && y <= 10) && 1 == cond) && b * -1 / -2 <= y) && 0 <= x) && (r * -1 + -1) / -2 < y + 1) && x <= 10) && cond == 1) && b == a * y)) || ((((((((1 <= y && y <= 10) && 1 == cond) && 0 <= x) && r == x) && q == 0) && x <= 10) && cond == 1) && b == a * y)) || ((((((q == 1 && x == r + y) && 1 == cond) && y <= x) && 2 * r < x) && x <= 10) && cond == 1)) || (((((((((x == r + q * y && 1 <= y) && y <= 10) && q * y <= x) && 1 == cond) && 0 <= x) && 2 * r + q * y < y + x) && x <= 10) && cond == 1) && b == a * y)) || (((((((((((1 <= y && x == r + y * 6) && y <= 10) && q == 6) && 6 * y <= x) && 1 == cond) && b * -1 / -2 <= y) && 0 <= x) && (r * -1 + -1) / -2 < y + 1) && x <= 10) && cond == 1) && b == a * y)) || (((((((((((((1 <= y && y <= 10) && q == 2) && 2 * r < x) && 0 <= x) && x <= 10) && x == r + y * 2) && b == a * y) && 2 * y <= x) || (((((((((1 <= y && y <= 10) && 0 == q % -2) && 0 <= x) && r < 4 * y) && x <= 10) && 0 <= r) && x == r + y * 4) && b == a * y) && y * 2 == q * -1 / -2 * y)) && 1 == cond) && cond == 1) || (((((((((1 <= y && q == 8) && y <= 10) && 1 == cond) && x == r + y * 8) && 0 <= x) && 8 * y <= x) && x <= 10) && cond == 1) && b == a * y)) && q == 4)) || (((((((((((((1 <= y && y <= 10) && q == 2) && 2 * r < x) && 0 <= x) && x <= 10) && x == r + y * 2) && b == a * y) && 2 * y <= x) || (((((((((1 <= y && y <= 10) && 0 == q % -2) && 0 <= x) && r < 4 * y) && x <= 10) && 0 <= r) && x == r + y * 4) && b == a * y) && y * 2 == q * -1 / -2 * y)) && 1 == cond) && cond == 1) || (((((((((1 <= y && q == 8) && y <= 10) && 1 == cond) && x == r + y * 8) && 0 <= x) && 8 * y <= x) && x <= 10) && cond == 1) && b == a * y)) && b * -1 / -2 <= y) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (((((((((((((r < 2 * b && x == r + q * y) && y <= 10) && 1 == cond) && 0 <= x) && x <= 10) && cond == 1) && b == y) && b == a * y) && y <= r) || ((((((1 <= y && 4 * y <= r) && ((((((q == 2 && 1 == cond) && 2 * r < x) && x <= 10) && x == r + y * 2) && 2 * y <= x) || (((((y <= 10 && 1 == cond) && 0 <= x) && r == x) && q == 0) && x <= 10))) && cond == 1) && b == a * y) && y <= b / 2 / 2) && b * -1 / 2 / -2 <= y)) || ((((((((1 <= y && q == 8) && 1 == cond) && x == r + y * 8) && x <= 10) && cond == 1) && b == y) && b == a * y) && y <= r)) || (((((((1 <= y && ((((((q == 2 && 1 == cond) && 2 * r < x) && x <= 10) && x == r + y * 2) && 2 * y <= x) || (((((y <= 10 && 1 == cond) && 0 <= x) && r == x) && q == 0) && x <= 10))) && b == a * y) || ((((((((0 == q % -2 && 1 == cond) && r < 4 * y) && 0 <= r) && x <= 10) && cond == 1) && x == r + y * 4) && b == a * y) && y * 2 == q * -1 / -2 * y)) && y <= b / 2 / 2 / 2) && b * -1 / 2 / 2 / -2 <= y) && cond == 1) && 8 * y <= r)) || ((((((((((q == 8 && 1 == cond) && x == r + y * 8) && x <= 10) && x < 16 * y) && b == a * y) || ((1 <= y && ((((((q == 2 && 1 == cond) && 2 * r < x) && x <= 10) && x == r + y * 2) && 2 * y <= x) || (((((y <= 10 && 1 == cond) && 0 <= x) && r == x) && q == 0) && x <= 10))) && b == a * y)) || ((((((((0 == q % -2 && 1 == cond) && r < 4 * y) && 0 <= r) && x <= 10) && cond == 1) && x == r + y * 4) && b == a * y) && y * 2 == q * -1 / -2 * y)) && b == y * 2) && 2 * y <= r) && cond == 1)) || ((((((1 <= y && ((((((q == 2 && 1 == cond) && 2 * r < x) && x <= 10) && x == r + y * 2) && 2 * y <= x) || (((((y <= 10 && 1 == cond) && 0 <= x) && r == x) && q == 0) && x <= 10))) && b == a * y) || ((((((((0 == q % -2 && 1 == cond) && r < 4 * y) && 0 <= r) && x <= 10) && cond == 1) && x == r + y * 4) && b == a * y) && y * 2 == q * -1 / -2 * y)) && cond == 1) && b == y) && y <= r) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (((((((((((((r < 2 * b && x == r + q * y) && y <= 10) && 1 == cond) && 0 <= x) && x <= 10) && cond == 1) && b == y) && b == a * y) && y <= r) || ((((((((1 <= y && q == 8) && 1 == cond) && x == r + y * 8) && x <= 10) && cond == 1) && b == y) && b == a * y) && y <= r)) || ((((((((((q == 8 && 1 == cond) && x == r + y * 8) && x <= 10) && cond == 1) && x < 16 * y) && b == a * y) || ((((1 <= y && (((((q == 2 && 2 * r < x) && x <= 10) && x == r + y * 2) && 2 * y <= x) || ((((y <= 10 && 0 <= x) && r == x) && q == 0) && x <= 10))) && 1 == cond) && cond == 1) && b == a * y)) || ((((((((0 == q % -2 && 1 == cond) && r < 4 * y) && 0 <= r) && x <= 10) && cond == 1) && x == r + y * 4) && b == a * y) && y * 2 == q * -1 / -2 * y)) && b == y * 2) && 2 * y <= r)) || (((((((1 <= y && 4 * y <= r) && (((((q == 2 && 2 * r < x) && x <= 10) && x == r + y * 2) && 2 * y <= x) || ((((y <= 10 && 0 <= x) && r == x) && q == 0) && x <= 10))) && 1 == cond) && cond == 1) && b == a * y) && y <= b / 2 / 2) && b * -1 / 2 / -2 <= y)) || (((((((1 <= y && (((((q == 2 && 2 * r < x) && x <= 10) && x == r + y * 2) && 2 * y <= x) || ((((y <= 10 && 0 <= x) && r == x) && q == 0) && x <= 10))) && 1 == cond) && cond == 1) && b == a * y) || ((((((((0 == q % -2 && 1 == cond) && r < 4 * y) && 0 <= r) && x <= 10) && cond == 1) && x == r + y * 4) && b == a * y) && y * 2 == q * -1 / -2 * y)) && b == y) && y <= r)) || ((((((((1 <= y && (((((q == 2 && 2 * r < x) && x <= 10) && x == r + y * 2) && 2 * y <= x) || ((((y <= 10 && 0 <= x) && r == x) && q == 0) && x <= 10))) && 1 == cond) && cond == 1) && b == a * y) || ((((((((0 == q % -2 && 1 == cond) && r < 4 * y) && 0 <= r) && x <= 10) && cond == 1) && x == r + y * 4) && b == a * y) && y * 2 == q * -1 / -2 * y)) && y <= b / 2 / 2 / 2) && b * -1 / 2 / 2 / -2 <= y) && 8 * y <= r) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (((((((y <= (r * -1 + x) / 2 / 2 / 2 && b * -1 / 2 / 2 / -2 <= y) && (((((((((((((1 <= y && y <= 10) && 0 == q % -2) && 1 == cond) && 0 <= x) && r < 4 * y) && x <= 10) && cond == 1) && 0 <= r) && x == r + y * 4) && b == a * y) && y * 2 == q * -1 / -2 * y) || (((((((((1 <= y && q == 8) && y <= 10) && 1 == cond) && x == r + y * 8) && 0 <= x) && 8 * y <= x) && x <= 10) && cond == 1) && b == a * y)) || ((((((((((1 <= y && y <= 10) && q == 2) && 1 == cond) && 2 * r < x) && 0 <= x) && x <= 10) && cond == 1) && x == r + y * 2) && b == a * y) && 2 * y <= x))) || (b * -1 / -2 <= y && (((((((((((((1 <= y && y <= 10) && 0 == q % -2) && 1 == cond) && 0 <= x) && r < 4 * y) && x <= 10) && cond == 1) && 0 <= r) && x == r + y * 4) && b == a * y) && y * 2 == q * -1 / -2 * y) || (((((((((1 <= y && q == 8) && y <= 10) && 1 == cond) && x == r + y * 8) && 0 <= x) && 8 * y <= x) && x <= 10) && cond == 1) && b == a * y)) || ((((((((((1 <= y && y <= 10) && q == 2) && 1 == cond) && 2 * r < x) && 0 <= x) && x <= 10) && cond == 1) && x == r + y * 2) && b == a * y) && 2 * y <= x)))) || ((((((((1 <= y && y <= 10) && 1 == cond) && 0 <= x) && r == x) && q == 0) && x <= 10) && cond == 1) && b == a * y)) || (((((((((((1 <= y && x == r + y * 6) && y <= 10) && q == 6) && 6 * y <= x) && 1 == cond) && b * -1 / -2 <= y) && 0 <= x) && (r * -1 + -1) / -2 < y + 1) && x <= 10) && cond == 1) && b == a * y)) || (((((q == 1 && x == r + y) && y <= x) && 2 * r < x) && x <= 10) && cond == 1)) || (((((((((x == r + q * y && 1 <= y) && y <= 10) && q * y <= x) && 1 == cond) && 0 <= x) && 2 * r + q * y < y + x) && x <= 10) && cond == 1) && b == a * y)) || ((((((((((((((1 <= y && y <= 10) && 0 == q % -2) && 1 == cond) && 0 <= x) && r < 4 * y) && x <= 10) && cond == 1) && 0 <= r) && x == r + y * 4) && b == a * y) && y * 2 == q * -1 / -2 * y) || (((((((((1 <= y && q == 8) && y <= 10) && 1 == cond) && x == r + y * 8) && 0 <= x) && 8 * y <= x) && x <= 10) && cond == 1) && b == a * y)) || ((((((((((1 <= y && y <= 10) && q == 2) && 1 == cond) && 2 * r < x) && 0 <= x) && x <= 10) && cond == 1) && x == r + y * 2) && b == a * y) && 2 * y <= x)) && q == 4) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((((q == 8 && x == r + y * 8) && (((((((1 <= y && b == a * -1 / -2 * y * 2) && y <= 10) && 1 == cond) && 0 <= x) && x <= 10) && a % -2 == 0) || ((((((1 <= y && y <= 10) && 1 == cond) && 0 <= x) && x <= 10) && b == a * y) && b == y))) && cond == 1) && b == y) && y <= r) || ((((((((1 <= y && 1 == cond) && r == x) && q == 0) && x <= 10) && cond == 1) && b == a * y) && b == y) && y <= r)) || ((b == y && y <= r) && (((((((0 == q % -2 && r < 4 * y) && (((((((1 <= y && b == a * -1 / -2 * y * 2) && y <= 10) && 1 == cond) && 0 <= x) && x <= 10) && a % -2 == 0) || ((((((1 <= y && y <= 10) && 1 == cond) && 0 <= x) && x <= 10) && b == a * y) && b == y))) && 0 <= r) && cond == 1) && x == r + y * 4) && y * 2 == q * -1 / -2 * y) || (cond == 1 && ((((((((q == 2 && 1 == cond) && 2 * r < x) && x <= 10) && x == r + y * 2) && b == a * y) && b == y) && 2 * y <= x) || (((b == a * -1 / -2 * y * 2 && 1 == cond) && (((((q == 2 && 2 * r < x) && x <= 10) && x == r + y * 2) && 2 * y <= x) || (((((1 <= y && y <= 10) && 0 <= x) && r == x) && q == 0) && x <= 10))) && a % -2 == 0)))))) || ((((4 * y <= r && cond == 1) && ((((((((q == 2 && 1 == cond) && 2 * r < x) && x <= 10) && x == r + y * 2) && b == a * y) && b == y) && 2 * y <= x) || (((b == a * -1 / -2 * y * 2 && 1 == cond) && (((((q == 2 && 2 * r < x) && x <= 10) && x == r + y * 2) && 2 * y <= x) || (((((1 <= y && y <= 10) && 0 <= x) && r == x) && q == 0) && x <= 10))) && a % -2 == 0))) && y <= b / 2 / 2) && b * -1 / 2 / -2 <= y)) || (((y <= b / 2 / 2 / 2 && b * -1 / 2 / 2 / -2 <= y) && 8 * y <= r) && (((((((0 == q % -2 && r < 4 * y) && (((((((1 <= y && b == a * -1 / -2 * y * 2) && y <= 10) && 1 == cond) && 0 <= x) && x <= 10) && a % -2 == 0) || ((((((1 <= y && y <= 10) && 1 == cond) && 0 <= x) && x <= 10) && b == a * y) && b == y))) && 0 <= r) && cond == 1) && x == r + y * 4) && y * 2 == q * -1 / -2 * y) || (cond == 1 && ((((((((q == 2 && 1 == cond) && 2 * r < x) && x <= 10) && x == r + y * 2) && b == a * y) && b == y) && 2 * y <= x) || (((b == a * -1 / -2 * y * 2 && 1 == cond) && (((((q == 2 && 2 * r < x) && x <= 10) && x == r + y * 2) && 2 * y <= x) || (((((1 <= y && y <= 10) && 0 <= x) && r == x) && q == 0) && x <= 10))) && a % -2 == 0)))))) || (((((r < 2 * b && x == r + q * y) && (((((((1 <= y && b == a * -1 / -2 * y * 2) && y <= 10) && 1 == cond) && 0 <= x) && x <= 10) && a % -2 == 0) || ((((((1 <= y && y <= 10) && 1 == cond) && 0 <= x) && x <= 10) && b == a * y) && b == y))) && cond == 1) && b == y) && y <= r)) || ((((((((((0 == q % -2 && r < 4 * y) && (((((((1 <= y && b == a * -1 / -2 * y * 2) && y <= 10) && 1 == cond) && 0 <= x) && x <= 10) && a % -2 == 0) || ((((((1 <= y && y <= 10) && 1 == cond) && 0 <= x) && x <= 10) && b == a * y) && b == y))) && 0 <= r) && cond == 1) && x == r + y * 4) && y * 2 == q * -1 / -2 * y) || (((q == 8 && x == r + y * 8) && (((((((1 <= y && b == a * -1 / -2 * y * 2) && y <= 10) && 1 == cond) && 0 <= x) && x <= 10) && a % -2 == 0) || ((((((1 <= y && y <= 10) && 1 == cond) && 0 <= x) && x <= 10) && b == a * y) && b == y))) && cond == 1)) || (cond == 1 && ((((((((q == 2 && 1 == cond) && 2 * r < x) && x <= 10) && x == r + y * 2) && b == a * y) && b == y) && 2 * y <= x) || (((b == a * -1 / -2 * y * 2 && 1 == cond) && (((((q == 2 && 2 * r < x) && x <= 10) && x == r + y * 2) && 2 * y <= x) || (((((1 <= y && y <= 10) && 0 <= x) && r == x) && q == 0) && x <= 10))) && a % -2 == 0)))) && b == y * 2) && 2 * y <= r) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (((((((2 * b <= r && 1 == cond) && a == 2) && (((((1 <= y && y <= 10) && 0 <= x) && r == x) && q == 0) || ((((((1 <= y && y <= 10) && q == 2) && 2 * r < x) && 0 <= x) && x == r + y * 2) && 2 * y <= x))) && x <= 10) && cond == 1) && b == a * y) || (((((2 * b <= r && 1 == cond) && ((((1 == cond && (((((1 <= y && y <= 10) && 0 <= x) && r == x) && q == 0) || ((((((1 <= y && y <= 10) && q == 2) && 2 * r < x) && 0 <= x) && x == r + y * 2) && 2 * y <= x))) && b == a * y) || ((((((((1 <= y && 0 == q % -2) && y <= 10) && 0 <= x) && r < 4 * y) && 0 <= r) && x == r + y * 4) && b == a * y) && y * 2 == q * -1 / -2 * y)) || (((((x == r + q * y && 1 <= y) && y <= 10) && x == r + y * 8) && 0 <= x) && b == a * y))) && x <= 10) && cond == 1) && b == y)) || (((((2 * b <= r && (((1 == cond && (((((1 <= y && y <= 10) && 0 <= x) && r == x) && q == 0) || ((((((1 <= y && y <= 10) && q == 2) && 2 * r < x) && 0 <= x) && x == r + y * 2) && 2 * y <= x))) && b == a * y) || ((((((((1 <= y && 0 == q % -2) && y <= 10) && 0 <= x) && r < 4 * y) && 0 <= r) && x == r + y * 4) && b == a * y) && y * 2 == q * -1 / -2 * y))) && x <= 10) && cond == 1) && y <= b / 2 / 2) && b * -1 / 2 / -2 <= y) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (((((((((((((((r < 2 * b && x == r + q * y) && y <= 10) && 1 == cond) && 0 <= x) && x <= 10) && cond == 1) && b == y) && b == a * y) && y <= r) || ((((((((1 <= y && q == 8) && 1 == cond) && x == r + y * 8) && x <= 10) && cond == 1) && b == y) && b == a * y) && y <= r)) || ((((((((((((0 == q % -2 && 1 == cond) && r < 4 * y) && 0 <= r) && x <= 10) && x == r + y * 4) && b == a * y) && y * 2 == q * -1 / -2 * y) || ((1 <= y && (((((q == 2 && 2 * r < x) && x <= 10) && x == r + y * 2) && 2 * y <= x) || ((((y <= 10 && 0 <= x) && r == x) && q == 0) && x <= 10))) && b == a * y)) && 1 == cond) && cond == 1) && b == y) && y <= r)) || (((((((((((q == 8 && 1 == cond) && x == r + y * 8) && x <= 10) && x < 16 * y) && b == a * y) || (((((((0 == q % -2 && 1 == cond) && r < 4 * y) && 0 <= r) && x <= 10) && x == r + y * 4) && b == a * y) && y * 2 == q * -1 / -2 * y)) || ((1 <= y && (((((q == 2 && 2 * r < x) && x <= 10) && x == r + y * 2) && 2 * y <= x) || ((((y <= 10 && 0 <= x) && r == x) && q == 0) && x <= 10))) && b == a * y)) && y <= (r * -1 + x) / 2 / 2 / 2) && b == y * 2) && 2 * y <= r) && cond == 1)) || ((((((((1 <= y && 1 == cond) && a == 2) && r == x) && q == 0) && 2 * y <= r) && x <= 10) && cond == 1) && b == a * y)) || (((((((1 <= y && 4 * y <= r) && (((((q == 2 && 2 * r < x) && x <= 10) && x == r + y * 2) && 2 * y <= x) || ((((y <= 10 && 0 <= x) && r == x) && q == 0) && x <= 10))) && 1 == cond) && cond == 1) && b == a * y) && y <= b / 2 / 2) && b * -1 / 2 / -2 <= y)) || (((((((((((q == 8 && 1 == cond) && x == r + y * 8) && x <= 10) && x < 16 * y) && b == a * y) || (((((((0 == q % -2 && 1 == cond) && r < 4 * y) && 0 <= r) && x <= 10) && x == r + y * 4) && b == a * y) && y * 2 == q * -1 / -2 * y)) || ((1 <= y && (((((q == 2 && 2 * r < x) && x <= 10) && x == r + y * 2) && 2 * y <= x) || ((((y <= 10 && 0 <= x) && r == x) && q == 0) && x <= 10))) && b == a * y)) && b == y * 2) && 2 * y <= r) && cond == 1) && q == 4)) || (((((((((((((0 == q % -2 && 1 == cond) && r < 4 * y) && 0 <= r) && x <= 10) && x == r + y * 4) && b == a * y) && y * 2 == q * -1 / -2 * y) || ((1 <= y && (((((q == 2 && 2 * r < x) && x <= 10) && x == r + y * 2) && 2 * y <= x) || ((((y <= 10 && 0 <= x) && r == x) && q == 0) && x <= 10))) && b == a * y)) && 1 == cond) && y <= b / 2 / 2 / 2) && b * -1 / 2 / 2 / -2 <= y) && cond == 1) && 8 * y <= r) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((((((((((((((q == 2 && 1 == cond) && (((x <= 10 && b == y) || (x <= 10 && a == 4)) || (b == y * 2 && x <= 10))) && 2 * r < x) && cond == 1) && x == r + y * 2) && b == a * y) && 2 * y <= x) || (((((((((((1 <= y && y <= 10) && 0 == q % -2) && 1 == cond) && 0 <= x) && r < 4 * y) && x <= 10) && 0 <= r) && cond == 1) && x == r + y * 4) && b == a * y) && y * 2 == q * -1 / -2 * y)) || (((((((((1 <= y && q == 8) && y <= 10) && 1 == cond) && x == r + y * 8) && 0 <= x) && 8 * y <= x) && x <= 10) && cond == 1) && b == a * y)) && q == 4) || ((y <= (r * -1 + x) / 2 / 2 / 2 && b * -1 / 2 / 2 / -2 <= y) && (((((((((q == 2 && 1 == cond) && (((x <= 10 && b == y) || (x <= 10 && a == 4)) || (b == y * 2 && x <= 10))) && 2 * r < x) && cond == 1) && x == r + y * 2) && b == a * y) && 2 * y <= x) || (((((((((((1 <= y && y <= 10) && 0 == q % -2) && 1 == cond) && 0 <= x) && r < 4 * y) && x <= 10) && 0 <= r) && cond == 1) && x == r + y * 4) && b == a * y) && y * 2 == q * -1 / -2 * y)) || (((((((((1 <= y && q == 8) && y <= 10) && 1 == cond) && x == r + y * 8) && 0 <= x) && 8 * y <= x) && x <= 10) && cond == 1) && b == a * y)))) || (((((((((x == r + q * y && 1 <= y) && y <= 10) && q * y <= x) && 1 == cond) && 0 <= x) && 2 * r + q * y < y + x) && x <= 10) && cond == 1) && b == a * y)) || (((((((((((1 <= y && x == r + y * 6) && y <= 10) && q == 6) && 6 * y <= x) && 1 == cond) && b * -1 / -2 <= y) && 0 <= x) && (r * -1 + -1) / -2 < y + 1) && x <= 10) && cond == 1) && b == a * y)) || ((((((((1 <= y && y <= 10) && 0 <= x) && r == x) && q == 0) && x <= 10) && cond == 1) && b == a * y) && b == 0)) || (b * -1 / -2 <= y && (((((((((q == 2 && 1 == cond) && (((x <= 10 && b == y) || (x <= 10 && a == 4)) || (b == y * 2 && x <= 10))) && 2 * r < x) && cond == 1) && x == r + y * 2) && b == a * y) && 2 * y <= x) || (((((((((((1 <= y && y <= 10) && 0 == q % -2) && 1 == cond) && 0 <= x) && r < 4 * y) && x <= 10) && 0 <= r) && cond == 1) && x == r + y * 4) && b == a * y) && y * 2 == q * -1 / -2 * y)) || (((((((((1 <= y && q == 8) && y <= 10) && 1 == cond) && x == r + y * 8) && 0 <= x) && 8 * y <= x) && x <= 10) && cond == 1) && b == a * y))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 49.2s, OverallIterations: 17, TraceHistogramMax: 6, AutomataDifference: 38.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 479 SDtfs, 2299 SDslu, 1532 SDs, 0 SdLazy, 3527 SolverSat, 774 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 21.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 830 GetRequests, 530 SyntacticMatches, 4 SemanticMatches, 296 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 18.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 408 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 85 NumberOfFragments, 5045 HoareAnnotationTreeSize, 10 FomulaSimplifications, 218289 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 10 FomulaSimplificationsInter, 26739 FormulaSimplificationTreeSizeReductionInter, 10.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 688 NumberOfCodeBlocks, 614 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 671 ConstructedInterpolants, 0 QuantifiedInterpolants, 449922 SizeOfPredicates, 174 NumberOfNonLiveVariables, 2202 ConjunctsInSsa, 490 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 189/659 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...