/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-267fbe0 [2020-07-17 22:52:44,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:52:44,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:52:44,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:52:44,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:52:44,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:52:44,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:52:44,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:52:44,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:52:44,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:52:44,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:52:44,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:52:44,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:52:44,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:52:44,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:52:44,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:52:44,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:52:44,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:52:44,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:52:44,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:52:44,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:52:44,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:52:44,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:52:44,847 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:52:44,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:52:44,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:52:44,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:52:44,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:52:44,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:52:44,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:52:44,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:52:44,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:52:44,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:52:44,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:52:44,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:52:44,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:52:44,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:52:44,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:52:44,857 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:52:44,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:52:44,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:52:44,860 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-17 22:52:44,875 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:52:44,876 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:52:44,877 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:52:44,877 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:52:44,877 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:52:44,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:52:44,878 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:52:44,878 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:52:44,878 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:52:44,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:52:44,879 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:52:44,879 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:52:44,879 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:52:44,879 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:52:44,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:52:44,880 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:52:44,880 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:52:44,880 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:52:44,880 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:52:44,880 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:52:44,881 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:52:44,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:52:44,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:52:44,881 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:52:44,881 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:52:44,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:52:44,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:52:44,882 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:52:44,882 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:52:44,882 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:52:45,194 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:52:45,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:52:45,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:52:45,221 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:52:45,221 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:52:45,222 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-17 22:52:45,310 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4f5d3f63/1edd213cf6de4eaabd199db195ea00ed/FLAG6351ac267 [2020-07-17 22:52:45,920 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:52:45,921 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/ps2.c [2020-07-17 22:52:45,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4f5d3f63/1edd213cf6de4eaabd199db195ea00ed/FLAG6351ac267 [2020-07-17 22:52:46,342 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4f5d3f63/1edd213cf6de4eaabd199db195ea00ed [2020-07-17 22:52:46,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:52:46,361 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:52:46,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:52:46,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:52:46,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:52:46,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:52:46" (1/1) ... [2020-07-17 22:52:46,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5acbf1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:46, skipping insertion in model container [2020-07-17 22:52:46,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:52:46" (1/1) ... [2020-07-17 22:52:46,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:52:46,409 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:52:46,615 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:52:46,621 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:52:46,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:52:46,657 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:52:46,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:46 WrapperNode [2020-07-17 22:52:46,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:52:46,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:52:46,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:52:46,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:52:46,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:46" (1/1) ... [2020-07-17 22:52:46,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:46" (1/1) ... [2020-07-17 22:52:46,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:46" (1/1) ... [2020-07-17 22:52:46,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:46" (1/1) ... [2020-07-17 22:52:46,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:46" (1/1) ... [2020-07-17 22:52:46,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:46" (1/1) ... [2020-07-17 22:52:46,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:46" (1/1) ... [2020-07-17 22:52:46,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:52:46,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:52:46,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:52:46,798 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:52:46,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:46" (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-17 22:52:46,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:52:46,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:52:46,872 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:52:46,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:52:46,872 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:52:46,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:52:46,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:52:46,872 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:52:46,872 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:52:46,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:52:46,873 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:52:46,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:52:46,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:52:47,164 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:52:47,164 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:52:47,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:52:47 BoogieIcfgContainer [2020-07-17 22:52:47,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:52:47,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:52:47,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:52:47,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:52:47,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:52:46" (1/3) ... [2020-07-17 22:52:47,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385b9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:52:47, skipping insertion in model container [2020-07-17 22:52:47,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:46" (2/3) ... [2020-07-17 22:52:47,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385b9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:52:47, skipping insertion in model container [2020-07-17 22:52:47,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:52:47" (3/3) ... [2020-07-17 22:52:47,184 INFO L109 eAbstractionObserver]: Analyzing ICFG ps2.c [2020-07-17 22:52:47,217 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:52:47,234 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:52:47,263 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:52:47,290 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:52:47,290 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:52:47,290 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:52:47,290 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:52:47,291 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:52:47,291 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:52:47,291 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:52:47,291 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:52:47,312 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-17 22:52:47,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-17 22:52:47,318 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:47,319 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:47,320 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:47,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:47,327 INFO L82 PathProgramCache]: Analyzing trace with hash -64610451, now seen corresponding path program 1 times [2020-07-17 22:52:47,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:47,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920967042] [2020-07-17 22:52:47,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:47,480 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-17 22:52:47,480 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2020-07-17 22:52:47,482 INFO L263 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2020-07-17 22:52:47,482 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-17 22:52:47,483 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2020-07-17 22:52:47,483 INFO L263 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret1 := main(); {23#true} is VALID [2020-07-17 22:52:47,484 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-17 22:52:47,490 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#true} assume false; {24#false} is VALID [2020-07-17 22:52:47,490 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-17 22:52:47,491 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2020-07-17 22:52:47,491 INFO L280 TraceCheckUtils]: 8: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2020-07-17 22:52:47,492 INFO L280 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-17 22:52:47,494 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-17 22:52:47,494 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920967042] [2020-07-17 22:52:47,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:52:47,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-17 22:52:47,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498964206] [2020-07-17 22:52:47,504 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-17 22:52:47,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:47,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-17 22:52:47,553 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-17 22:52:47,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-17 22:52:47,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:47,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-17 22:52:47,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:52:47,565 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-17 22:52:47,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:47,659 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2020-07-17 22:52:47,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-17 22:52:47,659 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-17 22:52:47,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:47,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:52:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-17 22:52:47,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:52:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-17 22:52:47,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 45 transitions. [2020-07-17 22:52:47,771 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-17 22:52:47,783 INFO L225 Difference]: With dead ends: 35 [2020-07-17 22:52:47,783 INFO L226 Difference]: Without dead ends: 15 [2020-07-17 22:52:47,788 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-17 22:52:47,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-17 22:52:47,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-17 22:52:47,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:47,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-17 22:52:47,832 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-17 22:52:47,833 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-17 22:52:47,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:47,838 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-17 22:52:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-17 22:52:47,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:47,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:47,839 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-17 22:52:47,839 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-17 22:52:47,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:47,843 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-17 22:52:47,844 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-17 22:52:47,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:47,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:47,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:47,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:47,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:52:47,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-17 22:52:47,850 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2020-07-17 22:52:47,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:47,850 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-17 22:52:47,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-17 22:52:47,851 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-17 22:52:47,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-17 22:52:47,852 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:47,852 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:47,852 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:52:47,853 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:47,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:47,854 INFO L82 PathProgramCache]: Analyzing trace with hash -62822991, now seen corresponding path program 1 times [2020-07-17 22:52:47,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:47,855 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892800814] [2020-07-17 22:52:47,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:47,863 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:52:47,864 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [564594502] [2020-07-17 22:52:47,864 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-17 22:52:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:47,909 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:52:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:47,922 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:48,044 INFO L263 TraceCheckUtils]: 0: Hoare triple {129#true} call ULTIMATE.init(); {129#true} is VALID [2020-07-17 22:52:48,044 INFO L280 TraceCheckUtils]: 1: Hoare triple {129#true} assume true; {129#true} is VALID [2020-07-17 22:52:48,045 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {129#true} {129#true} #46#return; {129#true} is VALID [2020-07-17 22:52:48,045 INFO L263 TraceCheckUtils]: 3: Hoare triple {129#true} call #t~ret1 := main(); {129#true} is VALID [2020-07-17 22:52:48,047 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-17 22:52:48,048 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-17 22:52:48,050 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-17 22:52:48,052 INFO L280 TraceCheckUtils]: 7: Hoare triple {153#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {157#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:48,053 INFO L280 TraceCheckUtils]: 8: Hoare triple {157#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {130#false} is VALID [2020-07-17 22:52:48,054 INFO L280 TraceCheckUtils]: 9: Hoare triple {130#false} assume !false; {130#false} is VALID [2020-07-17 22:52:48,055 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-17 22:52:48,056 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892800814] [2020-07-17 22:52:48,056 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:52:48,056 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564594502] [2020-07-17 22:52:48,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:52:48,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:52:48,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439197284] [2020-07-17 22:52:48,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-17 22:52:48,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:48,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:52:48,078 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-17 22:52:48,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:52:48,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:48,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:52:48,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:52:48,081 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2020-07-17 22:52:48,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:48,252 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-17 22:52:48,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:52:48,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-17 22:52:48,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:48,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:52:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-17 22:52:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:52:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-17 22:52:48,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2020-07-17 22:52:48,314 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-17 22:52:48,316 INFO L225 Difference]: With dead ends: 25 [2020-07-17 22:52:48,317 INFO L226 Difference]: Without dead ends: 22 [2020-07-17 22:52:48,318 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-17 22:52:48,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-17 22:52:48,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-17 22:52:48,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:48,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-17 22:52:48,335 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-17 22:52:48,335 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-17 22:52:48,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:48,338 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-17 22:52:48,338 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-17 22:52:48,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:48,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:48,339 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-17 22:52:48,340 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-17 22:52:48,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:48,342 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-17 22:52:48,343 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-17 22:52:48,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:48,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:48,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:48,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:48,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-17 22:52:48,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-17 22:52:48,347 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 10 [2020-07-17 22:52:48,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:48,347 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-17 22:52:48,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:52:48,347 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-17 22:52:48,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:52:48,348 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:48,348 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:48,563 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:52:48,564 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:48,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:48,565 INFO L82 PathProgramCache]: Analyzing trace with hash 50868238, now seen corresponding path program 1 times [2020-07-17 22:52:48,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:48,566 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004123926] [2020-07-17 22:52:48,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:48,573 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:52:48,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1186831751] [2020-07-17 22:52:48,574 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-17 22:52:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:48,608 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-17 22:52:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:48,625 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:48,763 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-17 22:52:48,764 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-17 22:52:48,764 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #46#return; {279#true} is VALID [2020-07-17 22:52:48,765 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret1 := main(); {279#true} is VALID [2020-07-17 22:52:48,766 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-17 22:52:48,768 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-17 22:52:48,768 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-17 22:52:48,768 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} ~cond := #in~cond; {279#true} is VALID [2020-07-17 22:52:48,769 INFO L280 TraceCheckUtils]: 8: Hoare triple {279#true} assume !(0 == ~cond); {279#true} is VALID [2020-07-17 22:52:48,769 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-17 22:52:48,770 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-17 22:52:48,771 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-17 22:52:48,773 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-17 22:52:48,774 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-17 22:52:48,775 INFO L280 TraceCheckUtils]: 14: Hoare triple {325#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {329#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:48,776 INFO L280 TraceCheckUtils]: 15: Hoare triple {329#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {280#false} is VALID [2020-07-17 22:52:48,776 INFO L280 TraceCheckUtils]: 16: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-17 22:52:48,778 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-17 22:52:48,778 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004123926] [2020-07-17 22:52:48,779 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:52:48,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186831751] [2020-07-17 22:52:48,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:52:48,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-17 22:52:48,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404846220] [2020-07-17 22:52:48,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-17 22:52:48,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:48,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:52:48,804 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-17 22:52:48,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:52:48,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:48,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:52:48,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:52:48,806 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 6 states. [2020-07-17 22:52:49,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:49,010 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-17 22:52:49,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:52:49,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-17 22:52:49,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:49,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:52:49,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-07-17 22:52:49,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:52:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-07-17 22:52:49,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2020-07-17 22:52:49,061 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-17 22:52:49,064 INFO L225 Difference]: With dead ends: 32 [2020-07-17 22:52:49,064 INFO L226 Difference]: Without dead ends: 29 [2020-07-17 22:52:49,065 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-17 22:52:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-17 22:52:49,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-17 22:52:49,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:49,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-17 22:52:49,088 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-17 22:52:49,088 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-17 22:52:49,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:49,091 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-17 22:52:49,091 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-17 22:52:49,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:49,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:49,092 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-17 22:52:49,092 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-17 22:52:49,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:49,095 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-17 22:52:49,095 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-17 22:52:49,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:49,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:49,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:49,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-17 22:52:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2020-07-17 22:52:49,102 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 17 [2020-07-17 22:52:49,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:49,103 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-07-17 22:52:49,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:52:49,103 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-17 22:52:49,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:52:49,104 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:49,104 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:49,305 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:49,306 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:49,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:49,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1538749201, now seen corresponding path program 2 times [2020-07-17 22:52:49,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:49,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622198154] [2020-07-17 22:52:49,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:49,319 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:52:49,319 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [709877619] [2020-07-17 22:52:49,320 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:49,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:52:49,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:52:49,367 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-17 22:52:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:49,382 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:49,567 INFO L263 TraceCheckUtils]: 0: Hoare triple {485#true} call ULTIMATE.init(); {485#true} is VALID [2020-07-17 22:52:49,567 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-17 22:52:49,568 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {485#true} {485#true} #46#return; {485#true} is VALID [2020-07-17 22:52:49,568 INFO L263 TraceCheckUtils]: 3: Hoare triple {485#true} call #t~ret1 := main(); {485#true} is VALID [2020-07-17 22:52:49,570 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-17 22:52:49,571 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-17 22:52:49,571 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-17 22:52:49,572 INFO L280 TraceCheckUtils]: 7: Hoare triple {485#true} ~cond := #in~cond; {485#true} is VALID [2020-07-17 22:52:49,572 INFO L280 TraceCheckUtils]: 8: Hoare triple {485#true} assume !(0 == ~cond); {485#true} is VALID [2020-07-17 22:52:49,573 INFO L280 TraceCheckUtils]: 9: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-17 22:52:49,574 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-17 22:52:49,580 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-17 22:52:49,582 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-17 22:52:49,582 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-17 22:52:49,582 INFO L280 TraceCheckUtils]: 14: Hoare triple {485#true} ~cond := #in~cond; {485#true} is VALID [2020-07-17 22:52:49,583 INFO L280 TraceCheckUtils]: 15: Hoare triple {485#true} assume !(0 == ~cond); {485#true} is VALID [2020-07-17 22:52:49,583 INFO L280 TraceCheckUtils]: 16: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-17 22:52:49,586 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-17 22:52:49,587 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-17 22:52:49,588 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-17 22:52:49,589 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-17 22:52:49,591 INFO L280 TraceCheckUtils]: 21: Hoare triple {553#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {557#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:49,592 INFO L280 TraceCheckUtils]: 22: Hoare triple {557#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {486#false} is VALID [2020-07-17 22:52:49,592 INFO L280 TraceCheckUtils]: 23: Hoare triple {486#false} assume !false; {486#false} is VALID [2020-07-17 22:52:49,597 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-17 22:52:49,597 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622198154] [2020-07-17 22:52:49,598 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:52:49,598 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709877619] [2020-07-17 22:52:49,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:52:49,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 22:52:49,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185768790] [2020-07-17 22:52:49,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-17 22:52:49,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:49,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:52:49,634 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-17 22:52:49,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:52:49,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:49,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:52:49,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:52:49,635 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 7 states. [2020-07-17 22:52:49,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:49,983 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-17 22:52:49,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:52:49,983 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-17 22:52:49,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:49,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:52:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2020-07-17 22:52:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:52:49,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2020-07-17 22:52:49,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2020-07-17 22:52:50,031 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-17 22:52:50,034 INFO L225 Difference]: With dead ends: 39 [2020-07-17 22:52:50,035 INFO L226 Difference]: Without dead ends: 36 [2020-07-17 22:52:50,036 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-17 22:52:50,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-17 22:52:50,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-17 22:52:50,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:50,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2020-07-17 22:52:50,064 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-17 22:52:50,065 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-17 22:52:50,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:50,068 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-17 22:52:50,068 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-17 22:52:50,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:50,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:50,069 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-17 22:52:50,069 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-17 22:52:50,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:50,074 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-17 22:52:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-17 22:52:50,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:50,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:50,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:50,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-17 22:52:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-07-17 22:52:50,078 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 24 [2020-07-17 22:52:50,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:50,078 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-07-17 22:52:50,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:52:50,079 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-17 22:52:50,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 22:52:50,080 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:50,080 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:50,294 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:50,295 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:50,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:50,297 INFO L82 PathProgramCache]: Analyzing trace with hash -695576914, now seen corresponding path program 3 times [2020-07-17 22:52:50,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:50,298 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540241423] [2020-07-17 22:52:50,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:50,306 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:52:50,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [893759187] [2020-07-17 22:52:50,307 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) [2020-07-17 22:52:50,335 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-17 22:52:50,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:50,337 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-17 22:52:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:50,360 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:50,500 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:52:50,567 INFO L263 TraceCheckUtils]: 0: Hoare triple {747#true} call ULTIMATE.init(); {747#true} is VALID [2020-07-17 22:52:50,568 INFO L280 TraceCheckUtils]: 1: Hoare triple {747#true} assume true; {747#true} is VALID [2020-07-17 22:52:50,568 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {747#true} {747#true} #46#return; {747#true} is VALID [2020-07-17 22:52:50,568 INFO L263 TraceCheckUtils]: 3: Hoare triple {747#true} call #t~ret1 := main(); {747#true} is VALID [2020-07-17 22:52:50,568 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-17 22:52:50,569 INFO L280 TraceCheckUtils]: 5: Hoare triple {747#true} assume !false; {747#true} is VALID [2020-07-17 22:52:50,569 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-17 22:52:50,569 INFO L280 TraceCheckUtils]: 7: Hoare triple {747#true} ~cond := #in~cond; {747#true} is VALID [2020-07-17 22:52:50,569 INFO L280 TraceCheckUtils]: 8: Hoare triple {747#true} assume !(0 == ~cond); {747#true} is VALID [2020-07-17 22:52:50,570 INFO L280 TraceCheckUtils]: 9: Hoare triple {747#true} assume true; {747#true} is VALID [2020-07-17 22:52:50,570 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {747#true} {747#true} #50#return; {747#true} is VALID [2020-07-17 22:52:50,570 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-17 22:52:50,571 INFO L280 TraceCheckUtils]: 12: Hoare triple {747#true} assume !false; {747#true} is VALID [2020-07-17 22:52:50,571 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-17 22:52:50,571 INFO L280 TraceCheckUtils]: 14: Hoare triple {747#true} ~cond := #in~cond; {747#true} is VALID [2020-07-17 22:52:50,571 INFO L280 TraceCheckUtils]: 15: Hoare triple {747#true} assume !(0 == ~cond); {747#true} is VALID [2020-07-17 22:52:50,571 INFO L280 TraceCheckUtils]: 16: Hoare triple {747#true} assume true; {747#true} is VALID [2020-07-17 22:52:50,572 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {747#true} {747#true} #50#return; {747#true} is VALID [2020-07-17 22:52:50,572 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-17 22:52:50,572 INFO L280 TraceCheckUtils]: 19: Hoare triple {747#true} assume !false; {747#true} is VALID [2020-07-17 22:52:50,572 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-17 22:52:50,574 INFO L280 TraceCheckUtils]: 21: Hoare triple {747#true} ~cond := #in~cond; {815#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:50,574 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-17 22:52:50,575 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-17 22:52:50,584 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-17 22:52:52,602 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-17 22:52:52,603 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-17 22:52:52,605 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-17 22:52:52,606 INFO L280 TraceCheckUtils]: 28: Hoare triple {836#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {840#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:52,606 INFO L280 TraceCheckUtils]: 29: Hoare triple {840#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {748#false} is VALID [2020-07-17 22:52:52,607 INFO L280 TraceCheckUtils]: 30: Hoare triple {748#false} assume !false; {748#false} is VALID [2020-07-17 22:52:52,609 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-17 22:52:52,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540241423] [2020-07-17 22:52:52,610 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:52:52,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893759187] [2020-07-17 22:52:52,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:52:52,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 22:52:52,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938302466] [2020-07-17 22:52:52,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-07-17 22:52:52,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:52,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:52:54,689 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-17 22:52:54,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:52:54,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:54,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:52:54,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:52:54,691 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 7 states. [2020-07-17 22:52:54,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:54,880 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-17 22:52:54,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:52:54,882 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-07-17 22:52:54,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:54,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:52:54,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2020-07-17 22:52:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:52:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2020-07-17 22:52:54,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 16 transitions. [2020-07-17 22:52:56,976 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-17 22:52:56,976 INFO L225 Difference]: With dead ends: 36 [2020-07-17 22:52:56,976 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:52:56,978 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-17 22:52:56,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:52:56,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:52:56,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:56,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:56,979 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:56,979 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:56,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:56,980 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:52:56,980 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:52:56,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:56,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:56,980 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:56,980 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:56,981 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:52:56,981 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:52:56,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:56,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:56,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:56,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:56,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:52:56,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:52:56,982 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2020-07-17 22:52:56,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:56,982 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:52:56,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:52:56,983 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:52:56,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:57,194 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:57,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:52:57,310 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:52:57,310 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:52:57,310 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:52:57,310 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:52:57,310 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:52:57,310 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:52:57,310 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 4 6) no Hoare annotation was computed. [2020-07-17 22:52:57,311 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-17 22:52:57,311 INFO L268 CegarLoopResult]: For program point L5-2(lines 4 6) no Hoare annotation was computed. [2020-07-17 22:52:57,311 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 4 6) no Hoare annotation was computed. [2020-07-17 22:52:57,311 INFO L268 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2020-07-17 22:52:57,311 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 15 36) the Hoare annotation is: true [2020-07-17 22:52:57,311 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 15 36) no Hoare annotation was computed. [2020-07-17 22:52:57,311 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-17 22:52:57,311 INFO L268 CegarLoopResult]: For program point L24-1(lines 23 32) no Hoare annotation was computed. [2020-07-17 22:52:57,312 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-17 22:52:57,312 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-17 22:52:57,312 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 15 36) no Hoare annotation was computed. [2020-07-17 22:52:57,312 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 7 13) the Hoare annotation is: true [2020-07-17 22:52:57,312 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 7 13) no Hoare annotation was computed. [2020-07-17 22:52:57,312 INFO L268 CegarLoopResult]: For program point L9(lines 9 10) no Hoare annotation was computed. [2020-07-17 22:52:57,312 INFO L268 CegarLoopResult]: For program point L8(lines 8 11) no Hoare annotation was computed. [2020-07-17 22:52:57,312 INFO L268 CegarLoopResult]: For program point L8-2(lines 7 13) no Hoare annotation was computed. [2020-07-17 22:52:57,313 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2020-07-17 22:52:57,317 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:52:57,318 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:52:57,319 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:52:57,319 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:52:57,319 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:52:57,319 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:52:57,319 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:52:57,320 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:52:57,320 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:52:57,320 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:52:57,321 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2020-07-17 22:52:57,321 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-17 22:52:57,321 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-17 22:52:57,321 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-17 22:52:57,321 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-17 22:52:57,321 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2020-07-17 22:52:57,321 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-17 22:52:57,321 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-17 22:52:57,321 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-17 22:52:57,321 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:52:57,321 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:52:57,322 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:52:57,322 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:52:57,322 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-17 22:52:57,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:52:57 BoogieIcfgContainer [2020-07-17 22:52:57,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:52:57,336 INFO L168 Benchmark]: Toolchain (without parser) took 10976.52 ms. Allocated memory was 143.7 MB in the beginning and 249.0 MB in the end (delta: 105.4 MB). Free memory was 101.6 MB in the beginning and 116.0 MB in the end (delta: -14.4 MB). Peak memory consumption was 91.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:57,337 INFO L168 Benchmark]: CDTParser took 1.59 ms. Allocated memory is still 143.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:52:57,338 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.29 ms. Allocated memory is still 143.7 MB. Free memory was 101.1 MB in the beginning and 91.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:57,339 INFO L168 Benchmark]: Boogie Preprocessor took 139.25 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 91.4 MB in the beginning and 178.8 MB in the end (delta: -87.5 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:57,339 INFO L168 Benchmark]: RCFGBuilder took 372.41 ms. Allocated memory is still 200.8 MB. Free memory was 178.8 MB in the beginning and 162.9 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:57,340 INFO L168 Benchmark]: TraceAbstraction took 10160.66 ms. Allocated memory was 200.8 MB in the beginning and 249.0 MB in the end (delta: 48.2 MB). Free memory was 162.9 MB in the beginning and 116.0 MB in the end (delta: 46.9 MB). Peak memory consumption was 95.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:57,345 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 1.59 ms. Allocated memory is still 143.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 291.29 ms. Allocated memory is still 143.7 MB. Free memory was 101.1 MB in the beginning and 91.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 139.25 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 91.4 MB in the beginning and 178.8 MB in the end (delta: -87.5 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 372.41 ms. Allocated memory is still 200.8 MB. Free memory was 178.8 MB in the beginning and 162.9 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10160.66 ms. Allocated memory was 200.8 MB in the beginning and 249.0 MB in the end (delta: 48.2 MB). Free memory was 162.9 MB in the beginning and 116.0 MB in the end (delta: 46.9 MB). Peak memory consumption was 95.2 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: 9.9s, 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, 2.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...