/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench/geo2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:30:01,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:30:01,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:30:01,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:30:01,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:30:01,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:30:01,729 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:30:01,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:30:01,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:30:01,749 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:30:01,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:30:01,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:30:01,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:30:01,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:30:01,759 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:30:01,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:30:01,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:30:01,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:30:01,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:30:01,775 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:30:01,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:30:01,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:30:01,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:30:01,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:30:01,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:30:01,793 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:30:01,794 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:30:01,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:30:01,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:30:01,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:30:01,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:30:01,801 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:30:01,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:30:01,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:30:01,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:30:01,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:30:01,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:30:01,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:30:01,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:30:01,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:30:01,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:30:01,812 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 [2020-07-10 15:30:01,857 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:30:01,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:30:01,860 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:30:01,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:30:01,861 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:30:01,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:30:01,861 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:30:01,862 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:30:01,862 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:30:01,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:30:01,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:30:01,863 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:30:01,863 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:30:01,863 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:30:01,864 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:30:01,865 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:30:01,865 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:30:01,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:30:01,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:30:01,866 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:30:01,866 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:30:01,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:30:01,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:30:01,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:30:01,867 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:30:01,867 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:30:01,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:30:01,868 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:30:01,868 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:30:01,869 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:30:02,251 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:30:02,280 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:30:02,285 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:30:02,288 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:30:02,288 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:30:02,290 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/geo2.c [2020-07-10 15:30:02,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd30cf4d7/020cbb86038c4ee4a9da59d2975c522b/FLAGedf8efef3 [2020-07-10 15:30:03,000 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:30:03,001 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/geo2.c [2020-07-10 15:30:03,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd30cf4d7/020cbb86038c4ee4a9da59d2975c522b/FLAGedf8efef3 [2020-07-10 15:30:03,334 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd30cf4d7/020cbb86038c4ee4a9da59d2975c522b [2020-07-10 15:30:03,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:30:03,346 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:30:03,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:30:03,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:30:03,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:30:03,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:30:03" (1/1) ... [2020-07-10 15:30:03,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e73a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:03, skipping insertion in model container [2020-07-10 15:30:03,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:30:03" (1/1) ... [2020-07-10 15:30:03,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:30:03,389 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:30:03,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:30:03,636 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:30:03,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:30:03,673 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:30:03,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:03 WrapperNode [2020-07-10 15:30:03,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:30:03,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:30:03,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:30:03,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:30:03,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:03" (1/1) ... [2020-07-10 15:30:03,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:03" (1/1) ... [2020-07-10 15:30:03,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:03" (1/1) ... [2020-07-10 15:30:03,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:03" (1/1) ... [2020-07-10 15:30:03,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:03" (1/1) ... [2020-07-10 15:30:03,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:03" (1/1) ... [2020-07-10 15:30:03,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:03" (1/1) ... [2020-07-10 15:30:03,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:30:03,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:30:03,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:30:03,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:30:03,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:03" (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 [2020-07-10 15:30:03,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:30:03,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:30:03,881 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:30:03,881 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:30:03,882 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:30:03,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:30:03,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:30:03,882 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:30:03,882 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:30:03,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:30:03,883 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:30:03,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:30:03,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:30:04,184 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:30:04,185 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:30:04,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:30:04 BoogieIcfgContainer [2020-07-10 15:30:04,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:30:04,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:30:04,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:30:04,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:30:04,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:30:03" (1/3) ... [2020-07-10 15:30:04,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63874c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:30:04, skipping insertion in model container [2020-07-10 15:30:04,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:03" (2/3) ... [2020-07-10 15:30:04,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63874c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:30:04, skipping insertion in model container [2020-07-10 15:30:04,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:30:04" (3/3) ... [2020-07-10 15:30:04,206 INFO L109 eAbstractionObserver]: Analyzing ICFG geo2.c [2020-07-10 15:30:04,222 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:30:04,235 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:30:04,256 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:30:04,287 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:30:04,287 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:30:04,287 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:30:04,287 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:30:04,288 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:30:04,288 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:30:04,288 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:30:04,289 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:30:04,316 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-10 15:30:04,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-10 15:30:04,323 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:04,325 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:04,326 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:04,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:04,345 INFO L82 PathProgramCache]: Analyzing trace with hash -64610451, now seen corresponding path program 1 times [2020-07-10 15:30:04,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:04,369 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871679982] [2020-07-10 15:30:04,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:04,524 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-10 15:30:04,525 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2020-07-10 15:30:04,527 INFO L263 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2020-07-10 15:30:04,527 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-10 15:30:04,528 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2020-07-10 15:30:04,528 INFO L263 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2020-07-10 15:30:04,529 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := 1;~c~0 := 1; {23#true} is VALID [2020-07-10 15:30:04,531 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#true} assume false; {24#false} is VALID [2020-07-10 15:30:04,532 INFO L263 TraceCheckUtils]: 6: Hoare triple {24#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {24#false} is VALID [2020-07-10 15:30:04,532 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2020-07-10 15:30:04,532 INFO L280 TraceCheckUtils]: 8: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2020-07-10 15:30:04,533 INFO L280 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-10 15:30:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:30:04,535 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871679982] [2020-07-10 15:30:04,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:30:04,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 15:30:04,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056754647] [2020-07-10 15:30:04,548 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-10 15:30:04,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:04,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 15:30:04,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:04,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 15:30:04,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:04,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 15:30:04,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:30:04,619 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-10 15:30:04,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:04,735 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2020-07-10 15:30:04,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 15:30:04,737 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-10 15:30:04,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:04,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:30:04,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-10 15:30:04,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:30:04,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-10 15:30:04,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 45 transitions. [2020-07-10 15:30:04,881 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:04,896 INFO L225 Difference]: With dead ends: 35 [2020-07-10 15:30:04,897 INFO L226 Difference]: Without dead ends: 15 [2020-07-10 15:30:04,903 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:30:04,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-10 15:30:04,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-10 15:30:04,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:04,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-10 15:30:04,968 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-10 15:30:04,969 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-10 15:30:04,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:04,976 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-10 15:30:04,977 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-10 15:30:04,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:04,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:04,978 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-10 15:30:04,979 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-10 15:30:04,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:04,984 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-10 15:30:04,984 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-10 15:30:04,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:04,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:04,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:04,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:04,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:30:04,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-10 15:30:04,993 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2020-07-10 15:30:04,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:04,994 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-10 15:30:04,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 15:30:04,994 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-10 15:30:04,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-10 15:30:04,996 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:04,997 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:04,998 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:30:04,998 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:04,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:05,000 INFO L82 PathProgramCache]: Analyzing trace with hash -62822991, now seen corresponding path program 1 times [2020-07-10 15:30:05,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:05,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586531517] [2020-07-10 15:30:05,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:05,014 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:05,015 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [47408790] [2020-07-10 15:30:05,015 INFO L94 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 [2020-07-10 15:30:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:05,080 INFO L264 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 15:30:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:05,103 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:05,279 INFO L263 TraceCheckUtils]: 0: Hoare triple {129#true} call ULTIMATE.init(); {129#true} is VALID [2020-07-10 15:30:05,280 INFO L280 TraceCheckUtils]: 1: Hoare triple {129#true} assume true; {129#true} is VALID [2020-07-10 15:30:05,280 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {129#true} {129#true} #46#return; {129#true} is VALID [2020-07-10 15:30:05,281 INFO L263 TraceCheckUtils]: 3: Hoare triple {129#true} call #t~ret2 := main(); {129#true} is VALID [2020-07-10 15:30:05,283 INFO L280 TraceCheckUtils]: 4: Hoare triple {129#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := 1;~c~0 := 1; {146#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-10 15:30:05,285 INFO L280 TraceCheckUtils]: 5: Hoare triple {146#(and (= 1 main_~x~0) (= 1 main_~y~0))} assume !false; {146#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-10 15:30:05,289 INFO L263 TraceCheckUtils]: 6: Hoare triple {146#(and (= 1 main_~x~0) (= 1 main_~y~0))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {153#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:30:05,291 INFO L280 TraceCheckUtils]: 7: Hoare triple {153#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {157#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:05,293 INFO L280 TraceCheckUtils]: 8: Hoare triple {157#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {130#false} is VALID [2020-07-10 15:30:05,294 INFO L280 TraceCheckUtils]: 9: Hoare triple {130#false} assume !false; {130#false} is VALID [2020-07-10 15:30:05,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:30:05,297 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586531517] [2020-07-10 15:30:05,297 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:05,298 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47408790] [2020-07-10 15:30:05,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:30:05,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:30:05,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265911320] [2020-07-10 15:30:05,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-10 15:30:05,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:05,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:30:05,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:05,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:30:05,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:05,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:30:05,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:30:05,331 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2020-07-10 15:30:05,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:05,611 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-10 15:30:05,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:30:05,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-10 15:30:05,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:30:05,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-10 15:30:05,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:30:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-10 15:30:05,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2020-07-10 15:30:05,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:05,688 INFO L225 Difference]: With dead ends: 25 [2020-07-10 15:30:05,688 INFO L226 Difference]: Without dead ends: 22 [2020-07-10 15:30:05,691 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:30:05,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-10 15:30:05,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-10 15:30:05,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:05,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-10 15:30:05,720 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-10 15:30:05,720 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-10 15:30:05,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:05,726 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-10 15:30:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-10 15:30:05,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:05,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:05,728 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-10 15:30:05,728 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-10 15:30:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:05,736 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-10 15:30:05,741 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-10 15:30:05,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:05,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:05,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:05,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:05,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-10 15:30:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-10 15:30:05,745 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 10 [2020-07-10 15:30:05,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:05,746 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-10 15:30:05,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:30:05,746 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-10 15:30:05,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:30:05,748 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:05,748 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:05,962 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:30:05,962 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:05,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:05,963 INFO L82 PathProgramCache]: Analyzing trace with hash 50868238, now seen corresponding path program 1 times [2020-07-10 15:30:05,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:05,968 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978102355] [2020-07-10 15:30:05,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:05,986 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:05,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1018095133] [2020-07-10 15:30:05,987 INFO L94 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 [2020-07-10 15:30:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:06,024 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-10 15:30:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:06,036 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:06,205 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-10 15:30:06,206 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-10 15:30:06,207 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #46#return; {279#true} is VALID [2020-07-10 15:30:06,207 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret2 := main(); {279#true} is VALID [2020-07-10 15:30:06,209 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := 1;~c~0 := 1; {296#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-10 15:30:06,210 INFO L280 TraceCheckUtils]: 5: Hoare triple {296#(and (= 1 main_~x~0) (= 1 main_~y~0))} assume !false; {296#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-10 15:30:06,211 INFO L263 TraceCheckUtils]: 6: Hoare triple {296#(and (= 1 main_~x~0) (= 1 main_~y~0))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {279#true} is VALID [2020-07-10 15:30:06,211 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} ~cond := #in~cond; {279#true} is VALID [2020-07-10 15:30:06,212 INFO L280 TraceCheckUtils]: 8: Hoare triple {279#true} assume !(0 == ~cond); {279#true} is VALID [2020-07-10 15:30:06,212 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-10 15:30:06,214 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {279#true} {296#(and (= 1 main_~x~0) (= 1 main_~y~0))} #50#return; {296#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-10 15:30:06,216 INFO L280 TraceCheckUtils]: 11: Hoare triple {296#(and (= 1 main_~x~0) (= 1 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {318#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} is VALID [2020-07-10 15:30:06,218 INFO L280 TraceCheckUtils]: 12: Hoare triple {318#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} assume !false; {318#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} is VALID [2020-07-10 15:30:06,224 INFO L263 TraceCheckUtils]: 13: Hoare triple {318#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {325#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:30:06,226 INFO L280 TraceCheckUtils]: 14: Hoare triple {325#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {329#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:06,227 INFO L280 TraceCheckUtils]: 15: Hoare triple {329#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {280#false} is VALID [2020-07-10 15:30:06,227 INFO L280 TraceCheckUtils]: 16: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-10 15:30:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:30:06,231 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978102355] [2020-07-10 15:30:06,231 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:06,231 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018095133] [2020-07-10 15:30:06,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:30:06,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-10 15:30:06,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011200128] [2020-07-10 15:30:06,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-10 15:30:06,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:06,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:30:06,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:06,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:30:06,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:06,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:30:06,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:30:06,274 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 6 states. [2020-07-10 15:30:18,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:18,849 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-10 15:30:18,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:30:18,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-10 15:30:18,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:30:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-07-10 15:30:18,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:30:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-07-10 15:30:18,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2020-07-10 15:30:20,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:20,988 INFO L225 Difference]: With dead ends: 32 [2020-07-10 15:30:20,988 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 15:30:20,990 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:30:20,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 15:30:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-10 15:30:21,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:21,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2020-07-10 15:30:21,027 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2020-07-10 15:30:21,028 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2020-07-10 15:30:21,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:21,031 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-10 15:30:21,031 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-10 15:30:21,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:21,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:21,032 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2020-07-10 15:30:21,033 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2020-07-10 15:30:21,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:21,036 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-10 15:30:21,036 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-10 15:30:21,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:21,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:21,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:21,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:21,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 15:30:21,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-10 15:30:21,040 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 17 [2020-07-10 15:30:21,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:21,041 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-10 15:30:21,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:30:21,041 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-10 15:30:21,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:30:21,042 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:21,042 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:21,243 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:30:21,244 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:21,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:21,246 INFO L82 PathProgramCache]: Analyzing trace with hash 325764102, now seen corresponding path program 1 times [2020-07-10 15:30:21,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:21,247 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98997311] [2020-07-10 15:30:21,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:21,255 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:21,256 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [783150749] [2020-07-10 15:30:21,256 INFO L94 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 [2020-07-10 15:30:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:21,286 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-10 15:30:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:21,310 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:21,411 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:30:21,503 INFO L263 TraceCheckUtils]: 0: Hoare triple {486#true} call ULTIMATE.init(); {486#true} is VALID [2020-07-10 15:30:21,503 INFO L280 TraceCheckUtils]: 1: Hoare triple {486#true} assume true; {486#true} is VALID [2020-07-10 15:30:21,504 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {486#true} {486#true} #46#return; {486#true} is VALID [2020-07-10 15:30:21,504 INFO L263 TraceCheckUtils]: 3: Hoare triple {486#true} call #t~ret2 := main(); {486#true} is VALID [2020-07-10 15:30:21,505 INFO L280 TraceCheckUtils]: 4: Hoare triple {486#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := 1;~c~0 := 1; {486#true} is VALID [2020-07-10 15:30:21,505 INFO L280 TraceCheckUtils]: 5: Hoare triple {486#true} assume !false; {486#true} is VALID [2020-07-10 15:30:21,505 INFO L263 TraceCheckUtils]: 6: Hoare triple {486#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {486#true} is VALID [2020-07-10 15:30:21,506 INFO L280 TraceCheckUtils]: 7: Hoare triple {486#true} ~cond := #in~cond; {486#true} is VALID [2020-07-10 15:30:21,506 INFO L280 TraceCheckUtils]: 8: Hoare triple {486#true} assume !(0 == ~cond); {486#true} is VALID [2020-07-10 15:30:21,507 INFO L280 TraceCheckUtils]: 9: Hoare triple {486#true} assume true; {486#true} is VALID [2020-07-10 15:30:21,507 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {486#true} {486#true} #50#return; {486#true} is VALID [2020-07-10 15:30:21,507 INFO L280 TraceCheckUtils]: 11: Hoare triple {486#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {486#true} is VALID [2020-07-10 15:30:21,508 INFO L280 TraceCheckUtils]: 12: Hoare triple {486#true} assume !false; {486#true} is VALID [2020-07-10 15:30:21,508 INFO L263 TraceCheckUtils]: 13: Hoare triple {486#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {486#true} is VALID [2020-07-10 15:30:21,510 INFO L280 TraceCheckUtils]: 14: Hoare triple {486#true} ~cond := #in~cond; {533#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:21,511 INFO L280 TraceCheckUtils]: 15: Hoare triple {533#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {537#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:30:21,514 INFO L280 TraceCheckUtils]: 16: Hoare triple {537#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {537#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:30:21,516 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {537#(not (= 0 |__VERIFIER_assert_#in~cond|))} {486#true} #50#return; {544#(= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0))} is VALID [2020-07-10 15:30:21,518 INFO L280 TraceCheckUtils]: 18: Hoare triple {544#(= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0))} assume !(~c~0 < ~k~0); {544#(= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0))} is VALID [2020-07-10 15:30:21,520 INFO L263 TraceCheckUtils]: 19: Hoare triple {544#(= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {551#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:30:21,522 INFO L280 TraceCheckUtils]: 20: Hoare triple {551#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {555#(= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:21,523 INFO L280 TraceCheckUtils]: 21: Hoare triple {555#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {487#false} is VALID [2020-07-10 15:30:21,524 INFO L280 TraceCheckUtils]: 22: Hoare triple {487#false} assume !false; {487#false} is VALID [2020-07-10 15:30:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-10 15:30:21,530 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98997311] [2020-07-10 15:30:21,530 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:21,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783150749] [2020-07-10 15:30:21,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:30:21,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-10 15:30:21,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964267693] [2020-07-10 15:30:21,535 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-10 15:30:21,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:21,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:30:21,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:21,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:30:21,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:21,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:30:21,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:30:21,587 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2020-07-10 15:30:26,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:26,453 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-10 15:30:26,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:30:26,454 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-10 15:30:26,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:26,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:30:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2020-07-10 15:30:26,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:30:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2020-07-10 15:30:26,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 24 transitions. [2020-07-10 15:30:26,515 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:26,517 INFO L225 Difference]: With dead ends: 34 [2020-07-10 15:30:26,517 INFO L226 Difference]: Without dead ends: 27 [2020-07-10 15:30:26,518 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:30:26,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-10 15:30:26,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-10 15:30:26,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:26,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-10 15:30:26,545 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-10 15:30:26,546 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-10 15:30:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:26,549 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-10 15:30:26,549 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-10 15:30:26,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:26,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:26,550 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-10 15:30:26,550 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-10 15:30:26,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:26,553 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-10 15:30:26,553 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-10 15:30:26,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:26,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:26,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:26,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 15:30:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-07-10 15:30:26,557 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2020-07-10 15:30:26,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:26,557 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-07-10 15:30:26,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:30:26,558 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-10 15:30:26,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:30:26,559 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:26,559 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:26,775 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:30:26,776 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:26,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:26,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1538749201, now seen corresponding path program 2 times [2020-07-10 15:30:26,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:26,778 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108821334] [2020-07-10 15:30:26,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:26,784 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:26,785 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [99850808] [2020-07-10 15:30:26,785 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-07-10 15:30:26,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:30:26,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:30:26,839 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-10 15:30:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-10 15:30:28,877 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:35,185 WARN L193 SmtUtils]: Spent 4.11 s on a formula simplification that was a NOOP. DAG size: 13 [2020-07-10 15:30:35,364 INFO L263 TraceCheckUtils]: 0: Hoare triple {708#true} call ULTIMATE.init(); {708#true} is VALID [2020-07-10 15:30:35,364 INFO L280 TraceCheckUtils]: 1: Hoare triple {708#true} assume true; {708#true} is VALID [2020-07-10 15:30:35,365 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {708#true} {708#true} #46#return; {708#true} is VALID [2020-07-10 15:30:35,365 INFO L263 TraceCheckUtils]: 3: Hoare triple {708#true} call #t~ret2 := main(); {708#true} is VALID [2020-07-10 15:30:35,366 INFO L280 TraceCheckUtils]: 4: Hoare triple {708#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := 1;~c~0 := 1; {725#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-10 15:30:35,367 INFO L280 TraceCheckUtils]: 5: Hoare triple {725#(and (= 1 main_~x~0) (= 1 main_~y~0))} assume !false; {725#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-10 15:30:35,368 INFO L263 TraceCheckUtils]: 6: Hoare triple {725#(and (= 1 main_~x~0) (= 1 main_~y~0))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {708#true} is VALID [2020-07-10 15:30:35,368 INFO L280 TraceCheckUtils]: 7: Hoare triple {708#true} ~cond := #in~cond; {708#true} is VALID [2020-07-10 15:30:35,368 INFO L280 TraceCheckUtils]: 8: Hoare triple {708#true} assume !(0 == ~cond); {708#true} is VALID [2020-07-10 15:30:35,368 INFO L280 TraceCheckUtils]: 9: Hoare triple {708#true} assume true; {708#true} is VALID [2020-07-10 15:30:35,369 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {708#true} {725#(and (= 1 main_~x~0) (= 1 main_~y~0))} #50#return; {725#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-10 15:30:35,378 INFO L280 TraceCheckUtils]: 11: Hoare triple {725#(and (= 1 main_~x~0) (= 1 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {747#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} is VALID [2020-07-10 15:30:35,379 INFO L280 TraceCheckUtils]: 12: Hoare triple {747#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} assume !false; {747#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} is VALID [2020-07-10 15:30:35,380 INFO L263 TraceCheckUtils]: 13: Hoare triple {747#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {708#true} is VALID [2020-07-10 15:30:35,381 INFO L280 TraceCheckUtils]: 14: Hoare triple {708#true} ~cond := #in~cond; {757#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:35,382 INFO L280 TraceCheckUtils]: 15: Hoare triple {757#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {761#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:30:35,388 INFO L280 TraceCheckUtils]: 16: Hoare triple {761#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {761#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:30:35,390 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {761#(not (= 0 |__VERIFIER_assert_#in~cond|))} {747#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} #50#return; {768#(and (= main_~x~0 (+ main_~z~0 1)) (= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0)) (= main_~z~0 main_~y~0))} is VALID [2020-07-10 15:30:35,402 INFO L280 TraceCheckUtils]: 18: Hoare triple {768#(and (= main_~x~0 (+ main_~z~0 1)) (= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0)) (= main_~z~0 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {772#(and (= (+ main_~z~0 (* main_~z~0 main_~z~0) 1) main_~x~0) (= main_~y~0 (* main_~z~0 main_~z~0)))} is VALID [2020-07-10 15:30:35,403 INFO L280 TraceCheckUtils]: 19: Hoare triple {772#(and (= (+ main_~z~0 (* main_~z~0 main_~z~0) 1) main_~x~0) (= main_~y~0 (* main_~z~0 main_~z~0)))} assume !false; {772#(and (= (+ main_~z~0 (* main_~z~0 main_~z~0) 1) main_~x~0) (= main_~y~0 (* main_~z~0 main_~z~0)))} is VALID [2020-07-10 15:30:37,430 INFO L263 TraceCheckUtils]: 20: Hoare triple {772#(and (= (+ main_~z~0 (* main_~z~0 main_~z~0) 1) main_~x~0) (= main_~y~0 (* main_~z~0 main_~z~0)))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {779#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2020-07-10 15:30:37,431 INFO L280 TraceCheckUtils]: 21: Hoare triple {779#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {783#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:37,432 INFO L280 TraceCheckUtils]: 22: Hoare triple {783#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {709#false} is VALID [2020-07-10 15:30:37,432 INFO L280 TraceCheckUtils]: 23: Hoare triple {709#false} assume !false; {709#false} is VALID [2020-07-10 15:30:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:30:37,434 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108821334] [2020-07-10 15:30:37,434 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:37,435 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99850808] [2020-07-10 15:30:37,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:30:37,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-10 15:30:37,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919460681] [2020-07-10 15:30:37,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-10 15:30:37,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:37,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:30:39,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:39,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:30:39,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:39,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:30:39,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2020-07-10 15:30:39,544 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 10 states. [2020-07-10 15:31:38,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:31:38,993 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2020-07-10 15:31:38,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:31:38,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-10 15:31:38,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:31:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:31:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2020-07-10 15:31:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:31:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2020-07-10 15:31:39,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 31 transitions. [2020-07-10 15:31:41,270 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-10 15:31:41,273 INFO L225 Difference]: With dead ends: 37 [2020-07-10 15:31:41,273 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 15:31:41,274 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=30, Invalid=101, Unknown=1, NotChecked=0, Total=132 [2020-07-10 15:31:41,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 15:31:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-07-10 15:31:41,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:31:41,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2020-07-10 15:31:41,320 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2020-07-10 15:31:41,321 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2020-07-10 15:31:41,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:31:41,324 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-10 15:31:41,324 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-10 15:31:41,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:31:41,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:31:41,325 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2020-07-10 15:31:41,325 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2020-07-10 15:31:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:31:41,328 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-10 15:31:41,329 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-10 15:31:41,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:31:41,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:31:41,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:31:41,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:31:41,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-10 15:31:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2020-07-10 15:31:41,332 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2020-07-10 15:31:41,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:31:41,333 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2020-07-10 15:31:41,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:31:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-10 15:31:41,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 15:31:41,334 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:31:41,335 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:31:41,540 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:31:41,541 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:31:41,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:31:41,542 INFO L82 PathProgramCache]: Analyzing trace with hash -695576914, now seen corresponding path program 3 times [2020-07-10 15:31:41,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:31:41,543 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851790208] [2020-07-10 15:31:41,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:31:41,551 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:31:41,551 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1905326784] [2020-07-10 15:31:41,551 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/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 [2020-07-10 15:31:41,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-10 15:31:41,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:31:41,601 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-10 15:31:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-10 15:31:43,675 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:31:48,385 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:31:57,984 WARN L838 $PredicateComparison]: unable to prove that (or (and (<= 0 |c___VERIFIER_assert_#in~cond|) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13))) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) .cse0) (+ v_main_~z~0_BEFORE_CALL_6 (* v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ .cse0 1)))))) (<= 1 |c___VERIFIER_assert_#in~cond|)) is different from false [2020-07-10 15:31:58,002 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:32:06,265 WARN L838 $PredicateComparison]: unable to prove that (or (<= 1 c___VERIFIER_assert_~cond) (and (<= 0 c___VERIFIER_assert_~cond) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13))) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) .cse0) (+ v_main_~z~0_BEFORE_CALL_6 (* v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ .cse0 1))))))) is different from false [2020-07-10 15:32:08,316 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:32:16,601 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13))) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) .cse0) (+ v_main_~z~0_BEFORE_CALL_6 (* v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ .cse0 1))))) is different from false [2020-07-10 15:32:18,629 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13))) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) .cse0) (+ v_main_~z~0_BEFORE_CALL_6 (* v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ .cse0 1))))) is different from true [2020-07-10 15:32:18,630 INFO L263 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {966#true} is VALID [2020-07-10 15:32:18,631 INFO L280 TraceCheckUtils]: 1: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-10 15:32:18,631 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {966#true} {966#true} #46#return; {966#true} is VALID [2020-07-10 15:32:18,631 INFO L263 TraceCheckUtils]: 3: Hoare triple {966#true} call #t~ret2 := main(); {966#true} is VALID [2020-07-10 15:32:18,632 INFO L280 TraceCheckUtils]: 4: Hoare triple {966#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := 1;~c~0 := 1; {966#true} is VALID [2020-07-10 15:32:18,632 INFO L280 TraceCheckUtils]: 5: Hoare triple {966#true} assume !false; {966#true} is VALID [2020-07-10 15:32:18,632 INFO L263 TraceCheckUtils]: 6: Hoare triple {966#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {966#true} is VALID [2020-07-10 15:32:18,633 INFO L280 TraceCheckUtils]: 7: Hoare triple {966#true} ~cond := #in~cond; {966#true} is VALID [2020-07-10 15:32:18,633 INFO L280 TraceCheckUtils]: 8: Hoare triple {966#true} assume !(0 == ~cond); {966#true} is VALID [2020-07-10 15:32:18,633 INFO L280 TraceCheckUtils]: 9: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-10 15:32:18,634 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {966#true} {966#true} #50#return; {966#true} is VALID [2020-07-10 15:32:18,634 INFO L280 TraceCheckUtils]: 11: Hoare triple {966#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {966#true} is VALID [2020-07-10 15:32:18,634 INFO L280 TraceCheckUtils]: 12: Hoare triple {966#true} assume !false; {966#true} is VALID [2020-07-10 15:32:18,636 INFO L263 TraceCheckUtils]: 13: Hoare triple {966#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {966#true} is VALID [2020-07-10 15:32:18,636 INFO L280 TraceCheckUtils]: 14: Hoare triple {966#true} ~cond := #in~cond; {966#true} is VALID [2020-07-10 15:32:18,636 INFO L280 TraceCheckUtils]: 15: Hoare triple {966#true} assume !(0 == ~cond); {966#true} is VALID [2020-07-10 15:32:18,637 INFO L280 TraceCheckUtils]: 16: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-10 15:32:18,637 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {966#true} {966#true} #50#return; {966#true} is VALID [2020-07-10 15:32:18,637 INFO L280 TraceCheckUtils]: 18: Hoare triple {966#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {966#true} is VALID [2020-07-10 15:32:18,637 INFO L280 TraceCheckUtils]: 19: Hoare triple {966#true} assume !false; {966#true} is VALID [2020-07-10 15:32:18,642 INFO L263 TraceCheckUtils]: 20: Hoare triple {966#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {966#true} is VALID [2020-07-10 15:32:18,644 INFO L280 TraceCheckUtils]: 21: Hoare triple {966#true} ~cond := #in~cond; {1034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:32:18,645 INFO L280 TraceCheckUtils]: 22: Hoare triple {1034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1038#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:32:18,646 INFO L280 TraceCheckUtils]: 23: Hoare triple {1038#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {1038#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:32:18,648 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1038#(not (= 0 |__VERIFIER_assert_#in~cond|))} {966#true} #50#return; {1045#(= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0))} is VALID [2020-07-10 15:32:18,804 INFO L280 TraceCheckUtils]: 25: Hoare triple {1045#(= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {1049#(exists ((v_main_~y~0_13 Int) (v_main_~x~0_13 Int)) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_13) 1)) (= (+ (* main_~z~0 v_main_~x~0_13) 1) (+ (* main_~z~0 v_main_~y~0_13) v_main_~x~0_13))))} is VALID [2020-07-10 15:32:18,806 INFO L280 TraceCheckUtils]: 26: Hoare triple {1049#(exists ((v_main_~y~0_13 Int) (v_main_~x~0_13 Int)) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_13) 1)) (= (+ (* main_~z~0 v_main_~x~0_13) 1) (+ (* main_~z~0 v_main_~y~0_13) v_main_~x~0_13))))} assume !false; {1049#(exists ((v_main_~y~0_13 Int) (v_main_~x~0_13 Int)) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_13) 1)) (= (+ (* main_~z~0 v_main_~x~0_13) 1) (+ (* main_~z~0 v_main_~y~0_13) v_main_~x~0_13))))} is VALID [2020-07-10 15:32:20,859 INFO L263 TraceCheckUtils]: 27: Hoare triple {1049#(exists ((v_main_~y~0_13 Int) (v_main_~x~0_13 Int)) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_13) 1)) (= (+ (* main_~z~0 v_main_~x~0_13) 1) (+ (* main_~z~0 v_main_~y~0_13) v_main_~x~0_13))))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {1056#(or (and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)) (+ v_main_~z~0_BEFORE_CALL_6 (* v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13) 1))))) (<= 1 |__VERIFIER_assert_#in~cond|))} is UNKNOWN [2020-07-10 15:32:20,862 INFO L280 TraceCheckUtils]: 28: Hoare triple {1056#(or (and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)) (+ v_main_~z~0_BEFORE_CALL_6 (* v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13) 1))))) (<= 1 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1060#(or (<= 1 __VERIFIER_assert_~cond) (and (<= 0 __VERIFIER_assert_~cond) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)) (+ v_main_~z~0_BEFORE_CALL_6 (* v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13) 1))))))} is VALID [2020-07-10 15:32:20,863 INFO L280 TraceCheckUtils]: 29: Hoare triple {1060#(or (<= 1 __VERIFIER_assert_~cond) (and (<= 0 __VERIFIER_assert_~cond) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)) (+ v_main_~z~0_BEFORE_CALL_6 (* v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13) 1))))))} assume 0 == ~cond; {1064#(exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)) (+ v_main_~z~0_BEFORE_CALL_6 (* v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13) 1))))} is VALID [2020-07-10 15:32:22,891 INFO L280 TraceCheckUtils]: 30: Hoare triple {1064#(exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)) (+ v_main_~z~0_BEFORE_CALL_6 (* v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13) 1))))} assume !false; {967#false} is UNKNOWN [2020-07-10 15:32:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 1 not checked. [2020-07-10 15:32:22,895 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851790208] [2020-07-10 15:32:22,895 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:32:22,895 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905326784] [2020-07-10 15:32:22,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:32:22,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-10 15:32:22,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485970306] [2020-07-10 15:32:22,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2020-07-10 15:32:22,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:32:22,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:32:31,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 18 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2020-07-10 15:32:31,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:32:31,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:32:31,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:32:31,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=22, Unknown=5, NotChecked=30, Total=72 [2020-07-10 15:32:31,467 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 9 states. [2020-07-10 15:33:34,911 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= 1 c___VERIFIER_assert_~cond) (and (<= 0 c___VERIFIER_assert_~cond) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13))) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) .cse0) (+ v_main_~z~0_BEFORE_CALL_6 (* v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ .cse0 1))))))) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond)) is different from false [2020-07-10 15:33:47,915 WARN L193 SmtUtils]: Spent 2.74 s on a formula simplification that was a NOOP. DAG size: 21 [2020-07-10 15:34:03,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:34:03,981 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-10 15:34:03,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:34:03,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2020-07-10 15:34:03,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:34:03,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:34:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2020-07-10 15:34:03,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:34:03,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2020-07-10 15:34:03,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 21 transitions. [2020-07-10 15:34:16,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 15 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2020-07-10 15:34:16,388 INFO L225 Difference]: With dead ends: 34 [2020-07-10 15:34:16,388 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:34:16,389 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=25, Invalid=40, Unknown=7, NotChecked=60, Total=132 [2020-07-10 15:34:16,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:34:16,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:34:16,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:34:16,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:34:16,390 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:34:16,390 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:34:16,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:34:16,390 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:34:16,391 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:34:16,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:34:16,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:34:16,391 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:34:16,391 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:34:16,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:34:16,391 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:34:16,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:34:16,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:34:16,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:34:16,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:34:16,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:34:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:34:16,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:34:16,392 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2020-07-10 15:34:16,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:34:16,393 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:34:16,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:34:16,393 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:34:16,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:34:16,594 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-10 15:34:16,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:34:16,926 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2020-07-10 15:34:21,725 WARN L193 SmtUtils]: Spent 4.79 s on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2020-07-10 15:34:25,827 WARN L193 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 30 DAG size of output: 1 [2020-07-10 15:34:31,069 WARN L193 SmtUtils]: Spent 5.24 s on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2020-07-10 15:34:31,075 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:34:31,076 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:34:31,076 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:34:31,076 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:34:31,076 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:34:31,076 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:34:31,076 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 9 11) no Hoare annotation was computed. [2020-07-10 15:34:31,076 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-10 15:34:31,076 INFO L268 CegarLoopResult]: For program point L10-2(lines 9 11) no Hoare annotation was computed. [2020-07-10 15:34:31,076 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 9 11) no Hoare annotation was computed. [2020-07-10 15:34:31,077 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (or (and (= 1 main_~x~0) (= 1 main_~y~0)) (exists ((v_main_~y~0_13 Int) (v_main_~x~0_13 Int)) (let ((.cse1 (+ (* main_~z~0 v_main_~x~0_13) 1)) (.cse0 (* main_~z~0 v_main_~y~0_13))) (and (= main_~y~0 .cse0) (= .cse1 main_~x~0) (= .cse1 (+ .cse0 v_main_~x~0_13)))))) [2020-07-10 15:34:31,077 INFO L268 CegarLoopResult]: For program point L32-1(lines 31 40) no Hoare annotation was computed. [2020-07-10 15:34:31,077 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 21 43) the Hoare annotation is: true [2020-07-10 15:34:31,077 INFO L264 CegarLoopResult]: At program point L31-2(lines 31 40) the Hoare annotation is: (or (and (= 1 main_~x~0) (= 1 main_~y~0)) (exists ((v_main_~y~0_13 Int) (v_main_~x~0_13 Int)) (let ((.cse1 (+ (* main_~z~0 v_main_~x~0_13) 1)) (.cse0 (* main_~z~0 v_main_~y~0_13))) (and (= main_~y~0 .cse0) (= .cse1 main_~x~0) (= .cse1 (+ .cse0 v_main_~x~0_13)))))) [2020-07-10 15:34:31,077 INFO L264 CegarLoopResult]: At program point L31-3(lines 31 40) the Hoare annotation is: (= (+ (* main_~x~0 main_~z~0) 1) (+ main_~x~0 (* main_~y~0 main_~z~0))) [2020-07-10 15:34:31,077 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 21 43) no Hoare annotation was computed. [2020-07-10 15:34:31,077 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 21 43) no Hoare annotation was computed. [2020-07-10 15:34:31,078 INFO L268 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2020-07-10 15:34:31,078 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 12 18) the Hoare annotation is: true [2020-07-10 15:34:31,078 INFO L268 CegarLoopResult]: For program point L14(lines 14 15) no Hoare annotation was computed. [2020-07-10 15:34:31,078 INFO L268 CegarLoopResult]: For program point L13(lines 13 16) no Hoare annotation was computed. [2020-07-10 15:34:31,078 INFO L268 CegarLoopResult]: For program point L13-2(lines 12 18) no Hoare annotation was computed. [2020-07-10 15:34:31,078 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 12 18) no Hoare annotation was computed. [2020-07-10 15:34:31,078 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2020-07-10 15:34:31,084 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:34:31,084 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:34:31,087 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:34:31,087 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:34:31,087 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:34:31,087 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-10 15:34:31,087 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-10 15:34:31,090 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:34:31,091 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:34:31,091 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:34:31,091 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2020-07-10 15:34:31,091 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 15:34:31,091 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-10 15:34:31,091 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 15:34:31,091 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 15:34:31,091 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-10 15:34:31,092 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 15:34:31,092 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-10 15:34:31,092 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-10 15:34:31,092 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:34:31,092 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:34:31,092 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:34:31,092 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:34:31,093 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:34:31,100 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-10 15:34:31,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-10 15:34:31,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-10 15:34:31,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-10 15:34:31,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-10 15:34:31,107 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-10 15:34:31,108 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-10 15:34:31,108 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-10 15:34:31,108 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-10 15:34:31,108 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-10 15:34:31,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:34:31 BoogieIcfgContainer [2020-07-10 15:34:31,111 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:34:31,114 INFO L168 Benchmark]: Toolchain (without parser) took 267767.61 ms. Allocated memory was 145.2 MB in the beginning and 269.5 MB in the end (delta: 124.3 MB). Free memory was 103.2 MB in the beginning and 228.7 MB in the end (delta: -125.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:34:31,115 INFO L168 Benchmark]: CDTParser took 0.67 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:34:31,115 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.88 ms. Allocated memory is still 145.2 MB. Free memory was 103.0 MB in the beginning and 93.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:34:31,116 INFO L168 Benchmark]: Boogie Preprocessor took 137.29 ms. Allocated memory was 145.2 MB in the beginning and 201.3 MB in the end (delta: 56.1 MB). Free memory was 93.1 MB in the beginning and 181.0 MB in the end (delta: -87.9 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:34:31,117 INFO L168 Benchmark]: RCFGBuilder took 380.37 ms. Allocated memory is still 201.3 MB. Free memory was 181.0 MB in the beginning and 164.3 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:34:31,118 INFO L168 Benchmark]: TraceAbstraction took 266916.95 ms. Allocated memory was 201.3 MB in the beginning and 269.5 MB in the end (delta: 68.2 MB). Free memory was 163.6 MB in the beginning and 228.7 MB in the end (delta: -65.1 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:34:31,122 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.67 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 326.88 ms. Allocated memory is still 145.2 MB. Free memory was 103.0 MB in the beginning and 93.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 137.29 ms. Allocated memory was 145.2 MB in the beginning and 201.3 MB in the end (delta: 56.1 MB). Free memory was 93.1 MB in the beginning and 181.0 MB in the end (delta: -87.9 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 380.37 ms. Allocated memory is still 201.3 MB. Free memory was 181.0 MB in the beginning and 164.3 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 266916.95 ms. Allocated memory was 201.3 MB in the beginning and 269.5 MB in the end (delta: 68.2 MB). Free memory was 163.6 MB in the beginning and 228.7 MB in the end (delta: -65.1 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant [2020-07-10 15:34:31,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-10 15:34:31,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-10 15:34:31,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-10 15:34:31,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-10 15:34:31,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-10 15:34:31,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-10 15:34:31,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-10 15:34:31,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-10 15:34:31,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-10 15:34:31,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] Derived loop invariant: (1 == x && 1 == y) || (\exists v_main_~y~0_13 : int, v_main_~x~0_13 : int :: (y == z * v_main_~y~0_13 && z * v_main_~x~0_13 + 1 == x) && z * v_main_~x~0_13 + 1 == z * v_main_~y~0_13 + v_main_~x~0_13) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 252.3s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 186.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 83 SDtfs, 40 SDslu, 250 SDs, 0 SdLazy, 174 SolverSat, 9 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 33.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 29.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 15 PreInvPairs, 25 NumberOfFragments, 82 HoareAnnotationTreeSize, 15 FomulaSimplifications, 222 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 105 FormulaSimplificationTreeSizeReductionInter, 12.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 52.6s InterpolantComputationTime, 115 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 109 ConstructedInterpolants, 5 QuantifiedInterpolants, 10860 SizeOfPredicates, 13 NumberOfNonLiveVariables, 265 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 51/63 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! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...