/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/geo3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:48:12,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:48:12,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:48:12,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:48:12,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:48:12,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:48:12,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:48:12,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:48:12,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:48:12,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:48:12,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:48:12,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:48:12,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:48:12,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:48:12,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:48:12,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:48:12,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:48:12,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:48:12,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:48:12,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:48:12,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:48:12,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:48:12,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:48:12,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:48:12,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:48:12,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:48:12,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:48:12,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:48:12,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:48:12,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:48:12,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:48:12,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:48:12,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:48:12,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:48:12,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:48:12,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:48:12,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:48:12,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:48:12,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:48:12,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:48:12,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:48:12,730 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-08 12:48:12,743 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:48:12,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:48:12,745 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:48:12,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:48:12,745 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:48:12,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:48:12,746 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:48:12,746 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:48:12,746 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:48:12,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:48:12,746 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:48:12,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:48:12,747 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:48:12,747 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:48:12,747 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:48:12,747 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:48:12,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:48:12,748 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:48:12,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:48:12,748 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:48:12,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:48:12,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:48:12,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:48:12,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:48:12,749 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:48:12,749 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:48:12,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:48:12,750 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:48:12,750 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:48:12,750 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:48:12,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:48:13,007 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:48:13,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:48:13,012 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:48:13,012 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:48:13,013 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/geo3.c [2020-07-08 12:48:13,071 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e339fd76/a4641edc5d1d49428e9040919166be35/FLAGcab8cc9c6 [2020-07-08 12:48:13,456 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:48:13,457 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/geo3.c [2020-07-08 12:48:13,463 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e339fd76/a4641edc5d1d49428e9040919166be35/FLAGcab8cc9c6 [2020-07-08 12:48:13,898 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e339fd76/a4641edc5d1d49428e9040919166be35 [2020-07-08 12:48:13,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:48:13,909 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:48:13,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:48:13,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:48:13,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:48:13,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:48:13" (1/1) ... [2020-07-08 12:48:13,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ecaeae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:13, skipping insertion in model container [2020-07-08 12:48:13,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:48:13" (1/1) ... [2020-07-08 12:48:13,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:48:13,943 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:48:14,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:48:14,119 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:48:14,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:48:14,153 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:48:14,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14 WrapperNode [2020-07-08 12:48:14,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:48:14,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:48:14,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:48:14,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:48:14,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:48:14,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:48:14,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:48:14,254 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:48:14,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (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-08 12:48:14,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:48:14,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:48:14,325 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 12:48:14,325 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:48:14,326 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:48:14,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:48:14,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:48:14,326 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:48:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 12:48:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:48:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:48:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:48:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:48:14,624 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:48:14,625 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 12:48:14,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:48:14 BoogieIcfgContainer [2020-07-08 12:48:14,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:48:14,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:48:14,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:48:14,635 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:48:14,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:48:13" (1/3) ... [2020-07-08 12:48:14,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf2199e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:48:14, skipping insertion in model container [2020-07-08 12:48:14,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (2/3) ... [2020-07-08 12:48:14,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf2199e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:48:14, skipping insertion in model container [2020-07-08 12:48:14,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:48:14" (3/3) ... [2020-07-08 12:48:14,639 INFO L109 eAbstractionObserver]: Analyzing ICFG geo3.c [2020-07-08 12:48:14,650 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:48:14,659 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:48:14,680 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:48:14,709 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:48:14,710 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:48:14,710 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:48:14,710 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:48:14,710 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:48:14,710 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:48:14,711 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:48:14,711 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:48:14,732 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-08 12:48:14,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-08 12:48:14,739 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:14,740 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:48:14,740 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:14,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:14,748 INFO L82 PathProgramCache]: Analyzing trace with hash -64610451, now seen corresponding path program 1 times [2020-07-08 12:48:14,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:14,760 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961092670] [2020-07-08 12:48:14,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:14,904 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-08 12:48:14,905 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2020-07-08 12:48:14,906 INFO L263 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2020-07-08 12:48:14,907 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-08 12:48:14,907 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2020-07-08 12:48:14,907 INFO L263 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2020-07-08 12:48:14,908 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1; {23#true} is VALID [2020-07-08 12:48:14,909 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#true} assume false; {24#false} is VALID [2020-07-08 12:48:14,910 INFO L263 TraceCheckUtils]: 6: Hoare triple {24#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {24#false} is VALID [2020-07-08 12:48:14,910 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2020-07-08 12:48:14,910 INFO L280 TraceCheckUtils]: 8: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2020-07-08 12:48:14,911 INFO L280 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-08 12:48:14,912 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-08 12:48:14,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961092670] [2020-07-08 12:48:14,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:48:14,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 12:48:14,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948468477] [2020-07-08 12:48:14,920 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-08 12:48:14,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:14,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 12:48:14,968 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-08 12:48:14,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 12:48:14,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:14,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 12:48:14,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 12:48:14,978 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-08 12:48:15,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:15,072 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2020-07-08 12:48:15,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 12:48:15,073 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-08 12:48:15,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:48:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:48:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-08 12:48:15,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:48:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-08 12:48:15,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 45 transitions. [2020-07-08 12:48:15,191 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-08 12:48:15,202 INFO L225 Difference]: With dead ends: 35 [2020-07-08 12:48:15,202 INFO L226 Difference]: Without dead ends: 15 [2020-07-08 12:48:15,206 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-08 12:48:15,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-08 12:48:15,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-08 12:48:15,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:48:15,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-08 12:48:15,252 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-08 12:48:15,252 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-08 12:48:15,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:15,257 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-08 12:48:15,257 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-08 12:48:15,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:15,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:15,258 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-08 12:48:15,258 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-08 12:48:15,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:15,262 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-08 12:48:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-08 12:48:15,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:15,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:15,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:48:15,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:48:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 12:48:15,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-08 12:48:15,268 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2020-07-08 12:48:15,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:48:15,269 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-08 12:48:15,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 12:48:15,270 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-08 12:48:15,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-08 12:48:15,270 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:15,271 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:48:15,271 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:48:15,271 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:15,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:15,272 INFO L82 PathProgramCache]: Analyzing trace with hash -62822991, now seen corresponding path program 1 times [2020-07-08 12:48:15,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:15,273 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930606276] [2020-07-08 12:48:15,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:15,283 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:48:15,284 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2143093603] [2020-07-08 12:48:15,284 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-08 12:48:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:15,328 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-08 12:48:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:15,341 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:48:15,481 INFO L263 TraceCheckUtils]: 0: Hoare triple {129#true} call ULTIMATE.init(); {129#true} is VALID [2020-07-08 12:48:15,482 INFO L280 TraceCheckUtils]: 1: Hoare triple {129#true} assume true; {129#true} is VALID [2020-07-08 12:48:15,482 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {129#true} {129#true} #46#return; {129#true} is VALID [2020-07-08 12:48:15,482 INFO L263 TraceCheckUtils]: 3: Hoare triple {129#true} call #t~ret3 := main(); {129#true} is VALID [2020-07-08 12:48:15,484 INFO L280 TraceCheckUtils]: 4: Hoare triple {129#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1; {146#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2020-07-08 12:48:15,485 INFO L280 TraceCheckUtils]: 5: Hoare triple {146#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {146#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2020-07-08 12:48:15,487 INFO L263 TraceCheckUtils]: 6: Hoare triple {146#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {153#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:48:15,488 INFO L280 TraceCheckUtils]: 7: Hoare triple {153#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {157#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:48:15,489 INFO L280 TraceCheckUtils]: 8: Hoare triple {157#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {130#false} is VALID [2020-07-08 12:48:15,490 INFO L280 TraceCheckUtils]: 9: Hoare triple {130#false} assume !false; {130#false} is VALID [2020-07-08 12:48:15,491 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-08 12:48:15,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930606276] [2020-07-08 12:48:15,492 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:48:15,492 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143093603] [2020-07-08 12:48:15,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:48:15,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:48:15,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638058854] [2020-07-08 12:48:15,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-08 12:48:15,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:15,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:48:15,511 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-08 12:48:15,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:48:15,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:15,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:48:15,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:48:15,513 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2020-07-08 12:48:15,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:15,730 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-08 12:48:15,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:48:15,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-08 12:48:15,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:48:15,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:48:15,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-08 12:48:15,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:48:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-08 12:48:15,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2020-07-08 12:48:15,786 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-08 12:48:15,787 INFO L225 Difference]: With dead ends: 25 [2020-07-08 12:48:15,788 INFO L226 Difference]: Without dead ends: 22 [2020-07-08 12:48:15,789 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-08 12:48:15,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-08 12:48:15,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-08 12:48:15,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:48:15,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-08 12:48:15,802 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-08 12:48:15,803 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-08 12:48:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:15,805 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-08 12:48:15,806 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-08 12:48:15,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:15,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:15,807 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-08 12:48:15,807 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-08 12:48:15,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:15,809 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-08 12:48:15,809 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-08 12:48:15,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:15,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:15,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:48:15,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:48:15,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-08 12:48:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-08 12:48:15,813 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 10 [2020-07-08 12:48:15,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:48:15,813 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-08 12:48:15,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:48:15,813 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-08 12:48:15,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-08 12:48:15,814 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:15,814 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:48:16,028 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-08 12:48:16,028 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:16,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:16,029 INFO L82 PathProgramCache]: Analyzing trace with hash 50868238, now seen corresponding path program 1 times [2020-07-08 12:48:16,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:16,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933101387] [2020-07-08 12:48:16,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:16,037 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:48:16,037 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2068521087] [2020-07-08 12:48:16,037 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-08 12:48:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:16,073 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-08 12:48:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-08 12:48:18,109 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:48:18,302 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-08 12:48:18,303 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-08 12:48:18,303 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #46#return; {279#true} is VALID [2020-07-08 12:48:18,303 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret3 := main(); {279#true} is VALID [2020-07-08 12:48:18,305 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1; {296#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2020-07-08 12:48:18,306 INFO L280 TraceCheckUtils]: 5: Hoare triple {296#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {296#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2020-07-08 12:48:18,306 INFO L263 TraceCheckUtils]: 6: Hoare triple {296#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {279#true} is VALID [2020-07-08 12:48:18,307 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} ~cond := #in~cond; {306#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:48:18,308 INFO L280 TraceCheckUtils]: 8: Hoare triple {306#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {310#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:48:18,309 INFO L280 TraceCheckUtils]: 9: Hoare triple {310#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {310#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:48:18,310 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {310#(not (= 0 |__VERIFIER_assert_#in~cond|))} {296#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} #50#return; {296#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2020-07-08 12:48:18,312 INFO L280 TraceCheckUtils]: 11: Hoare triple {296#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {320#(and (= (+ (* main_~z~0 main_~a~0) main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))} is VALID [2020-07-08 12:48:18,314 INFO L280 TraceCheckUtils]: 12: Hoare triple {320#(and (= (+ (* main_~z~0 main_~a~0) main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))} assume !false; {320#(and (= (+ (* main_~z~0 main_~a~0) main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))} is VALID [2020-07-08 12:48:20,354 INFO L263 TraceCheckUtils]: 13: Hoare triple {320#(and (= (+ (* main_~z~0 main_~a~0) main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {327#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2020-07-08 12:48:20,355 INFO L280 TraceCheckUtils]: 14: Hoare triple {327#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {331#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:48:20,356 INFO L280 TraceCheckUtils]: 15: Hoare triple {331#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {280#false} is VALID [2020-07-08 12:48:20,356 INFO L280 TraceCheckUtils]: 16: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-08 12:48:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:48:20,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933101387] [2020-07-08 12:48:20,361 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:48:20,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068521087] [2020-07-08 12:48:20,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:48:20,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-08 12:48:20,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877200500] [2020-07-08 12:48:20,362 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-07-08 12:48:20,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:20,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 12:48:22,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 16 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-08 12:48:22,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 12:48:22,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:22,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 12:48:22,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:48:22,554 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 8 states. [2020-07-08 12:48:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:33,834 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-08 12:48:33,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:48:33,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-07-08 12:48:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:48:33,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:48:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2020-07-08 12:48:33,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:48:33,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2020-07-08 12:48:33,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2020-07-08 12:48:35,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-08 12:48:35,989 INFO L225 Difference]: With dead ends: 32 [2020-07-08 12:48:35,990 INFO L226 Difference]: Without dead ends: 30 [2020-07-08 12:48:35,990 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:48:35,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-08 12:48:36,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-08 12:48:36,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:48:36,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2020-07-08 12:48:36,023 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2020-07-08 12:48:36,023 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2020-07-08 12:48:36,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:36,029 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-08 12:48:36,029 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-08 12:48:36,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:36,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:36,030 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2020-07-08 12:48:36,030 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2020-07-08 12:48:36,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:36,038 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-08 12:48:36,040 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-08 12:48:36,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:36,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:36,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:48:36,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:48:36,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-08 12:48:36,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-08 12:48:36,046 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 17 [2020-07-08 12:48:36,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:48:36,046 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-08 12:48:36,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 12:48:36,051 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-08 12:48:36,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-08 12:48:36,052 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:36,052 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:48:36,252 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:48:36,253 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:36,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:36,255 INFO L82 PathProgramCache]: Analyzing trace with hash 325764102, now seen corresponding path program 1 times [2020-07-08 12:48:36,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:36,256 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95769395] [2020-07-08 12:48:36,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:36,267 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:48:36,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1815775410] [2020-07-08 12:48:36,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:48:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:36,297 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-08 12:48:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:36,309 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:48:36,445 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:48:36,564 INFO L263 TraceCheckUtils]: 0: Hoare triple {490#true} call ULTIMATE.init(); {490#true} is VALID [2020-07-08 12:48:36,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {490#true} assume true; {490#true} is VALID [2020-07-08 12:48:36,565 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {490#true} {490#true} #46#return; {490#true} is VALID [2020-07-08 12:48:36,565 INFO L263 TraceCheckUtils]: 3: Hoare triple {490#true} call #t~ret3 := main(); {490#true} is VALID [2020-07-08 12:48:36,566 INFO L280 TraceCheckUtils]: 4: Hoare triple {490#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1; {490#true} is VALID [2020-07-08 12:48:36,566 INFO L280 TraceCheckUtils]: 5: Hoare triple {490#true} assume !false; {490#true} is VALID [2020-07-08 12:48:36,567 INFO L263 TraceCheckUtils]: 6: Hoare triple {490#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {490#true} is VALID [2020-07-08 12:48:36,567 INFO L280 TraceCheckUtils]: 7: Hoare triple {490#true} ~cond := #in~cond; {490#true} is VALID [2020-07-08 12:48:36,567 INFO L280 TraceCheckUtils]: 8: Hoare triple {490#true} assume !(0 == ~cond); {490#true} is VALID [2020-07-08 12:48:36,567 INFO L280 TraceCheckUtils]: 9: Hoare triple {490#true} assume true; {490#true} is VALID [2020-07-08 12:48:36,568 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {490#true} {490#true} #50#return; {490#true} is VALID [2020-07-08 12:48:36,568 INFO L280 TraceCheckUtils]: 11: Hoare triple {490#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {490#true} is VALID [2020-07-08 12:48:36,568 INFO L280 TraceCheckUtils]: 12: Hoare triple {490#true} assume !false; {490#true} is VALID [2020-07-08 12:48:36,568 INFO L263 TraceCheckUtils]: 13: Hoare triple {490#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {490#true} is VALID [2020-07-08 12:48:36,569 INFO L280 TraceCheckUtils]: 14: Hoare triple {490#true} ~cond := #in~cond; {537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:48:36,570 INFO L280 TraceCheckUtils]: 15: Hoare triple {537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {541#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:48:36,571 INFO L280 TraceCheckUtils]: 16: Hoare triple {541#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {541#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:48:36,572 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {541#(not (= 0 |__VERIFIER_assert_#in~cond|))} {490#true} #50#return; {548#(= (+ (* main_~x~0 main_~z~0) main_~a~0) (+ main_~x~0 (* main_~y~0 main_~z~0 main_~a~0)))} is VALID [2020-07-08 12:48:36,573 INFO L280 TraceCheckUtils]: 18: Hoare triple {548#(= (+ (* main_~x~0 main_~z~0) main_~a~0) (+ main_~x~0 (* main_~y~0 main_~z~0 main_~a~0)))} assume !(~c~0 < ~k~0); {548#(= (+ (* main_~x~0 main_~z~0) main_~a~0) (+ main_~x~0 (* main_~y~0 main_~z~0 main_~a~0)))} is VALID [2020-07-08 12:48:36,574 INFO L263 TraceCheckUtils]: 19: Hoare triple {548#(= (+ (* main_~x~0 main_~z~0) main_~a~0) (+ main_~x~0 (* main_~y~0 main_~z~0 main_~a~0)))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {555#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:48:36,575 INFO L280 TraceCheckUtils]: 20: Hoare triple {555#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {559#(= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:48:36,576 INFO L280 TraceCheckUtils]: 21: Hoare triple {559#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {491#false} is VALID [2020-07-08 12:48:36,576 INFO L280 TraceCheckUtils]: 22: Hoare triple {491#false} assume !false; {491#false} is VALID [2020-07-08 12:48:36,577 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-08 12:48:36,578 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95769395] [2020-07-08 12:48:36,578 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:48:36,578 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815775410] [2020-07-08 12:48:36,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:48:36,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-08 12:48:36,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300805723] [2020-07-08 12:48:36,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-08 12:48:36,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:36,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:48:36,612 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-08 12:48:36,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:48:36,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:36,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:48:36,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:48:36,613 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2020-07-08 12:48:41,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:41,126 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-08 12:48:41,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:48:41,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-08 12:48:41,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:48:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:48:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2020-07-08 12:48:41,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:48:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2020-07-08 12:48:41,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 24 transitions. [2020-07-08 12:48:41,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:48:41,182 INFO L225 Difference]: With dead ends: 34 [2020-07-08 12:48:41,182 INFO L226 Difference]: Without dead ends: 27 [2020-07-08 12:48:41,183 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-08 12:48:41,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-08 12:48:41,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-08 12:48:41,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:48:41,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-08 12:48:41,207 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-08 12:48:41,207 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-08 12:48:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:41,212 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-08 12:48:41,212 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-08 12:48:41,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:41,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:41,216 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-08 12:48:41,216 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-08 12:48:41,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:41,219 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-08 12:48:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-08 12:48:41,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:41,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:41,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:48:41,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:48:41,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-08 12:48:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-07-08 12:48:41,223 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2020-07-08 12:48:41,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:48:41,224 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-07-08 12:48:41,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:48:41,224 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-08 12:48:41,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 12:48:41,228 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:41,228 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:48:41,438 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:48:41,439 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:41,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:41,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1538749201, now seen corresponding path program 2 times [2020-07-08 12:48:41,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:41,441 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907011300] [2020-07-08 12:48:41,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:41,455 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:48:41,459 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [924354998] [2020-07-08 12:48:41,459 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:48:41,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:48:41,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:48:41,516 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 29 conjunts are in the unsatisfiable core [2020-07-08 12:48:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-08 12:48:43,574 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:48:47,913 WARN L193 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 14 [2020-07-08 12:48:48,351 INFO L263 TraceCheckUtils]: 0: Hoare triple {712#true} call ULTIMATE.init(); {712#true} is VALID [2020-07-08 12:48:48,351 INFO L280 TraceCheckUtils]: 1: Hoare triple {712#true} assume true; {712#true} is VALID [2020-07-08 12:48:48,352 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {712#true} {712#true} #46#return; {712#true} is VALID [2020-07-08 12:48:48,352 INFO L263 TraceCheckUtils]: 3: Hoare triple {712#true} call #t~ret3 := main(); {712#true} is VALID [2020-07-08 12:48:48,354 INFO L280 TraceCheckUtils]: 4: Hoare triple {712#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1; {729#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2020-07-08 12:48:48,355 INFO L280 TraceCheckUtils]: 5: Hoare triple {729#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {729#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2020-07-08 12:48:48,355 INFO L263 TraceCheckUtils]: 6: Hoare triple {729#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {712#true} is VALID [2020-07-08 12:48:48,356 INFO L280 TraceCheckUtils]: 7: Hoare triple {712#true} ~cond := #in~cond; {739#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:48:48,357 INFO L280 TraceCheckUtils]: 8: Hoare triple {739#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {743#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:48:48,357 INFO L280 TraceCheckUtils]: 9: Hoare triple {743#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {743#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:48:48,358 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {743#(not (= 0 |__VERIFIER_assert_#in~cond|))} {729#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} #50#return; {729#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2020-07-08 12:48:48,363 INFO L280 TraceCheckUtils]: 11: Hoare triple {729#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {753#(and (= (+ (* main_~z~0 main_~a~0) main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))} is VALID [2020-07-08 12:48:48,368 INFO L280 TraceCheckUtils]: 12: Hoare triple {753#(and (= (+ (* main_~z~0 main_~a~0) main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))} assume !false; {753#(and (= (+ (* main_~z~0 main_~a~0) main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))} is VALID [2020-07-08 12:48:48,369 INFO L263 TraceCheckUtils]: 13: Hoare triple {753#(and (= (+ (* main_~z~0 main_~a~0) main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {712#true} is VALID [2020-07-08 12:48:48,371 INFO L280 TraceCheckUtils]: 14: Hoare triple {712#true} ~cond := #in~cond; {739#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:48:48,371 INFO L280 TraceCheckUtils]: 15: Hoare triple {739#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {743#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:48:48,372 INFO L280 TraceCheckUtils]: 16: Hoare triple {743#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {743#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:48:48,373 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {743#(not (= 0 |__VERIFIER_assert_#in~cond|))} {753#(and (= (+ (* main_~z~0 main_~a~0) main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))} #50#return; {772#(and (= (+ (* main_~x~0 main_~z~0) main_~a~0) (+ main_~x~0 (* main_~y~0 main_~z~0 main_~a~0))) (= (+ (* main_~z~0 main_~a~0) main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))} is VALID [2020-07-08 12:48:48,379 INFO L280 TraceCheckUtils]: 18: Hoare triple {772#(and (= (+ (* main_~x~0 main_~z~0) main_~a~0) (+ main_~x~0 (* main_~y~0 main_~z~0 main_~a~0))) (= (+ (* main_~z~0 main_~a~0) main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {776#(and (= main_~x~0 (+ (* main_~z~0 main_~z~0 main_~a~0) (* main_~z~0 main_~a~0) main_~a~0)) (= main_~y~0 (* main_~z~0 main_~z~0)))} is VALID [2020-07-08 12:48:48,380 INFO L280 TraceCheckUtils]: 19: Hoare triple {776#(and (= main_~x~0 (+ (* main_~z~0 main_~z~0 main_~a~0) (* main_~z~0 main_~a~0) main_~a~0)) (= main_~y~0 (* main_~z~0 main_~z~0)))} assume !false; {776#(and (= main_~x~0 (+ (* main_~z~0 main_~z~0 main_~a~0) (* main_~z~0 main_~a~0) main_~a~0)) (= main_~y~0 (* main_~z~0 main_~z~0)))} is VALID [2020-07-08 12:48:50,413 INFO L263 TraceCheckUtils]: 20: Hoare triple {776#(and (= main_~x~0 (+ (* main_~z~0 main_~z~0 main_~a~0) (* main_~z~0 main_~a~0) main_~a~0)) (= main_~y~0 (* main_~z~0 main_~z~0)))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {783#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2020-07-08 12:48:50,414 INFO L280 TraceCheckUtils]: 21: Hoare triple {783#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {787#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:48:50,415 INFO L280 TraceCheckUtils]: 22: Hoare triple {787#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {713#false} is VALID [2020-07-08 12:48:50,415 INFO L280 TraceCheckUtils]: 23: Hoare triple {713#false} assume !false; {713#false} is VALID [2020-07-08 12:48:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-08 12:48:50,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907011300] [2020-07-08 12:48:50,418 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:48:50,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924354998] [2020-07-08 12:48:50,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:48:50,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-08 12:48:50,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583209667] [2020-07-08 12:48:50,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-08 12:48:50,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:50,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 12:48:52,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 20 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-08 12:48:52,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 12:48:52,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:52,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 12:48:52,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2020-07-08 12:48:52,497 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 10 states. [2020-07-08 12:49:15,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:49:15,746 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2020-07-08 12:49:15,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 12:49:15,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-08 12:49:15,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:49:15,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:49:15,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2020-07-08 12:49:15,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:49:15,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2020-07-08 12:49:15,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 31 transitions. [2020-07-08 12:49:17,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-08 12:49:17,888 INFO L225 Difference]: With dead ends: 37 [2020-07-08 12:49:17,889 INFO L226 Difference]: Without dead ends: 35 [2020-07-08 12:49:17,889 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=30, Invalid=101, Unknown=1, NotChecked=0, Total=132 [2020-07-08 12:49:17,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-08 12:49:17,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-07-08 12:49:17,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:49:17,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2020-07-08 12:49:17,912 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2020-07-08 12:49:17,912 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2020-07-08 12:49:17,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:49:17,916 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-08 12:49:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-08 12:49:17,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:49:17,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:49:17,917 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2020-07-08 12:49:17,917 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2020-07-08 12:49:17,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:49:17,922 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-08 12:49:17,922 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-08 12:49:17,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:49:17,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:49:17,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:49:17,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:49:17,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-08 12:49:17,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2020-07-08 12:49:17,927 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2020-07-08 12:49:17,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:49:17,928 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2020-07-08 12:49:17,928 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 12:49:17,928 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-08 12:49:17,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 12:49:17,929 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:49:17,929 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:49:18,133 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:49:18,133 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:49:18,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:49:18,134 INFO L82 PathProgramCache]: Analyzing trace with hash -695576914, now seen corresponding path program 3 times [2020-07-08 12:49:18,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:49:18,135 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936298258] [2020-07-08 12:49:18,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:49:18,143 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:49:18,143 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1174260923] [2020-07-08 12:49:18,143 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:49:18,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-08 12:49:18,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:49:18,180 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-08 12:49:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-08 12:49:20,242 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:49:25,636 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:49:31,845 WARN L838 $PredicateComparison]: unable to prove that (or (<= 1 |c___VERIFIER_assert_#in~cond|) (and (<= 0 |c___VERIFIER_assert_#in~cond|) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_BEFORE_CALL_8 Int) (v_main_~x~0_14 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14)) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) v_main_~x~0_BEFORE_CALL_8) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) v_main_~x~0_14)))))) is different from false [2020-07-08 12:49:31,867 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:49:55,090 WARN L193 SmtUtils]: Spent 12.28 s on a formula simplification that was a NOOP. DAG size: 26 [2020-07-08 12:49:57,155 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:50:05,426 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_BEFORE_CALL_8 Int) (v_main_~x~0_14 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14)) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) v_main_~x~0_BEFORE_CALL_8) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) v_main_~x~0_14)))) is different from false [2020-07-08 12:50:07,473 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_BEFORE_CALL_8 Int) (v_main_~x~0_14 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14)) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) v_main_~x~0_BEFORE_CALL_8) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) v_main_~x~0_14)))) is different from true [2020-07-08 12:50:07,474 INFO L263 TraceCheckUtils]: 0: Hoare triple {970#true} call ULTIMATE.init(); {970#true} is VALID [2020-07-08 12:50:07,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {970#true} assume true; {970#true} is VALID [2020-07-08 12:50:07,475 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {970#true} {970#true} #46#return; {970#true} is VALID [2020-07-08 12:50:07,475 INFO L263 TraceCheckUtils]: 3: Hoare triple {970#true} call #t~ret3 := main(); {970#true} is VALID [2020-07-08 12:50:07,475 INFO L280 TraceCheckUtils]: 4: Hoare triple {970#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1; {970#true} is VALID [2020-07-08 12:50:07,475 INFO L280 TraceCheckUtils]: 5: Hoare triple {970#true} assume !false; {970#true} is VALID [2020-07-08 12:50:07,476 INFO L263 TraceCheckUtils]: 6: Hoare triple {970#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {970#true} is VALID [2020-07-08 12:50:07,476 INFO L280 TraceCheckUtils]: 7: Hoare triple {970#true} ~cond := #in~cond; {970#true} is VALID [2020-07-08 12:50:07,476 INFO L280 TraceCheckUtils]: 8: Hoare triple {970#true} assume !(0 == ~cond); {970#true} is VALID [2020-07-08 12:50:07,476 INFO L280 TraceCheckUtils]: 9: Hoare triple {970#true} assume true; {970#true} is VALID [2020-07-08 12:50:07,477 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {970#true} {970#true} #50#return; {970#true} is VALID [2020-07-08 12:50:07,477 INFO L280 TraceCheckUtils]: 11: Hoare triple {970#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {970#true} is VALID [2020-07-08 12:50:07,477 INFO L280 TraceCheckUtils]: 12: Hoare triple {970#true} assume !false; {970#true} is VALID [2020-07-08 12:50:07,477 INFO L263 TraceCheckUtils]: 13: Hoare triple {970#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {970#true} is VALID [2020-07-08 12:50:07,478 INFO L280 TraceCheckUtils]: 14: Hoare triple {970#true} ~cond := #in~cond; {970#true} is VALID [2020-07-08 12:50:07,479 INFO L280 TraceCheckUtils]: 15: Hoare triple {970#true} assume !(0 == ~cond); {970#true} is VALID [2020-07-08 12:50:07,479 INFO L280 TraceCheckUtils]: 16: Hoare triple {970#true} assume true; {970#true} is VALID [2020-07-08 12:50:07,480 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {970#true} {970#true} #50#return; {970#true} is VALID [2020-07-08 12:50:07,480 INFO L280 TraceCheckUtils]: 18: Hoare triple {970#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {970#true} is VALID [2020-07-08 12:50:07,481 INFO L280 TraceCheckUtils]: 19: Hoare triple {970#true} assume !false; {970#true} is VALID [2020-07-08 12:50:07,481 INFO L263 TraceCheckUtils]: 20: Hoare triple {970#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {970#true} is VALID [2020-07-08 12:50:07,482 INFO L280 TraceCheckUtils]: 21: Hoare triple {970#true} ~cond := #in~cond; {1038#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:50:07,483 INFO L280 TraceCheckUtils]: 22: Hoare triple {1038#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1042#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:50:07,484 INFO L280 TraceCheckUtils]: 23: Hoare triple {1042#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {1042#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:50:07,485 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1042#(not (= 0 |__VERIFIER_assert_#in~cond|))} {970#true} #50#return; {1049#(= (+ (* main_~x~0 main_~z~0) main_~a~0) (+ main_~x~0 (* main_~y~0 main_~z~0 main_~a~0)))} is VALID [2020-07-08 12:50:07,501 INFO L280 TraceCheckUtils]: 25: Hoare triple {1049#(= (+ (* main_~x~0 main_~z~0) main_~a~0) (+ main_~x~0 (* main_~y~0 main_~z~0 main_~a~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1053#(exists ((v_main_~y~0_13 Int) (v_main_~x~0_14 Int)) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= (+ (* main_~z~0 v_main_~y~0_13 main_~a~0) v_main_~x~0_14) (+ (* main_~z~0 v_main_~x~0_14) main_~a~0)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_14) main_~a~0))))} is VALID [2020-07-08 12:50:07,503 INFO L280 TraceCheckUtils]: 26: Hoare triple {1053#(exists ((v_main_~y~0_13 Int) (v_main_~x~0_14 Int)) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= (+ (* main_~z~0 v_main_~y~0_13 main_~a~0) v_main_~x~0_14) (+ (* main_~z~0 v_main_~x~0_14) main_~a~0)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_14) main_~a~0))))} assume !false; {1053#(exists ((v_main_~y~0_13 Int) (v_main_~x~0_14 Int)) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= (+ (* main_~z~0 v_main_~y~0_13 main_~a~0) v_main_~x~0_14) (+ (* main_~z~0 v_main_~x~0_14) main_~a~0)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_14) main_~a~0))))} is VALID [2020-07-08 12:50:09,572 INFO L263 TraceCheckUtils]: 27: Hoare triple {1053#(exists ((v_main_~y~0_13 Int) (v_main_~x~0_14 Int)) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= (+ (* main_~z~0 v_main_~y~0_13 main_~a~0) v_main_~x~0_14) (+ (* main_~z~0 v_main_~x~0_14) main_~a~0)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_14) main_~a~0))))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {1060#(or (<= 1 |__VERIFIER_assert_#in~cond|) (and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_BEFORE_CALL_8 Int) (v_main_~x~0_14 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14)) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) v_main_~x~0_BEFORE_CALL_8) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) v_main_~x~0_14))))))} is UNKNOWN [2020-07-08 12:50:09,573 INFO L280 TraceCheckUtils]: 28: Hoare triple {1060#(or (<= 1 |__VERIFIER_assert_#in~cond|) (and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_BEFORE_CALL_8 Int) (v_main_~x~0_14 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14)) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) v_main_~x~0_BEFORE_CALL_8) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) v_main_~x~0_14))))))} ~cond := #in~cond; {1064#(or (<= 1 __VERIFIER_assert_~cond) (and (<= 0 __VERIFIER_assert_~cond) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_BEFORE_CALL_8 Int) (v_main_~x~0_14 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14)) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) v_main_~x~0_BEFORE_CALL_8) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) v_main_~x~0_14))))))} is VALID [2020-07-08 12:50:09,581 INFO L280 TraceCheckUtils]: 29: Hoare triple {1064#(or (<= 1 __VERIFIER_assert_~cond) (and (<= 0 __VERIFIER_assert_~cond) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_BEFORE_CALL_8 Int) (v_main_~x~0_14 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14)) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) v_main_~x~0_BEFORE_CALL_8) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) v_main_~x~0_14))))))} assume 0 == ~cond; {1068#(exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_BEFORE_CALL_8 Int) (v_main_~x~0_14 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14)) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) v_main_~x~0_BEFORE_CALL_8) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) v_main_~x~0_14))))} is VALID [2020-07-08 12:50:11,609 INFO L280 TraceCheckUtils]: 30: Hoare triple {1068#(exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_BEFORE_CALL_8 Int) (v_main_~x~0_14 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14)) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) v_main_~x~0_BEFORE_CALL_8) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) v_main_~x~0_14))))} assume !false; {971#false} is UNKNOWN [2020-07-08 12:50:11,612 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-08 12:50:11,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936298258] [2020-07-08 12:50:11,613 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:50:11,613 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174260923] [2020-07-08 12:50:11,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:50:11,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-08 12:50:11,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852007498] [2020-07-08 12:50:11,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2020-07-08 12:50:11,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:50:11,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 12:50:19,924 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 18 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2020-07-08 12:50:19,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 12:50:19,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:50:19,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 12:50:19,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=31, Unknown=4, NotChecked=22, Total=72 [2020-07-08 12:50:19,926 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 9 states. [2020-07-08 12:51:43,573 WARN L193 SmtUtils]: Spent 15.86 s on a formula simplification that was a NOOP. DAG size: 29 [2020-07-08 12:51:52,141 WARN L193 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 31 DAG size of output: 6 [2020-07-08 12:52:02,168 WARN L193 SmtUtils]: Spent 3.79 s on a formula simplification that was a NOOP. DAG size: 22 [2020-07-08 12:52:12,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:52:12,558 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-08 12:52:12,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 12:52:12,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2020-07-08 12:52:12,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:52:12,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:52:12,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2020-07-08 12:52:12,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:52:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2020-07-08 12:52:12,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 21 transitions. [2020-07-08 12:52:20,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 17 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2020-07-08 12:52:20,826 INFO L225 Difference]: With dead ends: 34 [2020-07-08 12:52:20,826 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:52:20,827 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 62.4s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=8, NotChecked=38, Total=156 [2020-07-08 12:52:20,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:52:20,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:52:20,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:52:20,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:52:20,828 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:52:20,828 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:52:20,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:52:20,828 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:52:20,828 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:52:20,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:52:20,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:52:20,829 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:52:20,829 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:52:20,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:52:20,829 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:52:20,829 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:52:20,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:52:20,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:52:20,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:52:20,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:52:20,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:52:20,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:52:20,830 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2020-07-08 12:52:20,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:52:20,830 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:52:20,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 12:52:20,830 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:52:20,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:52:21,032 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-08 12:52:21,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:52:22,892 WARN L193 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2020-07-08 12:52:25,518 WARN L193 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2020-07-08 12:52:31,615 WARN L193 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 33 DAG size of output: 1 [2020-07-08 12:52:35,895 WARN L193 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2020-07-08 12:52:35,902 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 12:52:35,902 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:52:35,902 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:52:35,902 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:52:35,903 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:52:35,903 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:52:35,903 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 9 11) no Hoare annotation was computed. [2020-07-08 12:52:35,903 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-08 12:52:35,903 INFO L268 CegarLoopResult]: For program point L10-2(lines 9 11) no Hoare annotation was computed. [2020-07-08 12:52:35,903 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 9 11) no Hoare annotation was computed. [2020-07-08 12:52:35,903 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (or (exists ((v_main_~y~0_13 Int) (v_main_~x~0_14 Int)) (let ((.cse0 (+ (* main_~z~0 v_main_~x~0_14) main_~a~0))) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= (+ (* main_~z~0 v_main_~y~0_13 main_~a~0) v_main_~x~0_14) .cse0) (= main_~x~0 .cse0)))) (and (= 1 main_~y~0) (= main_~a~0 main_~x~0))) [2020-07-08 12:52:35,904 INFO L268 CegarLoopResult]: For program point L31-1(lines 30 39) no Hoare annotation was computed. [2020-07-08 12:52:35,904 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 19 42) the Hoare annotation is: true [2020-07-08 12:52:35,904 INFO L264 CegarLoopResult]: At program point L30-2(lines 30 39) the Hoare annotation is: (or (exists ((v_main_~y~0_13 Int) (v_main_~x~0_14 Int)) (let ((.cse0 (+ (* main_~z~0 v_main_~x~0_14) main_~a~0))) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= (+ (* main_~z~0 v_main_~y~0_13 main_~a~0) v_main_~x~0_14) .cse0) (= main_~x~0 .cse0)))) (and (= 1 main_~y~0) (= main_~a~0 main_~x~0))) [2020-07-08 12:52:35,904 INFO L264 CegarLoopResult]: At program point L30-3(lines 30 39) the Hoare annotation is: (= (+ main_~a~0 (* main_~x~0 main_~z~0)) (+ main_~x~0 (* main_~y~0 main_~z~0 main_~a~0))) [2020-07-08 12:52:35,904 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 19 42) no Hoare annotation was computed. [2020-07-08 12:52:35,904 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 19 42) no Hoare annotation was computed. [2020-07-08 12:52:35,904 INFO L268 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2020-07-08 12:52:35,905 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 12 18) the Hoare annotation is: true [2020-07-08 12:52:35,905 INFO L268 CegarLoopResult]: For program point L14(lines 14 15) no Hoare annotation was computed. [2020-07-08 12:52:35,905 INFO L268 CegarLoopResult]: For program point L13(lines 13 16) no Hoare annotation was computed. [2020-07-08 12:52:35,905 INFO L268 CegarLoopResult]: For program point L13-2(lines 12 18) no Hoare annotation was computed. [2020-07-08 12:52:35,905 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 12 18) no Hoare annotation was computed. [2020-07-08 12:52:35,905 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2020-07-08 12:52:35,910 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:52:35,910 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 12:52:35,913 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:52:35,914 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:52:35,914 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:52:35,914 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-08 12:52:35,914 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-08 12:52:35,918 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:52:35,919 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:52:35,919 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:52:35,919 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2020-07-08 12:52:35,919 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-08 12:52:35,919 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-08 12:52:35,919 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 12:52:35,919 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 12:52:35,920 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-08 12:52:35,920 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-08 12:52:35,920 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-08 12:52:35,920 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-08 12:52:35,920 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:52:35,920 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:52:35,920 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:52:35,920 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:52:35,920 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-08 12:52:35,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-08 12:52:35,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-08 12:52:35,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2020-07-08 12:52:35,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2020-07-08 12:52:35,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2020-07-08 12:52:35,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-08 12:52:35,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-08 12:52:35,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2020-07-08 12:52:35,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2020-07-08 12:52:35,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2020-07-08 12:52:35,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:52:35 BoogieIcfgContainer [2020-07-08 12:52:35,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:52:35,937 INFO L168 Benchmark]: Toolchain (without parser) took 262028.49 ms. Allocated memory was 138.4 MB in the beginning and 269.5 MB in the end (delta: 131.1 MB). Free memory was 102.2 MB in the beginning and 181.6 MB in the end (delta: -79.4 MB). Peak memory consumption was 51.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:52:35,938 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 12:52:35,939 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.29 ms. Allocated memory is still 138.4 MB. Free memory was 102.0 MB in the beginning and 91.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:52:35,940 INFO L168 Benchmark]: Boogie Preprocessor took 99.14 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 91.9 MB in the beginning and 181.9 MB in the end (delta: -89.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:52:35,941 INFO L168 Benchmark]: RCFGBuilder took 375.72 ms. Allocated memory is still 201.9 MB. Free memory was 181.9 MB in the beginning and 164.1 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 7.1 GB. [2020-07-08 12:52:35,941 INFO L168 Benchmark]: TraceAbstraction took 261303.94 ms. Allocated memory was 201.9 MB in the beginning and 269.5 MB in the end (delta: 67.6 MB). Free memory was 163.5 MB in the beginning and 181.6 MB in the end (delta: -18.1 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2020-07-08 12:52:35,945 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.25 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 244.29 ms. Allocated memory is still 138.4 MB. Free memory was 102.0 MB in the beginning and 91.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 99.14 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 91.9 MB in the beginning and 181.9 MB in the end (delta: -89.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 375.72 ms. Allocated memory is still 201.9 MB. Free memory was 181.9 MB in the beginning and 164.1 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 261303.94 ms. Allocated memory was 201.9 MB in the beginning and 269.5 MB in the end (delta: 67.6 MB). Free memory was 163.5 MB in the beginning and 181.6 MB in the end (delta: -18.1 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant [2020-07-08 12:52:35,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-08 12:52:35,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-08 12:52:35,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2020-07-08 12:52:35,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2020-07-08 12:52:35,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2020-07-08 12:52:35,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-08 12:52:35,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-08 12:52:35,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2020-07-08 12:52:35,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2020-07-08 12:52:35,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] Derived loop invariant: (\exists v_main_~y~0_13 : int, v_main_~x~0_14 : int :: (y == z * v_main_~y~0_13 && z * v_main_~y~0_13 * a + v_main_~x~0_14 == z * v_main_~x~0_14 + a) && x == z * v_main_~x~0_14 + a) || (1 == y && a == x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 246.3s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 164.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 82 SDtfs, 50 SDslu, 243 SDs, 0 SdLazy, 193 SolverSat, 10 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 35.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 67.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 15 PreInvPairs, 25 NumberOfFragments, 85 HoareAnnotationTreeSize, 15 FomulaSimplifications, 252 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 123 FormulaSimplificationTreeSizeReductionInter, 12.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 67.1s InterpolantComputationTime, 115 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 109 ConstructedInterpolants, 5 QuantifiedInterpolants, 12389 SizeOfPredicates, 16 NumberOfNonLiveVariables, 285 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 49/63 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...