/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 15:04:32,494 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 15:04:32,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 15:04:32,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 15:04:32,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 15:04:32,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 15:04:32,534 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 15:04:32,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 15:04:32,539 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 15:04:32,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 15:04:32,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 15:04:32,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 15:04:32,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 15:04:32,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 15:04:32,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 15:04:32,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 15:04:32,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 15:04:32,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 15:04:32,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 15:04:32,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 15:04:32,566 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 15:04:32,566 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 15:04:32,567 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 15:04:32,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 15:04:32,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 15:04:32,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 15:04:32,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 15:04:32,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 15:04:32,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 15:04:32,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 15:04:32,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 15:04:32,576 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 15:04:32,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 15:04:32,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 15:04:32,578 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 15:04:32,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 15:04:32,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 15:04:32,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 15:04:32,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 15:04:32,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 15:04:32,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 15:04:32,583 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-05-02 15:04:32,608 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 15:04:32,608 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 15:04:32,610 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-02 15:04:32,611 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-02 15:04:32,611 INFO L138 SettingsManager]: * Use SBE=true [2021-05-02 15:04:32,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 15:04:32,611 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 15:04:32,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 15:04:32,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 15:04:32,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 15:04:32,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 15:04:32,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 15:04:32,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 15:04:32,612 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 15:04:32,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 15:04:32,612 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 15:04:32,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 15:04:32,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 15:04:32,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 15:04:32,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 15:04:32,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 15:04:32,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 15:04:32,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-02 15:04:32,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-02 15:04:32,614 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 15:04:32,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-02 15:04:32,614 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 15:04:32,614 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-02 15:04:32,614 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/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 15:04:32,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 15:04:32,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 15:04:32,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 15:04:32,868 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 15:04:32,869 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 15:04:32,869 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_valuebound1.c [2021-05-02 15:04:32,912 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/739b33029/8e0d2d5e1d7c4db0abca186186aee6b7/FLAG0abf789cf [2021-05-02 15:04:33,246 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 15:04:33,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_valuebound1.c [2021-05-02 15:04:33,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/739b33029/8e0d2d5e1d7c4db0abca186186aee6b7/FLAG0abf789cf [2021-05-02 15:04:33,270 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/739b33029/8e0d2d5e1d7c4db0abca186186aee6b7 [2021-05-02 15:04:33,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 15:04:33,274 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 15:04:33,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 15:04:33,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 15:04:33,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 15:04:33,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 03:04:33" (1/1) ... [2021-05-02 15:04:33,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15f76827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 03:04:33, skipping insertion in model container [2021-05-02 15:04:33,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 03:04:33" (1/1) ... [2021-05-02 15:04:33,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 15:04:33,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 15:04:33,405 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_valuebound1.c[535,548] [2021-05-02 15:04:33,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 15:04:33,439 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 15:04:33,448 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_valuebound1.c[535,548] [2021-05-02 15:04:33,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 15:04:33,489 INFO L208 MainTranslator]: Completed translation [2021-05-02 15:04:33,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 03:04:33 WrapperNode [2021-05-02 15:04:33,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 15:04:33,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 15:04:33,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 15:04:33,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 15:04:33,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 03:04:33" (1/1) ... [2021-05-02 15:04:33,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 03:04:33" (1/1) ... [2021-05-02 15:04:33,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 03:04:33" (1/1) ... [2021-05-02 15:04:33,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 03:04:33" (1/1) ... [2021-05-02 15:04:33,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 03:04:33" (1/1) ... [2021-05-02 15:04:33,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 03:04:33" (1/1) ... [2021-05-02 15:04:33,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 03:04:33" (1/1) ... [2021-05-02 15:04:33,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 15:04:33,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 15:04:33,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 15:04:33,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 15:04:33,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 03:04:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/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-05-02 15:04:33,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 15:04:33,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 15:04:33,590 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 15:04:33,591 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 15:04:33,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 15:04:33,591 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 15:04:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 15:04:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 15:04:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 15:04:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 15:04:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 15:04:33,593 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 15:04:33,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 15:04:33,593 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 15:04:33,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 15:04:33,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 15:04:33,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 15:04:33,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 15:04:33,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 15:04:33,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 15:04:33,805 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 15:04:33,805 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-05-02 15:04:33,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 03:04:33 BoogieIcfgContainer [2021-05-02 15:04:33,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 15:04:33,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 15:04:33,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 15:04:33,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 15:04:33,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 03:04:33" (1/3) ... [2021-05-02 15:04:33,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe5b5a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 03:04:33, skipping insertion in model container [2021-05-02 15:04:33,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 03:04:33" (2/3) ... [2021-05-02 15:04:33,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe5b5a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 03:04:33, skipping insertion in model container [2021-05-02 15:04:33,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 03:04:33" (3/3) ... [2021-05-02 15:04:33,812 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_valuebound1.c [2021-05-02 15:04:33,815 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-02 15:04:33,817 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 15:04:33,827 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 15:04:33,841 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 15:04:33,841 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 15:04:33,841 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-02 15:04:33,841 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 15:04:33,841 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 15:04:33,841 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 15:04:33,841 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 15:04:33,841 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 15:04:33,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-05-02 15:04:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-02 15:04:33,854 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 15:04:33,854 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 15:04:33,854 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 15:04:33,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 15:04:33,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1718462925, now seen corresponding path program 1 times [2021-05-02 15:04:33,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 15:04:33,863 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944131972] [2021-05-02 15:04:33,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 15:04:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:04:33,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 15:04:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:04:33,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 15:04:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:04:33,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-02 15:04:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:04:34,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 15:04:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:04:34,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-05-02 15:04:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:04:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-05-02 15:04:34,010 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 15:04:34,010 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944131972] [2021-05-02 15:04:34,010 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944131972] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 15:04:34,010 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 15:04:34,011 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 15:04:34,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711287655] [2021-05-02 15:04:34,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 15:04:34,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 15:04:34,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 15:04:34,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 15:04:34,023 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-05-02 15:04:34,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 15:04:34,095 INFO L93 Difference]: Finished difference Result 67 states and 106 transitions. [2021-05-02 15:04:34,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 15:04:34,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2021-05-02 15:04:34,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 15:04:34,101 INFO L225 Difference]: With dead ends: 67 [2021-05-02 15:04:34,102 INFO L226 Difference]: Without dead ends: 32 [2021-05-02 15:04:34,105 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 15:04:34,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-05-02 15:04:34,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-05-02 15:04:34,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-02 15:04:34,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2021-05-02 15:04:34,147 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 33 [2021-05-02 15:04:34,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 15:04:34,147 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2021-05-02 15:04:34,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-05-02 15:04:34,148 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2021-05-02 15:04:34,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-02 15:04:34,150 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 15:04:34,150 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 15:04:34,151 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 15:04:34,151 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 15:04:34,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 15:04:34,152 INFO L82 PathProgramCache]: Analyzing trace with hash 657160210, now seen corresponding path program 1 times [2021-05-02 15:04:34,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 15:04:34,152 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926763917] [2021-05-02 15:04:34,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 15:04:34,182 ERROR L278 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-05-02 15:04:34,182 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [47183560] [2021-05-02 15:04:34,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-05-02 15:04:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:04:34,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 27 conjunts are in the unsatisfiable core [2021-05-02 15:04:34,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 15:04:34,317 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:04:34,320 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:04:34,345 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:04:34,346 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:04:34,348 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:04:34,349 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:04:34,380 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:04:34,382 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:04:34,444 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:04:34,449 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:04:34,486 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-05-02 15:04:34,486 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 15:04:34,486 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926763917] [2021-05-02 15:04:34,487 WARN L340 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-05-02 15:04:34,487 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47183560] [2021-05-02 15:04:34,488 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47183560] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 15:04:34,488 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-05-02 15:04:34,488 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2021-05-02 15:04:34,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943858228] [2021-05-02 15:04:34,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 15:04:34,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 15:04:34,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 15:04:34,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-05-02 15:04:34,494 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2021-05-02 15:05:03,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 15:05:03,977 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2021-05-02 15:05:03,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 15:05:03,978 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 33 [2021-05-02 15:05:03,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 15:05:03,997 INFO L225 Difference]: With dead ends: 40 [2021-05-02 15:05:03,997 INFO L226 Difference]: Without dead ends: 38 [2021-05-02 15:05:03,998 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 100.9ms TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-05-02 15:05:03,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-05-02 15:05:04,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-05-02 15:05:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2021-05-02 15:05:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2021-05-02 15:05:04,006 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 33 [2021-05-02 15:05:04,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 15:05:04,006 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2021-05-02 15:05:04,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2021-05-02 15:05:04,006 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2021-05-02 15:05:04,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-05-02 15:05:04,007 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 15:05:04,007 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 15:05:04,238 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-05-02 15:05:04,239 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 15:05:04,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 15:05:04,239 INFO L82 PathProgramCache]: Analyzing trace with hash 936002262, now seen corresponding path program 1 times [2021-05-02 15:05:04,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 15:05:04,239 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472631869] [2021-05-02 15:05:04,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 15:05:04,257 ERROR L278 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-05-02 15:05:04,258 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1963631183] [2021-05-02 15:05:04,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-05-02 15:05:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:05:04,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 18 conjunts are in the unsatisfiable core [2021-05-02 15:05:04,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 15:05:04,340 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:04,348 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:04,371 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:04,372 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:04,382 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:04,384 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:04,428 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:04,429 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:04,538 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:04,544 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:04,572 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-05-02 15:05:04,572 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 15:05:04,572 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472631869] [2021-05-02 15:05:04,572 WARN L340 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-05-02 15:05:04,572 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963631183] [2021-05-02 15:05:04,572 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963631183] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 15:05:04,573 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-05-02 15:05:04,573 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-05-02 15:05:04,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931221604] [2021-05-02 15:05:04,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-02 15:05:04,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 15:05:04,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-02 15:05:04,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-05-02 15:05:04,574 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-05-02 15:05:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 15:05:13,335 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2021-05-02 15:05:13,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 15:05:13,336 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2021-05-02 15:05:13,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 15:05:13,337 INFO L225 Difference]: With dead ends: 56 [2021-05-02 15:05:13,337 INFO L226 Difference]: Without dead ends: 53 [2021-05-02 15:05:13,337 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 166.9ms TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-05-02 15:05:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-05-02 15:05:13,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-05-02 15:05:13,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.1875) internal successors, (38), 35 states have internal predecessors, (38), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2021-05-02 15:05:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2021-05-02 15:05:13,345 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 39 [2021-05-02 15:05:13,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 15:05:13,345 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2021-05-02 15:05:13,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-05-02 15:05:13,345 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2021-05-02 15:05:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-05-02 15:05:13,346 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 15:05:13,346 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 15:05:13,561 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 15:05:13,561 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 15:05:13,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 15:05:13,561 INFO L82 PathProgramCache]: Analyzing trace with hash 584476005, now seen corresponding path program 1 times [2021-05-02 15:05:13,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 15:05:13,562 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893904511] [2021-05-02 15:05:13,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 15:05:13,569 ERROR L278 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-05-02 15:05:13,569 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1604844591] [2021-05-02 15:05:13,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-05-02 15:05:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:05:13,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjunts are in the unsatisfiable core [2021-05-02 15:05:13,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 15:05:13,727 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:13,730 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:13,773 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:13,777 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:13,793 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:13,809 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:13,811 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:13,813 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:13,814 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:13,827 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:13,829 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:13,831 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:13,833 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:13,867 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:13,871 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-05-02 15:05:13,877 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 15:05:13,878 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893904511] [2021-05-02 15:05:13,878 WARN L340 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-05-02 15:05:13,878 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604844591] [2021-05-02 15:05:13,878 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604844591] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 15:05:13,878 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-05-02 15:05:13,878 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-05-02 15:05:13,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695351957] [2021-05-02 15:05:13,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 15:05:13,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 15:05:13,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 15:05:13,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 15:05:13,879 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-05-02 15:05:13,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 15:05:13,954 INFO L93 Difference]: Finished difference Result 91 states and 119 transitions. [2021-05-02 15:05:13,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 15:05:13,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 47 [2021-05-02 15:05:13,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 15:05:13,956 INFO L225 Difference]: With dead ends: 91 [2021-05-02 15:05:13,956 INFO L226 Difference]: Without dead ends: 60 [2021-05-02 15:05:13,956 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 45.4ms TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-05-02 15:05:13,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-05-02 15:05:13,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-05-02 15:05:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2021-05-02 15:05:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2021-05-02 15:05:13,965 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 47 [2021-05-02 15:05:13,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 15:05:13,965 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2021-05-02 15:05:13,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-05-02 15:05:13,965 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2021-05-02 15:05:13,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-05-02 15:05:13,966 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 15:05:13,966 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 15:05:14,182 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 15:05:14,182 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 15:05:14,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 15:05:14,183 INFO L82 PathProgramCache]: Analyzing trace with hash 835669333, now seen corresponding path program 1 times [2021-05-02 15:05:14,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 15:05:14,183 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677623562] [2021-05-02 15:05:14,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 15:05:14,203 ERROR L278 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-05-02 15:05:14,203 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [554690169] [2021-05-02 15:05:14,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-05-02 15:05:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:05:14,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 28 conjunts are in the unsatisfiable core [2021-05-02 15:05:14,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 15:05:14,295 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:14,296 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:14,318 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:14,319 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:14,321 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:14,322 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:14,351 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:14,352 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:48,994 WARN L205 SmtUtils]: Spent 31.64 s on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2021-05-02 15:05:48,997 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:49,008 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:49,016 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:49,018 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,040 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,042 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,044 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,047 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,048 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,051 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,051 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,053 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,054 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,063 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,064 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,066 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,068 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,069 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,071 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,072 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,078 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,080 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,082 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,083 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,084 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,087 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,089 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,090 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,092 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,093 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,095 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,095 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,103 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,105 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,107 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,118 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,119 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,120 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,121 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,123 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,125 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,126 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,127 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,128 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,130 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,131 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,132 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,134 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,135 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,137 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,137 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,145 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,147 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,149 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,151 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,153 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,155 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,157 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,159 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,161 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,162 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:05:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-05-02 15:05:52,168 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 15:05:52,168 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677623562] [2021-05-02 15:05:52,168 WARN L340 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-05-02 15:05:52,168 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554690169] [2021-05-02 15:05:52,168 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554690169] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 15:05:52,168 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 15:05:52,168 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 15:05:52,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139609329] [2021-05-02 15:05:52,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 15:05:52,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 15:05:52,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 15:05:52,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=49, Unknown=1, NotChecked=0, Total=72 [2021-05-02 15:05:52,169 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand has 9 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2021-05-02 15:06:23,859 WARN L205 SmtUtils]: Spent 31.64 s on a formula simplification that was a NOOP. DAG size: 21 [2021-05-02 15:06:27,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 15:06:27,644 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2021-05-02 15:06:27,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 15:06:27,645 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 54 [2021-05-02 15:06:27,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 15:06:27,645 INFO L225 Difference]: With dead ends: 62 [2021-05-02 15:06:27,645 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 15:06:27,646 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 69332.9ms TimeCoverageRelationStatistics Valid=33, Invalid=76, Unknown=1, NotChecked=0, Total=110 [2021-05-02 15:06:27,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 15:06:27,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 15:06:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-02 15:06:27,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 15:06:27,646 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2021-05-02 15:06:27,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 15:06:27,647 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 15:06:27,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2021-05-02 15:06:27,647 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 15:06:27,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 15:06:27,855 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 15:06:27,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 15:06:38,880 WARN L205 SmtUtils]: Spent 10.86 s on a formula simplification. DAG size of input: 72 DAG size of output: 34 [2021-05-02 15:06:52,327 WARN L205 SmtUtils]: Spent 13.42 s on a formula simplification. DAG size of input: 72 DAG size of output: 34 [2021-05-02 15:07:00,523 WARN L205 SmtUtils]: Spent 8.17 s on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2021-05-02 15:07:06,698 WARN L205 SmtUtils]: Spent 6.17 s on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2021-05-02 15:07:42,041 WARN L205 SmtUtils]: Spent 35.34 s on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2021-05-02 15:07:42,043 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2021-05-02 15:07:42,043 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2021-05-02 15:07:42,043 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2021-05-02 15:07:42,043 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2021-05-02 15:07:42,043 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2021-05-02 15:07:42,044 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2021-05-02 15:07:42,044 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-05-02 15:07:42,044 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-02 15:07:42,044 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 15:07:42,044 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-05-02 15:07:42,044 INFO L201 CegarLoopUtils]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2021-05-02 15:07:42,044 INFO L198 CegarLoopUtils]: For program point L9(line 9) no Hoare annotation was computed. [2021-05-02 15:07:42,044 INFO L198 CegarLoopUtils]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2021-05-02 15:07:42,044 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2021-05-02 15:07:42,044 INFO L194 CegarLoopUtils]: At program point L35-2(lines 35 55) the Hoare annotation is: (let ((.cse1 (* main_~v~0 main_~v~0)) (.cse2 (* main_~A~0 4)) (.cse3 (* main_~u~0 2)) (.cse0 (+ (* main_~u~0 main_~u~0) (* main_~v~0 2)))) (and (= .cse0 (+ .cse1 .cse2 (* main_~r~0 4) .cse3)) (<= 0 main_~A~0) (= (+ .cse1 .cse2 .cse3) .cse0) (<= main_~A~0 1))) [2021-05-02 15:07:42,044 INFO L198 CegarLoopUtils]: For program point mainEXIT(lines 19 59) no Hoare annotation was computed. [2021-05-02 15:07:42,044 INFO L201 CegarLoopUtils]: At program point L23(line 23) the Hoare annotation is: true [2021-05-02 15:07:42,044 INFO L198 CegarLoopUtils]: For program point L23-1(line 23) no Hoare annotation was computed. [2021-05-02 15:07:42,044 INFO L198 CegarLoopUtils]: For program point L48-1(lines 35 55) no Hoare annotation was computed. [2021-05-02 15:07:42,044 INFO L194 CegarLoopUtils]: At program point L48-2(lines 35 55) the Hoare annotation is: (and (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* 2 main_~R~0))) (= (+ (* main_~u~0 main_~u~0) (* main_~v~0 2)) (+ (* main_~v~0 main_~v~0) (* main_~A~0 4) (* main_~r~0 4) (* main_~u~0 2))) (< (div (+ (* main_~r~0 (- 1)) (- 2)) (- 2)) 2) (<= main_~A~0 1) (exists ((main_~R~0 Int)) (let ((.cse0 (* main_~R~0 main_~R~0))) (and (< (+ .cse0 1) (+ main_~A~0 (* 2 main_~R~0))) (<= .cse0 (+ main_~A~0 main_~r~0)))))) [2021-05-02 15:07:42,044 INFO L194 CegarLoopUtils]: At program point L40-2(lines 40 46) the Hoare annotation is: (and (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* 2 main_~R~0))) (= (+ (* main_~u~0 main_~u~0) (* main_~v~0 2)) (+ (* main_~v~0 main_~v~0) (* main_~A~0 4) (* main_~r~0 4) (* main_~u~0 2))) (< (div (+ (* main_~r~0 (- 1)) (- 2)) (- 2)) 2) (<= main_~A~0 1) (exists ((main_~R~0 Int)) (let ((.cse0 (* main_~R~0 main_~R~0))) (and (< (+ .cse0 1) (+ main_~A~0 (* 2 main_~R~0))) (<= .cse0 (+ main_~A~0 main_~r~0)))))) [2021-05-02 15:07:42,045 INFO L194 CegarLoopUtils]: At program point L36(line 36) the Hoare annotation is: (and (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* 2 main_~R~0))) (= (+ (* main_~u~0 main_~u~0) (* main_~v~0 2)) (+ (* main_~v~0 main_~v~0) (* main_~A~0 4) (* main_~r~0 4) (* main_~u~0 2))) (< (div (+ (* main_~r~0 (- 1)) (- 2)) (- 2)) 2) (<= main_~A~0 1) (exists ((main_~R~0 Int)) (let ((.cse0 (* main_~R~0 main_~R~0))) (and (< (+ .cse0 1) (+ main_~A~0 (* 2 main_~R~0))) (<= .cse0 (+ main_~A~0 main_~r~0)))))) [2021-05-02 15:07:42,045 INFO L198 CegarLoopUtils]: For program point L36-1(lines 35 55) no Hoare annotation was computed. [2021-05-02 15:07:42,045 INFO L198 CegarLoopUtils]: For program point L28(line 28) no Hoare annotation was computed. [2021-05-02 15:07:42,045 INFO L198 CegarLoopUtils]: For program point L57(line 57) no Hoare annotation was computed. [2021-05-02 15:07:42,045 INFO L194 CegarLoopUtils]: At program point L49(line 49) the Hoare annotation is: (and (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* 2 main_~R~0))) (= (+ (* main_~u~0 main_~u~0) (* main_~v~0 2)) (+ (* main_~v~0 main_~v~0) (* main_~A~0 4) (* main_~r~0 4) (* main_~u~0 2))) (< (div (+ (* main_~r~0 (- 1)) (- 2)) (- 2)) 2) (<= main_~A~0 1) (exists ((main_~R~0 Int)) (let ((.cse0 (* main_~R~0 main_~R~0))) (and (< (+ .cse0 1) (+ main_~A~0 (* 2 main_~R~0))) (<= .cse0 (+ main_~A~0 main_~r~0)))))) [2021-05-02 15:07:42,045 INFO L198 CegarLoopUtils]: For program point L49-1(lines 48 54) no Hoare annotation was computed. [2021-05-02 15:07:42,045 INFO L194 CegarLoopUtils]: At program point L41(line 41) the Hoare annotation is: (and (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* 2 main_~R~0))) (= (+ (* main_~u~0 main_~u~0) (* main_~v~0 2)) (+ (* main_~v~0 main_~v~0) (* main_~A~0 4) (* main_~r~0 4) (* main_~u~0 2))) (< (div (+ (* main_~r~0 (- 1)) (- 2)) (- 2)) 2) (<= main_~A~0 1) (exists ((main_~R~0 Int)) (let ((.cse0 (* main_~R~0 main_~R~0))) (and (< (+ .cse0 1) (+ main_~A~0 (* 2 main_~R~0))) (<= .cse0 (+ main_~A~0 main_~r~0)))))) [2021-05-02 15:07:42,045 INFO L198 CegarLoopUtils]: For program point L41-1(lines 40 46) no Hoare annotation was computed. [2021-05-02 15:07:42,045 INFO L194 CegarLoopUtils]: At program point L25(line 25) the Hoare annotation is: (and (<= 0 main_~A~0) (<= main_~A~0 1)) [2021-05-02 15:07:42,045 INFO L194 CegarLoopUtils]: At program point L25-1(line 25) the Hoare annotation is: (and (<= 0 main_~A~0) (<= main_~A~0 1) (<= main_~R~0 1) (<= 0 main_~R~0)) [2021-05-02 15:07:42,045 INFO L198 CegarLoopUtils]: For program point mainFINAL(lines 19 59) no Hoare annotation was computed. [2021-05-02 15:07:42,045 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 19 59) the Hoare annotation is: true [2021-05-02 15:07:42,045 INFO L194 CegarLoopUtils]: At program point L26(line 26) the Hoare annotation is: (and (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* 2 main_~R~0))) (<= main_~A~0 1)) [2021-05-02 15:07:42,045 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2021-05-02 15:07:42,045 INFO L198 CegarLoopUtils]: For program point L13(lines 13 14) no Hoare annotation was computed. [2021-05-02 15:07:42,045 INFO L198 CegarLoopUtils]: For program point L12(lines 12 15) no Hoare annotation was computed. [2021-05-02 15:07:42,046 INFO L198 CegarLoopUtils]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2021-05-02 15:07:42,046 INFO L198 CegarLoopUtils]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2021-05-02 15:07:42,046 INFO L198 CegarLoopUtils]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2021-05-02 15:07:42,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 03:07:42 BoogieIcfgContainer [2021-05-02 15:07:42,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 15:07:42,061 INFO L168 Benchmark]: Toolchain (without parser) took 188787.09 ms. Allocated memory is still 215.0 MB. Free memory was 179.0 MB in the beginning and 90.1 MB in the end (delta: 89.0 MB). Peak memory consumption was 90.0 MB. Max. memory is 8.0 GB. [2021-05-02 15:07:42,061 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 215.0 MB. Free memory is still 195.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 15:07:42,061 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.23 ms. Allocated memory is still 215.0 MB. Free memory was 178.9 MB in the beginning and 198.4 MB in the end (delta: -19.5 MB). Peak memory consumption was 14.2 MB. Max. memory is 8.0 GB. [2021-05-02 15:07:42,061 INFO L168 Benchmark]: Boogie Preprocessor took 47.39 ms. Allocated memory is still 215.0 MB. Free memory was 198.4 MB in the beginning and 196.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-02 15:07:42,061 INFO L168 Benchmark]: RCFGBuilder took 268.30 ms. Allocated memory is still 215.0 MB. Free memory was 196.3 MB in the beginning and 179.5 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2021-05-02 15:07:42,061 INFO L168 Benchmark]: TraceAbstraction took 188253.44 ms. Allocated memory is still 215.0 MB. Free memory was 179.0 MB in the beginning and 90.1 MB in the end (delta: 89.0 MB). Peak memory consumption was 90.5 MB. Max. memory is 8.0 GB. [2021-05-02 15:07:42,062 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.10 ms. Allocated memory is still 215.0 MB. Free memory is still 195.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 213.23 ms. Allocated memory is still 215.0 MB. Free memory was 178.9 MB in the beginning and 198.4 MB in the end (delta: -19.5 MB). Peak memory consumption was 14.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 47.39 ms. Allocated memory is still 215.0 MB. Free memory was 198.4 MB in the beginning and 196.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 268.30 ms. Allocated memory is still 215.0 MB. Free memory was 196.3 MB in the beginning and 179.5 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 188253.44 ms. Allocated memory is still 215.0 MB. Free memory was 179.0 MB in the beginning and 90.1 MB in the end (delta: 89.0 MB). Peak memory consumption was 90.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 114016.4ms, OverallIterations: 5, TraceHistogramMax: 4, EmptinessCheckTime: 9.7ms, AutomataDifference: 73917.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 74187.3ms, InitialAbstractionConstructionTime: 7.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 153 SDtfs, 115 SDslu, 483 SDs, 0 SdLazy, 395 SolverSat, 46 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 41923.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 69680.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=4, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 57.4ms AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 16 LocationsWithAnnotation, 45 PreInvPairs, 56 NumberOfFragments, 443 HoareAnnotationTreeSize, 45 FomulaSimplifications, 27 FormulaSimplificationTreeSizeReduction, 90.0ms HoareSimplificationTime, 16 FomulaSimplificationsInter, 755 FormulaSimplificationTreeSizeReductionInter, 74089.4ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 50.8ms SsaConstructionTime, 112.5ms SatisfiabilityAnalysisTime, 38713.2ms InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 201 ConstructedInterpolants, 9 QuantifiedInterpolants, 930 SizeOfPredicates, 18 NumberOfNonLiveVariables, 606 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 127/152 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant [2021-05-02 15:07:42,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] Derived loop invariant: (((R * R + 1 < A + 2 * R && u * u + v * 2 == v * v + A * 4 + r * 4 + u * 2) && (r * -1 + -2) / -2 < 2) && A <= 1) && (\exists main_~R~0 : int :: main_~R~0 * main_~R~0 + 1 < A + 2 * main_~R~0 && main_~R~0 * main_~R~0 <= A + r) - InvariantResult [Line: 35]: Loop Invariant [2021-05-02 15:07:42,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] [2021-05-02 15:07:42,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~R~0,QUANTIFIED] Derived loop invariant: (((R * R + 1 < A + 2 * R && u * u + v * 2 == v * v + A * 4 + r * 4 + u * 2) && (r * -1 + -2) / -2 < 2) && A <= 1) && (\exists main_~R~0 : int :: main_~R~0 * main_~R~0 + 1 < A + 2 * main_~R~0 && main_~R~0 * main_~R~0 <= A + r) RESULT: Ultimate proved your program to be correct! Received shutdown request...