/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/ps2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:30:02,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:30:02,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:30:02,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:30:02,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:30:02,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:30:02,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:30:02,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:30:02,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:30:02,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:30:02,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:30:02,771 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:30:02,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:30:02,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:30:02,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:30:02,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:30:02,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:30:02,784 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:30:02,785 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:30:02,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:30:02,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:30:02,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:30:02,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:30:02,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:30:02,808 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:30:02,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:30:02,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:30:02,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:30:02,813 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:30:02,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:30:02,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:30:02,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:30:02,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:30:02,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:30:02,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:30:02,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:30:02,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:30:02,821 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:30:02,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:30:02,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:30:02,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:30:02,824 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:02,863 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:30:02,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:30:02,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:30:02,866 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:30:02,866 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:30:02,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:30:02,866 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:30:02,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:30:02,867 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:30:02,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:30:02,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:30:02,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:30:02,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:30:02,870 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:30:02,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:30:02,871 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:30:02,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:30:02,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:30:02,871 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:30:02,872 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:30:02,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:30:02,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:30:02,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:30:02,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:30:02,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:30:02,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:30:02,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:30:02,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:30:02,875 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:30:02,875 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:30:03,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:30:03,219 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:30:03,223 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:30:03,225 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:30:03,225 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:30:03,226 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/ps2.c [2020-07-10 15:30:03,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/104a4158f/60ee095af3594a1a9467c3c91540be6f/FLAG411899e93 [2020-07-10 15:30:03,819 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:30:03,820 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/ps2.c [2020-07-10 15:30:03,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/104a4158f/60ee095af3594a1a9467c3c91540be6f/FLAG411899e93 [2020-07-10 15:30:04,179 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/104a4158f/60ee095af3594a1a9467c3c91540be6f [2020-07-10 15:30:04,190 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:30:04,192 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:30:04,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:30:04,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:30:04,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:30:04,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:30:04" (1/1) ... [2020-07-10 15:30:04,205 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:04, skipping insertion in model container [2020-07-10 15:30:04,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:30:04" (1/1) ... [2020-07-10 15:30:04,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:30:04,244 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:30:04,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:30:04,437 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:30:04,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:30:04,475 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:30:04,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:04 WrapperNode [2020-07-10 15:30:04,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:30:04,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:30:04,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:30:04,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:30:04,492 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:04" (1/1) ... [2020-07-10 15:30:04,492 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:04" (1/1) ... [2020-07-10 15:30:04,499 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:04" (1/1) ... [2020-07-10 15:30:04,500 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:04" (1/1) ... [2020-07-10 15:30:04,506 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:04" (1/1) ... [2020-07-10 15:30:04,513 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:04" (1/1) ... [2020-07-10 15:30:04,514 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:04" (1/1) ... [2020-07-10 15:30:04,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:30:04,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:30:04,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:30:04,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:30:04,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:04" (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:04,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:30:04,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:30:04,677 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:30:04,677 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:30:04,677 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:30:04,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:30:04,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:30:04,679 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:30:04,679 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:30:04,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:30:04,679 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:30:04,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:30:04,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:30:04,977 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:30:04,978 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:30:04,983 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,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:30:04,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:30:04,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:30:04,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:30:04,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:30:04" (1/3) ... [2020-07-10 15:30:04,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a46ab71 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,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:04" (2/3) ... [2020-07-10 15:30:04,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a46ab71 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,992 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,994 INFO L109 eAbstractionObserver]: Analyzing ICFG ps2.c [2020-07-10 15:30:05,009 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:30:05,018 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:30:05,035 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:30:05,067 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:30:05,068 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:30:05,068 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:30:05,068 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:30:05,068 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:30:05,068 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:30:05,069 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:30:05,072 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:30:05,107 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-10 15:30:05,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-10 15:30:05,115 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:05,117 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:05,117 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:05,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:05,123 INFO L82 PathProgramCache]: Analyzing trace with hash -64610451, now seen corresponding path program 1 times [2020-07-10 15:30:05,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:05,133 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829336614] [2020-07-10 15:30:05,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:05,272 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-10 15:30:05,273 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2020-07-10 15:30:05,275 INFO L263 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2020-07-10 15:30:05,276 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-10 15:30:05,276 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2020-07-10 15:30:05,276 INFO L263 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret1 := main(); {23#true} is VALID [2020-07-10 15:30:05,277 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;~y~0 := 0;~x~0 := 0;~c~0 := 0; {23#true} is VALID [2020-07-10 15:30:05,279 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#true} assume false; {24#false} is VALID [2020-07-10 15:30:05,279 INFO L263 TraceCheckUtils]: 6: Hoare triple {24#false} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {24#false} is VALID [2020-07-10 15:30:05,279 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2020-07-10 15:30:05,280 INFO L280 TraceCheckUtils]: 8: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2020-07-10 15:30:05,280 INFO L280 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-10 15:30:05,281 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,282 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829336614] [2020-07-10 15:30:05,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:30:05,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 15:30:05,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204933749] [2020-07-10 15:30:05,290 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-10 15:30:05,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:05,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 15:30:05,335 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,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 15:30:05,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:05,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 15:30:05,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:30:05,348 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-10 15:30:05,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:05,435 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2020-07-10 15:30:05,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 15:30:05,435 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-10 15:30:05,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:05,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:30:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-10 15:30:05,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:30:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-10 15:30:05,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 45 transitions. [2020-07-10 15:30:05,546 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:05,558 INFO L225 Difference]: With dead ends: 35 [2020-07-10 15:30:05,558 INFO L226 Difference]: Without dead ends: 15 [2020-07-10 15:30:05,563 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:05,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-10 15:30:05,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-10 15:30:05,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:05,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-10 15:30:05,611 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-10 15:30:05,612 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-10 15:30:05,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:05,617 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-10 15:30:05,617 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-10 15:30:05,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:05,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:05,618 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-10 15:30:05,619 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-10 15:30:05,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:05,623 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-10 15:30:05,623 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-10 15:30:05,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:05,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:05,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:05,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:30:05,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-10 15:30:05,629 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2020-07-10 15:30:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:05,629 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-10 15:30:05,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 15:30:05,630 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-10 15:30:05,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-10 15:30:05,631 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:05,631 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:05,631 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:30:05,632 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:05,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:05,632 INFO L82 PathProgramCache]: Analyzing trace with hash -62822991, now seen corresponding path program 1 times [2020-07-10 15:30:05,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:05,633 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413790087] [2020-07-10 15:30:05,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:05,643 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:05,643 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [492845736] [2020-07-10 15:30:05,643 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,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:05,678 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 15:30:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:05,694 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:05,813 INFO L263 TraceCheckUtils]: 0: Hoare triple {129#true} call ULTIMATE.init(); {129#true} is VALID [2020-07-10 15:30:05,814 INFO L280 TraceCheckUtils]: 1: Hoare triple {129#true} assume true; {129#true} is VALID [2020-07-10 15:30:05,814 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {129#true} {129#true} #46#return; {129#true} is VALID [2020-07-10 15:30:05,814 INFO L263 TraceCheckUtils]: 3: Hoare triple {129#true} call #t~ret1 := main(); {129#true} is VALID [2020-07-10 15:30:05,816 INFO L280 TraceCheckUtils]: 4: Hoare triple {129#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;~y~0 := 0;~x~0 := 0;~c~0 := 0; {146#(and (= 0 main_~x~0) (= 0 main_~y~0))} is VALID [2020-07-10 15:30:05,818 INFO L280 TraceCheckUtils]: 5: Hoare triple {146#(and (= 0 main_~x~0) (= 0 main_~y~0))} assume !false; {146#(and (= 0 main_~x~0) (= 0 main_~y~0))} is VALID [2020-07-10 15:30:05,820 INFO L263 TraceCheckUtils]: 6: Hoare triple {146#(and (= 0 main_~x~0) (= 0 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {153#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:30:05,821 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,822 INFO L280 TraceCheckUtils]: 8: Hoare triple {157#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {130#false} is VALID [2020-07-10 15:30:05,823 INFO L280 TraceCheckUtils]: 9: Hoare triple {130#false} assume !false; {130#false} is VALID [2020-07-10 15:30:05,824 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,824 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413790087] [2020-07-10 15:30:05,825 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:05,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492845736] [2020-07-10 15:30:05,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:30:05,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:30:05,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816635205] [2020-07-10 15:30:05,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-10 15:30:05,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:05,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:30:05,847 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,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:30:05,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:05,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:30:05,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:30:05,849 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2020-07-10 15:30:06,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:06,004 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-10 15:30:06,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:30:06,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-10 15:30:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:30:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-10 15:30:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:30:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-10 15:30:06,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2020-07-10 15:30:06,070 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:06,072 INFO L225 Difference]: With dead ends: 25 [2020-07-10 15:30:06,072 INFO L226 Difference]: Without dead ends: 22 [2020-07-10 15:30:06,074 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:06,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-10 15:30:06,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-10 15:30:06,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:06,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-10 15:30:06,087 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-10 15:30:06,088 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-10 15:30:06,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:06,090 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-10 15:30:06,091 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-10 15:30:06,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:06,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:06,092 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-10 15:30:06,092 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-10 15:30:06,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:06,095 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-10 15:30:06,095 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-10 15:30:06,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:06,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:06,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:06,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:06,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-10 15:30:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-10 15:30:06,098 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 10 [2020-07-10 15:30:06,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:06,099 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-10 15:30:06,099 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:30:06,099 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-10 15:30:06,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:30:06,100 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:06,100 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:06,314 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:30:06,315 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:06,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:06,316 INFO L82 PathProgramCache]: Analyzing trace with hash 50868238, now seen corresponding path program 1 times [2020-07-10 15:30:06,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:06,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994052573] [2020-07-10 15:30:06,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:06,323 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:06,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [184948553] [2020-07-10 15:30:06,324 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,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:06,354 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-10 15:30:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:06,362 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:06,474 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-10 15:30:06,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-10 15:30:06,475 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #46#return; {279#true} is VALID [2020-07-10 15:30:06,475 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret1 := main(); {279#true} is VALID [2020-07-10 15:30:06,476 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;~y~0 := 0;~x~0 := 0;~c~0 := 0; {296#(and (= 0 main_~x~0) (= 0 main_~y~0))} is VALID [2020-07-10 15:30:06,478 INFO L280 TraceCheckUtils]: 5: Hoare triple {296#(and (= 0 main_~x~0) (= 0 main_~y~0))} assume !false; {296#(and (= 0 main_~x~0) (= 0 main_~y~0))} is VALID [2020-07-10 15:30:06,478 INFO L263 TraceCheckUtils]: 6: Hoare triple {296#(and (= 0 main_~x~0) (= 0 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {279#true} is VALID [2020-07-10 15:30:06,478 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} ~cond := #in~cond; {279#true} is VALID [2020-07-10 15:30:06,479 INFO L280 TraceCheckUtils]: 8: Hoare triple {279#true} assume !(0 == ~cond); {279#true} is VALID [2020-07-10 15:30:06,479 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-10 15:30:06,480 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {279#true} {296#(and (= 0 main_~x~0) (= 0 main_~y~0))} #50#return; {296#(and (= 0 main_~x~0) (= 0 main_~y~0))} is VALID [2020-07-10 15:30:06,482 INFO L280 TraceCheckUtils]: 11: Hoare triple {296#(and (= 0 main_~x~0) (= 0 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 + ~x~0; {318#(and (= 1 main_~y~0) (= main_~y~0 main_~x~0))} is VALID [2020-07-10 15:30:06,483 INFO L280 TraceCheckUtils]: 12: Hoare triple {318#(and (= 1 main_~y~0) (= main_~y~0 main_~x~0))} assume !false; {318#(and (= 1 main_~y~0) (= main_~y~0 main_~x~0))} is VALID [2020-07-10 15:30:06,485 INFO L263 TraceCheckUtils]: 13: Hoare triple {318#(and (= 1 main_~y~0) (= main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {325#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:30:06,486 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,487 INFO L280 TraceCheckUtils]: 15: Hoare triple {329#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {280#false} is VALID [2020-07-10 15:30:06,487 INFO L280 TraceCheckUtils]: 16: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-10 15:30:06,489 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,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994052573] [2020-07-10 15:30:06,490 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:06,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184948553] [2020-07-10 15:30:06,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:30:06,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-10 15:30:06,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117847182] [2020-07-10 15:30:06,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-10 15:30:06,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:06,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:30:06,518 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,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:30:06,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:06,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:30:06,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:30:06,521 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 6 states. [2020-07-10 15:30:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:06,738 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-10 15:30:06,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:30:06,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-10 15:30:06,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:06,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:30:06,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-07-10 15:30:06,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:30:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-07-10 15:30:06,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2020-07-10 15:30:06,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:06,794 INFO L225 Difference]: With dead ends: 32 [2020-07-10 15:30:06,795 INFO L226 Difference]: Without dead ends: 29 [2020-07-10 15:30:06,796 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:06,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-10 15:30:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-10 15:30:06,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:06,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-10 15:30:06,815 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-10 15:30:06,815 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-10 15:30:06,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:06,818 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-10 15:30:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-10 15:30:06,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:06,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:06,819 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-10 15:30:06,819 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-10 15:30:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:06,822 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-10 15:30:06,823 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-10 15:30:06,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:06,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:06,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:06,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:06,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 15:30:06,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2020-07-10 15:30:06,827 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 17 [2020-07-10 15:30:06,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:06,827 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-07-10 15:30:06,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:30:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-10 15:30:06,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:30:06,829 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:06,829 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:07,042 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:30:07,043 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:07,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:07,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1538749201, now seen corresponding path program 2 times [2020-07-10 15:30:07,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:07,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683481347] [2020-07-10 15:30:07,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:07,051 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:07,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1459028502] [2020-07-10 15:30:07,051 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-10 15:30:07,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:30:07,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:30:07,086 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-10 15:30:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:07,096 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:07,289 INFO L263 TraceCheckUtils]: 0: Hoare triple {485#true} call ULTIMATE.init(); {485#true} is VALID [2020-07-10 15:30:07,290 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-10 15:30:07,290 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {485#true} {485#true} #46#return; {485#true} is VALID [2020-07-10 15:30:07,291 INFO L263 TraceCheckUtils]: 3: Hoare triple {485#true} call #t~ret1 := main(); {485#true} is VALID [2020-07-10 15:30:07,292 INFO L280 TraceCheckUtils]: 4: Hoare triple {485#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;~y~0 := 0;~x~0 := 0;~c~0 := 0; {502#(and (= 0 main_~x~0) (= 0 main_~y~0))} is VALID [2020-07-10 15:30:07,293 INFO L280 TraceCheckUtils]: 5: Hoare triple {502#(and (= 0 main_~x~0) (= 0 main_~y~0))} assume !false; {502#(and (= 0 main_~x~0) (= 0 main_~y~0))} is VALID [2020-07-10 15:30:07,294 INFO L263 TraceCheckUtils]: 6: Hoare triple {502#(and (= 0 main_~x~0) (= 0 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {485#true} is VALID [2020-07-10 15:30:07,294 INFO L280 TraceCheckUtils]: 7: Hoare triple {485#true} ~cond := #in~cond; {485#true} is VALID [2020-07-10 15:30:07,294 INFO L280 TraceCheckUtils]: 8: Hoare triple {485#true} assume !(0 == ~cond); {485#true} is VALID [2020-07-10 15:30:07,295 INFO L280 TraceCheckUtils]: 9: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-10 15:30:07,297 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {485#true} {502#(and (= 0 main_~x~0) (= 0 main_~y~0))} #50#return; {502#(and (= 0 main_~x~0) (= 0 main_~y~0))} is VALID [2020-07-10 15:30:07,298 INFO L280 TraceCheckUtils]: 11: Hoare triple {502#(and (= 0 main_~x~0) (= 0 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 + ~x~0; {524#(and (= main_~x~0 main_~y~0) (= 1 main_~y~0))} is VALID [2020-07-10 15:30:07,299 INFO L280 TraceCheckUtils]: 12: Hoare triple {524#(and (= main_~x~0 main_~y~0) (= 1 main_~y~0))} assume !false; {524#(and (= main_~x~0 main_~y~0) (= 1 main_~y~0))} is VALID [2020-07-10 15:30:07,300 INFO L263 TraceCheckUtils]: 13: Hoare triple {524#(and (= main_~x~0 main_~y~0) (= 1 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {485#true} is VALID [2020-07-10 15:30:07,300 INFO L280 TraceCheckUtils]: 14: Hoare triple {485#true} ~cond := #in~cond; {485#true} is VALID [2020-07-10 15:30:07,300 INFO L280 TraceCheckUtils]: 15: Hoare triple {485#true} assume !(0 == ~cond); {485#true} is VALID [2020-07-10 15:30:07,301 INFO L280 TraceCheckUtils]: 16: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-10 15:30:07,303 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {485#true} {524#(and (= main_~x~0 main_~y~0) (= 1 main_~y~0))} #50#return; {524#(and (= main_~x~0 main_~y~0) (= 1 main_~y~0))} is VALID [2020-07-10 15:30:07,305 INFO L280 TraceCheckUtils]: 18: Hoare triple {524#(and (= main_~x~0 main_~y~0) (= 1 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 + ~x~0; {546#(and (= (* 2 main_~y~0) (+ main_~x~0 1)) (= 2 main_~y~0))} is VALID [2020-07-10 15:30:07,306 INFO L280 TraceCheckUtils]: 19: Hoare triple {546#(and (= (* 2 main_~y~0) (+ main_~x~0 1)) (= 2 main_~y~0))} assume !false; {546#(and (= (* 2 main_~y~0) (+ main_~x~0 1)) (= 2 main_~y~0))} is VALID [2020-07-10 15:30:07,307 INFO L263 TraceCheckUtils]: 20: Hoare triple {546#(and (= (* 2 main_~y~0) (+ main_~x~0 1)) (= 2 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {553#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:30:07,309 INFO L280 TraceCheckUtils]: 21: Hoare triple {553#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {557#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:07,310 INFO L280 TraceCheckUtils]: 22: Hoare triple {557#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {486#false} is VALID [2020-07-10 15:30:07,311 INFO L280 TraceCheckUtils]: 23: Hoare triple {486#false} assume !false; {486#false} is VALID [2020-07-10 15:30:07,313 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:30:07,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683481347] [2020-07-10 15:30:07,314 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:07,314 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459028502] [2020-07-10 15:30:07,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:30:07,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-10 15:30:07,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261431273] [2020-07-10 15:30:07,316 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-10 15:30:07,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:07,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:30:07,352 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:07,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:30:07,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:07,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:30:07,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:30:07,354 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 7 states. [2020-07-10 15:30:07,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:07,723 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-10 15:30:07,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:30:07,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-10 15:30:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:07,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:30:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2020-07-10 15:30:07,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:30:07,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2020-07-10 15:30:07,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2020-07-10 15:30:07,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:07,797 INFO L225 Difference]: With dead ends: 39 [2020-07-10 15:30:07,797 INFO L226 Difference]: Without dead ends: 36 [2020-07-10 15:30:07,801 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:30:07,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-10 15:30:07,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-10 15:30:07,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:07,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2020-07-10 15:30:07,833 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-10 15:30:07,833 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-10 15:30:07,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:07,836 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-10 15:30:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-10 15:30:07,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:07,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:07,838 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-10 15:30:07,838 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-10 15:30:07,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:07,842 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-10 15:30:07,842 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-10 15:30:07,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:07,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:07,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:07,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:07,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 15:30:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-07-10 15:30:07,846 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 24 [2020-07-10 15:30:07,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:07,846 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-07-10 15:30:07,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:30:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-10 15:30:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 15:30:07,848 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:07,848 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:08,060 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:30:08,061 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:08,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:08,062 INFO L82 PathProgramCache]: Analyzing trace with hash -695576914, now seen corresponding path program 3 times [2020-07-10 15:30:08,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:08,063 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553310649] [2020-07-10 15:30:08,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:08,077 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:08,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1120749154] [2020-07-10 15:30:08,078 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 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:08,103 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-10 15:30:08,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:30:08,104 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-10 15:30:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-10 15:30:10,145 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:10,287 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:30:10,362 INFO L263 TraceCheckUtils]: 0: Hoare triple {747#true} call ULTIMATE.init(); {747#true} is VALID [2020-07-10 15:30:10,363 INFO L280 TraceCheckUtils]: 1: Hoare triple {747#true} assume true; {747#true} is VALID [2020-07-10 15:30:10,363 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {747#true} {747#true} #46#return; {747#true} is VALID [2020-07-10 15:30:10,363 INFO L263 TraceCheckUtils]: 3: Hoare triple {747#true} call #t~ret1 := main(); {747#true} is VALID [2020-07-10 15:30:10,363 INFO L280 TraceCheckUtils]: 4: Hoare triple {747#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;~y~0 := 0;~x~0 := 0;~c~0 := 0; {747#true} is VALID [2020-07-10 15:30:10,364 INFO L280 TraceCheckUtils]: 5: Hoare triple {747#true} assume !false; {747#true} is VALID [2020-07-10 15:30:10,364 INFO L263 TraceCheckUtils]: 6: Hoare triple {747#true} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {747#true} is VALID [2020-07-10 15:30:10,364 INFO L280 TraceCheckUtils]: 7: Hoare triple {747#true} ~cond := #in~cond; {747#true} is VALID [2020-07-10 15:30:10,364 INFO L280 TraceCheckUtils]: 8: Hoare triple {747#true} assume !(0 == ~cond); {747#true} is VALID [2020-07-10 15:30:10,365 INFO L280 TraceCheckUtils]: 9: Hoare triple {747#true} assume true; {747#true} is VALID [2020-07-10 15:30:10,365 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {747#true} {747#true} #50#return; {747#true} is VALID [2020-07-10 15:30:10,365 INFO L280 TraceCheckUtils]: 11: Hoare triple {747#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 + ~x~0; {747#true} is VALID [2020-07-10 15:30:10,365 INFO L280 TraceCheckUtils]: 12: Hoare triple {747#true} assume !false; {747#true} is VALID [2020-07-10 15:30:10,365 INFO L263 TraceCheckUtils]: 13: Hoare triple {747#true} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {747#true} is VALID [2020-07-10 15:30:10,366 INFO L280 TraceCheckUtils]: 14: Hoare triple {747#true} ~cond := #in~cond; {747#true} is VALID [2020-07-10 15:30:10,366 INFO L280 TraceCheckUtils]: 15: Hoare triple {747#true} assume !(0 == ~cond); {747#true} is VALID [2020-07-10 15:30:10,366 INFO L280 TraceCheckUtils]: 16: Hoare triple {747#true} assume true; {747#true} is VALID [2020-07-10 15:30:10,366 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {747#true} {747#true} #50#return; {747#true} is VALID [2020-07-10 15:30:10,367 INFO L280 TraceCheckUtils]: 18: Hoare triple {747#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 + ~x~0; {747#true} is VALID [2020-07-10 15:30:10,367 INFO L280 TraceCheckUtils]: 19: Hoare triple {747#true} assume !false; {747#true} is VALID [2020-07-10 15:30:10,367 INFO L263 TraceCheckUtils]: 20: Hoare triple {747#true} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {747#true} is VALID [2020-07-10 15:30:10,371 INFO L280 TraceCheckUtils]: 21: Hoare triple {747#true} ~cond := #in~cond; {815#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:10,375 INFO L280 TraceCheckUtils]: 22: Hoare triple {815#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {819#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:30:10,376 INFO L280 TraceCheckUtils]: 23: Hoare triple {819#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {819#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:30:10,380 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {819#(not (= 0 |__VERIFIER_assert_#in~cond|))} {747#true} #50#return; {826#(= (+ main_~y~0 (* main_~y~0 main_~y~0)) (* 2 main_~x~0))} is VALID [2020-07-10 15:30:12,401 INFO L280 TraceCheckUtils]: 25: Hoare triple {826#(= (+ main_~y~0 (* main_~y~0 main_~y~0)) (* 2 main_~x~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 + ~x~0; {826#(= (+ main_~y~0 (* main_~y~0 main_~y~0)) (* 2 main_~x~0))} is UNKNOWN [2020-07-10 15:30:12,403 INFO L280 TraceCheckUtils]: 26: Hoare triple {826#(= (+ main_~y~0 (* main_~y~0 main_~y~0)) (* 2 main_~x~0))} assume !false; {826#(= (+ main_~y~0 (* main_~y~0 main_~y~0)) (* 2 main_~x~0))} is VALID [2020-07-10 15:30:12,404 INFO L263 TraceCheckUtils]: 27: Hoare triple {826#(= (+ main_~y~0 (* main_~y~0 main_~y~0)) (* 2 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {836#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:30:12,404 INFO L280 TraceCheckUtils]: 28: Hoare triple {836#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {840#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:12,405 INFO L280 TraceCheckUtils]: 29: Hoare triple {840#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {748#false} is VALID [2020-07-10 15:30:12,405 INFO L280 TraceCheckUtils]: 30: Hoare triple {748#false} assume !false; {748#false} is VALID [2020-07-10 15:30:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-10 15:30:12,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553310649] [2020-07-10 15:30:12,407 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:12,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120749154] [2020-07-10 15:30:12,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:30:12,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-10 15:30:12,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635243666] [2020-07-10 15:30:12,408 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-07-10 15:30:12,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:12,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:30:14,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 21 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:14,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:30:14,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:14,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:30:14,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:30:14,483 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 7 states. [2020-07-10 15:30:14,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:14,666 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-10 15:30:14,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:30:14,666 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-07-10 15:30:14,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:14,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:30:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2020-07-10 15:30:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:30:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2020-07-10 15:30:14,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 16 transitions. [2020-07-10 15:30:16,746 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:16,747 INFO L225 Difference]: With dead ends: 36 [2020-07-10 15:30:16,747 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:30:16,748 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:30:16,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:30:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:30:16,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:16,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:30:16,749 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:30:16,749 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:30:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:16,750 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:30:16,750 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:30:16,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:16,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:16,750 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:30:16,750 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:30:16,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:16,750 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:30:16,751 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:30:16,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:16,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:16,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:16,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:16,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:30:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:30:16,751 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2020-07-10 15:30:16,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:16,752 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:30:16,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:30:16,752 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:30:16,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:16,952 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:30:16,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:30:17,058 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:30:17,058 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:30:17,058 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:30:17,058 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:30:17,058 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:30:17,059 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:30:17,059 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:30:17,059 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-10 15:30:17,059 INFO L268 CegarLoopResult]: For program point L5-2(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:30:17,059 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:30:17,059 INFO L268 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2020-07-10 15:30:17,059 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 15 36) the Hoare annotation is: true [2020-07-10 15:30:17,059 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 15 36) no Hoare annotation was computed. [2020-07-10 15:30:17,059 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0))) [2020-07-10 15:30:17,060 INFO L268 CegarLoopResult]: For program point L24-1(lines 23 32) no Hoare annotation was computed. [2020-07-10 15:30:17,060 INFO L264 CegarLoopResult]: At program point L23-2(lines 23 32) the Hoare annotation is: (= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0))) [2020-07-10 15:30:17,060 INFO L264 CegarLoopResult]: At program point L23-3(lines 23 32) the Hoare annotation is: (= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0))) [2020-07-10 15:30:17,060 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 15 36) no Hoare annotation was computed. [2020-07-10 15:30:17,060 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 7 13) the Hoare annotation is: true [2020-07-10 15:30:17,060 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 7 13) no Hoare annotation was computed. [2020-07-10 15:30:17,060 INFO L268 CegarLoopResult]: For program point L9(lines 9 10) no Hoare annotation was computed. [2020-07-10 15:30:17,061 INFO L268 CegarLoopResult]: For program point L8(lines 8 11) no Hoare annotation was computed. [2020-07-10 15:30:17,061 INFO L268 CegarLoopResult]: For program point L8-2(lines 7 13) no Hoare annotation was computed. [2020-07-10 15:30:17,061 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2020-07-10 15:30:17,065 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:30:17,066 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:30:17,067 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:30:17,067 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:30:17,067 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:30:17,067 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:30:17,067 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:30:17,068 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:30:17,069 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:30:17,069 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:30:17,069 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2020-07-10 15:30:17,069 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 15:30:17,069 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-10 15:30:17,069 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 15:30:17,069 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 15:30:17,069 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2020-07-10 15:30:17,069 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 15:30:17,070 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-10 15:30:17,070 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-10 15:30:17,070 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:30:17,070 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:30:17,070 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:30:17,070 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:30:17,070 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:30:17,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:30:17 BoogieIcfgContainer [2020-07-10 15:30:17,080 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:30:17,083 INFO L168 Benchmark]: Toolchain (without parser) took 12890.83 ms. Allocated memory was 137.4 MB in the beginning and 247.5 MB in the end (delta: 110.1 MB). Free memory was 102.1 MB in the beginning and 113.5 MB in the end (delta: -11.3 MB). Peak memory consumption was 98.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:30:17,084 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.4 MB. Free memory was 120.4 MB in the beginning and 120.2 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:30:17,084 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.33 ms. Allocated memory is still 137.4 MB. Free memory was 101.7 MB in the beginning and 91.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:30:17,085 INFO L168 Benchmark]: Boogie Preprocessor took 131.70 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 91.6 MB in the beginning and 181.1 MB in the end (delta: -89.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:30:17,086 INFO L168 Benchmark]: RCFGBuilder took 374.71 ms. Allocated memory is still 201.3 MB. Free memory was 181.1 MB in the beginning and 164.8 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:30:17,087 INFO L168 Benchmark]: TraceAbstraction took 12095.18 ms. Allocated memory was 201.3 MB in the beginning and 247.5 MB in the end (delta: 46.1 MB). Free memory was 164.1 MB in the beginning and 113.5 MB in the end (delta: 50.6 MB). Peak memory consumption was 96.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:30:17,091 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.24 ms. Allocated memory is still 137.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 283.33 ms. Allocated memory is still 137.4 MB. Free memory was 101.7 MB in the beginning and 91.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.70 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 91.6 MB in the beginning and 181.1 MB in the end (delta: -89.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 374.71 ms. Allocated memory is still 201.3 MB. Free memory was 181.1 MB in the beginning and 164.8 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12095.18 ms. Allocated memory was 201.3 MB in the beginning and 247.5 MB in the end (delta: 46.1 MB). Free memory was 164.1 MB in the beginning and 113.5 MB in the end (delta: 50.6 MB). Peak memory consumption was 96.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: 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: 23]: Loop Invariant Derived loop invariant: x * 2 == y + y * y - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 11.8s, OverallIterations: 5, TraceHistogramMax: 4, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 76 SDtfs, 27 SDslu, 194 SDs, 0 SdLazy, 108 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 17 PreInvPairs, 29 NumberOfFragments, 32 HoareAnnotationTreeSize, 17 FomulaSimplifications, 112 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 26 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 92 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 4995 SizeOfPredicates, 9 NumberOfNonLiveVariables, 188 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 42/52 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...