/usr/bin/java -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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/nla-digbench/egcd.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:36:21,020 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:36:21,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:36:21,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:36:21,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:36:21,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:36:21,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:36:21,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:36:21,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:36:21,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:36:21,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:36:21,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:36:21,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:36:21,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:36:21,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:36:21,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:36:21,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:36:21,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:36:21,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:36:21,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:36:21,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:36:21,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:36:21,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:36:21,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:36:21,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:36:21,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:36:21,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:36:21,075 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:36:21,076 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:36:21,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:36:21,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:36:21,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:36:21,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:36:21,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:36:21,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:36:21,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:36:21,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:36:21,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:36:21,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:36:21,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:36:21,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:36:21,084 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 [2019-11-07 00:36:21,097 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:36:21,098 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:36:21,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:36:21,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:36:21,099 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:36:21,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:36:21,100 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:36:21,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:36:21,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:36:21,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:36:21,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:36:21,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:36:21,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:36:21,101 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:36:21,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:36:21,101 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:36:21,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:36:21,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:36:21,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:36:21,102 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:36:21,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:36:21,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:36:21,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:36:21,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:36:21,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:36:21,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:36:21,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:36:21,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:36:21,104 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 00:36:21,375 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:36:21,388 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:36:21,391 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:36:21,393 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:36:21,393 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:36:21,394 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/egcd.c [2019-11-07 00:36:21,454 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/655af45b9/f3590c17ef1b4a63b7884ff5663daa6b/FLAGedd4eb426 [2019-11-07 00:36:21,901 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:36:21,902 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/egcd.c [2019-11-07 00:36:21,908 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/655af45b9/f3590c17ef1b4a63b7884ff5663daa6b/FLAGedd4eb426 [2019-11-07 00:36:22,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/655af45b9/f3590c17ef1b4a63b7884ff5663daa6b [2019-11-07 00:36:22,318 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:36:22,320 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:36:22,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:36:22,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:36:22,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:36:22,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:36:22" (1/1) ... [2019-11-07 00:36:22,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1172a0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:22, skipping insertion in model container [2019-11-07 00:36:22,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:36:22" (1/1) ... [2019-11-07 00:36:22,337 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:36:22,360 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:36:22,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:36:22,561 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:36:22,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:36:22,592 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:36:22,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:22 WrapperNode [2019-11-07 00:36:22,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:36:22,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:36:22,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:36:22,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:36:22,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:22" (1/1) ... [2019-11-07 00:36:22,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:22" (1/1) ... [2019-11-07 00:36:22,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:22" (1/1) ... [2019-11-07 00:36:22,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:22" (1/1) ... [2019-11-07 00:36:22,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:22" (1/1) ... [2019-11-07 00:36:22,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:22" (1/1) ... [2019-11-07 00:36:22,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:22" (1/1) ... [2019-11-07 00:36:22,714 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:36:22,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:36:22,715 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:36:22,715 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:36:22,716 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:22" (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 [2019-11-07 00:36:22,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:36:22,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:36:22,768 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-07 00:36:22,768 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:36:22,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:36:22,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:36:22,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 00:36:22,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 00:36:22,769 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:36:22,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:36:22,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:36:22,988 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:36:22,988 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 00:36:22,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:36:22 BoogieIcfgContainer [2019-11-07 00:36:22,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:36:23,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:36:23,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:36:23,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:36:23,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:36:22" (1/3) ... [2019-11-07 00:36:23,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29fbfdf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:36:23, skipping insertion in model container [2019-11-07 00:36:23,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:22" (2/3) ... [2019-11-07 00:36:23,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29fbfdf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:36:23, skipping insertion in model container [2019-11-07 00:36:23,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:36:22" (3/3) ... [2019-11-07 00:36:23,021 INFO L109 eAbstractionObserver]: Analyzing ICFG egcd.c [2019-11-07 00:36:23,043 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:36:23,054 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:36:23,065 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:36:23,100 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:36:23,101 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:36:23,101 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:36:23,102 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:36:23,102 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:36:23,102 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:36:23,103 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:36:23,103 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:36:23,123 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-11-07 00:36:23,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-07 00:36:23,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:36:23,129 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:36:23,131 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:36:23,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:36:23,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1589353370, now seen corresponding path program 1 times [2019-11-07 00:36:23,147 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:36:23,147 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661029412] [2019-11-07 00:36:23,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:36:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:36:23,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:36:23,260 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661029412] [2019-11-07 00:36:23,261 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:36:23,261 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-07 00:36:23,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753296026] [2019-11-07 00:36:23,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-07 00:36:23,269 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:36:23,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-07 00:36:23,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 00:36:23,287 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-11-07 00:36:23,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:36:23,312 INFO L93 Difference]: Finished difference Result 47 states and 74 transitions. [2019-11-07 00:36:23,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-07 00:36:23,313 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-07 00:36:23,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:36:23,321 INFO L225 Difference]: With dead ends: 47 [2019-11-07 00:36:23,321 INFO L226 Difference]: Without dead ends: 21 [2019-11-07 00:36:23,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 00:36:23,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-07 00:36:23,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-07 00:36:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-07 00:36:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-11-07 00:36:23,370 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 10 [2019-11-07 00:36:23,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:36:23,370 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-07 00:36:23,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-07 00:36:23,371 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2019-11-07 00:36:23,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-07 00:36:23,371 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:36:23,372 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:36:23,372 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:36:23,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:36:23,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1587685074, now seen corresponding path program 1 times [2019-11-07 00:36:23,373 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:36:23,373 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114413267] [2019-11-07 00:36:23,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:36:23,384 ERROR L268 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-07 00:36:23,384 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [863194612] [2019-11-07 00:36:23,385 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 [2019-11-07 00:36:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:36:23,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-07 00:36:23,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:36:23,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:36:23,531 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:36:23,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:36:23,607 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114413267] [2019-11-07 00:36:23,607 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:36:23,607 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863194612] [2019-11-07 00:36:23,608 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:36:23,608 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-07 00:36:23,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543399737] [2019-11-07 00:36:23,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 00:36:23,610 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:36:23,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 00:36:23,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:36:23,612 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand 8 states. [2019-11-07 00:36:23,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:36:23,739 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-11-07 00:36:23,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:36:23,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-11-07 00:36:23,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:36:23,741 INFO L225 Difference]: With dead ends: 37 [2019-11-07 00:36:23,742 INFO L226 Difference]: Without dead ends: 35 [2019-11-07 00:36:23,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:36:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-07 00:36:23,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-11-07 00:36:23,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-07 00:36:23,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2019-11-07 00:36:23,768 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 10 [2019-11-07 00:36:23,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:36:23,768 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2019-11-07 00:36:23,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 00:36:23,769 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2019-11-07 00:36:23,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 00:36:23,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:36:23,772 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:36:23,972 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:36:23,973 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:36:23,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:36:23,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1592529048, now seen corresponding path program 1 times [2019-11-07 00:36:23,975 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:36:23,976 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432221335] [2019-11-07 00:36:23,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:36:23,985 ERROR L268 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-07 00:36:23,985 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [882044166] [2019-11-07 00:36:23,986 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 [2019-11-07 00:36:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:36:24,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-07 00:36:24,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:36:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:36:24,082 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:36:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:36:24,156 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432221335] [2019-11-07 00:36:24,156 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:36:24,157 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882044166] [2019-11-07 00:36:24,157 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:36:24,157 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-07 00:36:24,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120252804] [2019-11-07 00:36:24,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 00:36:24,158 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:36:24,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 00:36:24,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:36:24,160 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 8 states. [2019-11-07 00:36:24,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:36:24,305 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2019-11-07 00:36:24,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:36:24,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-07 00:36:24,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:36:24,308 INFO L225 Difference]: With dead ends: 41 [2019-11-07 00:36:24,309 INFO L226 Difference]: Without dead ends: 39 [2019-11-07 00:36:24,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:36:24,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-07 00:36:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-11-07 00:36:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-07 00:36:24,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2019-11-07 00:36:24,335 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 15 [2019-11-07 00:36:24,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:36:24,337 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2019-11-07 00:36:24,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 00:36:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2019-11-07 00:36:24,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 00:36:24,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:36:24,338 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:36:24,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:36:24,543 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:36:24,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:36:24,544 INFO L82 PathProgramCache]: Analyzing trace with hash 2040988462, now seen corresponding path program 1 times [2019-11-07 00:36:24,545 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:36:24,545 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363126897] [2019-11-07 00:36:24,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:36:24,554 ERROR L268 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-07 00:36:24,554 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [518439354] [2019-11-07 00:36:24,555 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 [2019-11-07 00:36:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:36:24,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-07 00:36:24,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:36:24,634 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 00:36:24,634 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:36:24,691 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 00:36:24,692 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363126897] [2019-11-07 00:36:24,692 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:36:24,692 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518439354] [2019-11-07 00:36:24,692 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:36:24,692 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-07 00:36:24,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202618992] [2019-11-07 00:36:24,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 00:36:24,694 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:36:24,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 00:36:24,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:36:24,696 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand 8 states. [2019-11-07 00:36:24,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:36:24,794 INFO L93 Difference]: Finished difference Result 63 states and 91 transitions. [2019-11-07 00:36:24,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:36:24,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-11-07 00:36:24,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:36:24,799 INFO L225 Difference]: With dead ends: 63 [2019-11-07 00:36:24,799 INFO L226 Difference]: Without dead ends: 59 [2019-11-07 00:36:24,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:36:24,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-07 00:36:24,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-07 00:36:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-07 00:36:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2019-11-07 00:36:24,820 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 20 [2019-11-07 00:36:24,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:36:24,822 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2019-11-07 00:36:24,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 00:36:24,822 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2019-11-07 00:36:24,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-07 00:36:24,823 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:36:24,824 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:36:25,027 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:36:25,030 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:36:25,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:36:25,030 INFO L82 PathProgramCache]: Analyzing trace with hash 113727669, now seen corresponding path program 1 times [2019-11-07 00:36:25,031 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:36:25,031 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205542132] [2019-11-07 00:36:25,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:36:25,039 ERROR L268 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-07 00:36:25,040 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1715500270] [2019-11-07 00:36:25,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:36:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:36:25,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-07 00:36:25,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:36:25,101 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:36:25,101 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:36:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:36:25,142 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205542132] [2019-11-07 00:36:25,142 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:36:25,143 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715500270] [2019-11-07 00:36:25,144 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:36:25,144 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-07 00:36:25,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434619687] [2019-11-07 00:36:25,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 00:36:25,145 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:36:25,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 00:36:25,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:36:25,146 INFO L87 Difference]: Start difference. First operand 59 states and 84 transitions. Second operand 7 states. [2019-11-07 00:36:25,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:36:25,215 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2019-11-07 00:36:25,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:36:25,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-07 00:36:25,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:36:25,219 INFO L225 Difference]: With dead ends: 65 [2019-11-07 00:36:25,219 INFO L226 Difference]: Without dead ends: 63 [2019-11-07 00:36:25,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:36:25,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-07 00:36:25,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-07 00:36:25,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-07 00:36:25,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2019-11-07 00:36:25,248 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 26 [2019-11-07 00:36:25,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:36:25,248 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2019-11-07 00:36:25,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 00:36:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2019-11-07 00:36:25,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 00:36:25,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:36:25,251 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:36:25,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:36:25,454 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:36:25,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:36:25,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1597054094, now seen corresponding path program 1 times [2019-11-07 00:36:25,455 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:36:25,455 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137520212] [2019-11-07 00:36:25,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:36:25,463 ERROR L268 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-07 00:36:25,464 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [221984523] [2019-11-07 00:36:25,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-07 00:36:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:36:25,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-07 00:36:25,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:36:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-07 00:36:25,539 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:36:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-07 00:36:25,617 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137520212] [2019-11-07 00:36:25,617 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:36:25,617 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221984523] [2019-11-07 00:36:25,617 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:36:25,618 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-07 00:36:25,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962993180] [2019-11-07 00:36:25,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 00:36:25,619 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:36:25,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 00:36:25,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:36:25,619 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand 8 states. [2019-11-07 00:36:25,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:36:25,689 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2019-11-07 00:36:25,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:36:25,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-07 00:36:25,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:36:25,694 INFO L225 Difference]: With dead ends: 73 [2019-11-07 00:36:25,694 INFO L226 Difference]: Without dead ends: 70 [2019-11-07 00:36:25,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:36:25,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-07 00:36:25,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2019-11-07 00:36:25,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-07 00:36:25,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2019-11-07 00:36:25,708 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 28 [2019-11-07 00:36:25,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:36:25,709 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2019-11-07 00:36:25,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 00:36:25,709 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2019-11-07 00:36:25,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-07 00:36:25,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:36:25,710 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:36:25,913 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:36:25,914 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:36:25,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:36:25,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1857063759, now seen corresponding path program 1 times [2019-11-07 00:36:25,915 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:36:25,915 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112756879] [2019-11-07 00:36:25,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:36:25,923 ERROR L268 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-07 00:36:25,923 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [989096364] [2019-11-07 00:36:25,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:36:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:36:25,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-07 00:36:25,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:36:26,015 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-07 00:36:26,016 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:36:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-07 00:36:26,092 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112756879] [2019-11-07 00:36:26,092 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:36:26,092 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989096364] [2019-11-07 00:36:26,092 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:36:26,093 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-07 00:36:26,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134208970] [2019-11-07 00:36:26,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 00:36:26,094 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:36:26,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 00:36:26,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-07 00:36:26,094 INFO L87 Difference]: Start difference. First operand 68 states and 88 transitions. Second operand 10 states. [2019-11-07 00:36:26,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:36:26,250 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2019-11-07 00:36:26,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 00:36:26,250 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-11-07 00:36:26,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:36:26,252 INFO L225 Difference]: With dead ends: 81 [2019-11-07 00:36:26,252 INFO L226 Difference]: Without dead ends: 77 [2019-11-07 00:36:26,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-07 00:36:26,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-07 00:36:26,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-11-07 00:36:26,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-07 00:36:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2019-11-07 00:36:26,264 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 31 [2019-11-07 00:36:26,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:36:26,264 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2019-11-07 00:36:26,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 00:36:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2019-11-07 00:36:26,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-07 00:36:26,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:36:26,266 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:36:26,468 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:36:26,469 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:36:26,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:36:26,470 INFO L82 PathProgramCache]: Analyzing trace with hash -493170476, now seen corresponding path program 2 times [2019-11-07 00:36:26,471 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:36:26,471 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378865886] [2019-11-07 00:36:26,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:36:26,486 ERROR L268 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-07 00:36:26,486 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [406836698] [2019-11-07 00:36:26,487 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:36:26,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-07 00:36:26,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 00:36:26,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-07 00:36:26,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:36:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-07 00:36:26,573 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:36:26,645 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-07 00:36:26,646 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378865886] [2019-11-07 00:36:26,646 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:36:26,646 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406836698] [2019-11-07 00:36:26,646 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [342109760] [2019-11-07 00:36:26,652 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-11-07 00:36:26,653 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-11-07 00:36:26,653 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-07 00:36:26,653 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-07 00:36:26,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377492175] [2019-11-07 00:36:26,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 00:36:26,654 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:36:26,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 00:36:26,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-07 00:36:26,655 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 10 states. [2019-11-07 00:36:26,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:36:26,916 INFO L93 Difference]: Finished difference Result 100 states and 130 transitions. [2019-11-07 00:36:26,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 00:36:26,917 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-11-07 00:36:26,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:36:26,919 INFO L225 Difference]: With dead ends: 100 [2019-11-07 00:36:26,919 INFO L226 Difference]: Without dead ends: 85 [2019-11-07 00:36:26,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-07 00:36:26,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-07 00:36:26,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 68. [2019-11-07 00:36:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-07 00:36:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2019-11-07 00:36:26,932 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 33 [2019-11-07 00:36:26,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:36:26,933 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2019-11-07 00:36:26,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 00:36:26,933 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2019-11-07 00:36:26,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-07 00:36:26,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:36:26,935 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:36:27,138 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:36:27,139 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:36:27,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:36:27,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1383929332, now seen corresponding path program 1 times [2019-11-07 00:36:27,139 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:36:27,139 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197808560] [2019-11-07 00:36:27,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:36:27,147 ERROR L268 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-07 00:36:27,148 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2114645757] [2019-11-07 00:36:27,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:36:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:36:27,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-07 00:36:27,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:36:27,300 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-07 00:36:27,300 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:36:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-07 00:36:27,380 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197808560] [2019-11-07 00:36:27,380 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:36:27,381 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114645757] [2019-11-07 00:36:27,381 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-07 00:36:27,381 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-11-07 00:36:27,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241613022] [2019-11-07 00:36:27,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:36:27,381 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:36:27,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:36:27,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-07 00:36:27,382 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 5 states. [2019-11-07 00:36:27,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:36:27,432 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2019-11-07 00:36:27,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:36:27,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-07 00:36:27,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:36:27,434 INFO L225 Difference]: With dead ends: 74 [2019-11-07 00:36:27,434 INFO L226 Difference]: Without dead ends: 69 [2019-11-07 00:36:27,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-07 00:36:27,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-07 00:36:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-11-07 00:36:27,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-07 00:36:27,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2019-11-07 00:36:27,465 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 46 [2019-11-07 00:36:27,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:36:27,466 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2019-11-07 00:36:27,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:36:27,466 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2019-11-07 00:36:27,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-07 00:36:27,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:36:27,468 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:36:27,675 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:36:27,676 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:36:27,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:36:27,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1196309741, now seen corresponding path program 1 times [2019-11-07 00:36:27,677 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:36:27,677 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75351991] [2019-11-07 00:36:27,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:36:27,684 ERROR L268 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-07 00:36:27,685 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2138975814] [2019-11-07 00:36:27,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:36:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:36:27,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-07 00:36:27,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:36:27,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:36:27,803 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-07 00:36:27,804 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:36:27,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:36:27,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:36:27,891 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-07 00:36:27,891 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75351991] [2019-11-07 00:36:27,891 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:36:27,892 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138975814] [2019-11-07 00:36:27,892 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1511689487] [2019-11-07 00:36:27,893 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 50 [2019-11-07 00:36:27,931 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 00:36:27,931 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 00:36:28,053 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 00:36:28,055 INFO L272 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 8. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 10 variables. [2019-11-07 00:36:28,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:36:28,058 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:36:28,058 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-07 00:36:28,058 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2019-11-07 00:36:28,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755272540] [2019-11-07 00:36:28,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-07 00:36:28,060 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:36:28,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-07 00:36:28,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-07 00:36:28,060 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand 13 states. [2019-11-07 00:36:28,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:36:28,213 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-11-07 00:36:28,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 00:36:28,214 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2019-11-07 00:36:28,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:36:28,215 INFO L225 Difference]: With dead ends: 74 [2019-11-07 00:36:28,215 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 00:36:28,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-11-07 00:36:28,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 00:36:28,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 00:36:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 00:36:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 00:36:28,217 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2019-11-07 00:36:28,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:36:28,217 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 00:36:28,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-07 00:36:28,218 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 00:36:28,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 00:36:28,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:36:28,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 00:36:36,822 WARN L191 SmtUtils]: Spent 8.20 s on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2019-11-07 00:36:41,270 WARN L191 SmtUtils]: Spent 4.45 s on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2019-11-07 00:36:43,879 WARN L191 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-11-07 00:36:44,093 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-07 00:36:44,093 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:36:44,093 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:36:44,093 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 00:36:44,094 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:36:44,094 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:36:44,094 INFO L443 ceAbstractionStarter]: For program point L31(lines 28 45) no Hoare annotation was computed. [2019-11-07 00:36:44,094 INFO L439 ceAbstractionStarter]: At program point L29(line 29) the Hoare annotation is: (and (= main_~a~0 (+ (* main_~x~0 main_~p~0) (* main_~y~0 main_~r~0))) (<= 1 main_~x~0) (= (* main_~p~0 main_~s~0) (+ (* main_~r~0 main_~q~0) 1)) (= main_~a~0 (+ (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 1)))) main_~b~0 (* main_~x~0 (+ main_~p~0 (* main_~q~0 (- 1))))))) [2019-11-07 00:36:44,094 INFO L439 ceAbstractionStarter]: At program point L29-1(line 29) the Hoare annotation is: (and (= main_~a~0 (+ (* main_~x~0 main_~p~0) (* main_~y~0 main_~r~0))) (<= 1 main_~x~0) (= (* main_~p~0 main_~s~0) (+ (* main_~r~0 main_~q~0) 1)) (= main_~a~0 (+ (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 1)))) main_~b~0 (* main_~x~0 (+ main_~p~0 (* main_~q~0 (- 1))))))) [2019-11-07 00:36:44,094 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 13 52) no Hoare annotation was computed. [2019-11-07 00:36:44,094 INFO L443 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-11-07 00:36:44,095 INFO L439 ceAbstractionStarter]: At program point L48(line 48) the Hoare annotation is: (let ((.cse3 (= main_~b~0 main_~a~0)) (.cse0 (= main_~s~0 1)) (.cse1 (= main_~p~0 1)) (.cse2 (= main_~b~0 main_~y~0)) (.cse4 (<= 1 main_~x~0)) (.cse5 (= main_~q~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (and (= main_~a~0 (+ (* main_~x~0 main_~p~0) (* main_~y~0 main_~r~0))) .cse3 (= main_~a~0 (+ (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 1)))) main_~b~0 (* main_~x~0 (+ main_~p~0 (* main_~q~0 (- 1))))))) (= (* main_~p~0 main_~s~0) (+ (* main_~r~0 main_~q~0) 1))) (and (= main_~r~0 0) .cse0 .cse1 .cse2 .cse4 .cse5 (= main_~a~0 main_~x~0)))) [2019-11-07 00:36:44,095 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 13 52) no Hoare annotation was computed. [2019-11-07 00:36:44,095 INFO L443 ceAbstractionStarter]: For program point L36(lines 36 44) no Hoare annotation was computed. [2019-11-07 00:36:44,095 INFO L439 ceAbstractionStarter]: At program point L36-2(lines 28 45) the Hoare annotation is: (and (= main_~a~0 (+ (* main_~x~0 main_~p~0) (* main_~y~0 main_~r~0))) (<= 1 main_~x~0) (= (* main_~p~0 main_~s~0) (+ (* main_~r~0 main_~q~0) 1)) (= main_~a~0 (+ (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 1)))) main_~b~0 (* main_~x~0 (+ main_~p~0 (* main_~q~0 (- 1))))))) [2019-11-07 00:36:44,095 INFO L439 ceAbstractionStarter]: At program point L30(line 30) the Hoare annotation is: (and (= main_~a~0 (+ (* main_~x~0 main_~p~0) (* main_~y~0 main_~r~0))) (<= 1 main_~x~0) (= main_~a~0 (+ (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 1)))) main_~b~0 (* main_~x~0 (+ main_~p~0 (* main_~q~0 (- 1)))))) (= (* main_~p~0 main_~s~0) (+ (* main_~r~0 main_~q~0) 1))) [2019-11-07 00:36:44,096 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 13 52) the Hoare annotation is: true [2019-11-07 00:36:44,099 INFO L439 ceAbstractionStarter]: At program point L28-2(lines 28 45) the Hoare annotation is: (and (= main_~a~0 (+ (* main_~x~0 main_~p~0) (* main_~y~0 main_~r~0))) (= main_~b~0 main_~a~0) (<= 1 main_~x~0) (= main_~a~0 (+ (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 1)))) main_~b~0 (* main_~x~0 (+ main_~p~0 (* main_~q~0 (- 1)))))) (= (* main_~p~0 main_~s~0) (+ (* main_~r~0 main_~q~0) 1))) [2019-11-07 00:36:44,099 INFO L439 ceAbstractionStarter]: At program point L49(line 49) the Hoare annotation is: (or (and (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= 1 main_~x~0) (= main_~q~0 0)) (and (= main_~a~0 (+ (* main_~x~0 main_~p~0) (* main_~y~0 main_~r~0))) (= main_~b~0 main_~a~0) (= main_~a~0 (+ (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 1)))) main_~b~0 (* main_~x~0 (+ main_~p~0 (* main_~q~0 (- 1)))))))) [2019-11-07 00:36:44,100 INFO L439 ceAbstractionStarter]: At program point L47(line 47) the Hoare annotation is: (and (= main_~a~0 (+ (* main_~x~0 main_~p~0) (* main_~y~0 main_~r~0))) (= main_~b~0 main_~a~0) (<= 1 main_~x~0) (= main_~a~0 (+ (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 1)))) main_~b~0 (* main_~x~0 (+ main_~p~0 (* main_~q~0 (- 1)))))) (= (* main_~p~0 main_~s~0) (+ (* main_~r~0 main_~q~0) 1))) [2019-11-07 00:36:44,100 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 11) the Hoare annotation is: true [2019-11-07 00:36:44,100 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 11) no Hoare annotation was computed. [2019-11-07 00:36:44,100 INFO L443 ceAbstractionStarter]: For program point L7(lines 7 8) no Hoare annotation was computed. [2019-11-07 00:36:44,100 INFO L443 ceAbstractionStarter]: For program point L6(lines 6 9) no Hoare annotation was computed. [2019-11-07 00:36:44,100 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2019-11-07 00:36:44,100 INFO L443 ceAbstractionStarter]: For program point L6-2(lines 5 11) no Hoare annotation was computed. [2019-11-07 00:36:44,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:36:44 BoogieIcfgContainer [2019-11-07 00:36:44,115 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 00:36:44,121 INFO L168 Benchmark]: Toolchain (without parser) took 21796.75 ms. Allocated memory was 145.8 MB in the beginning and 264.8 MB in the end (delta: 119.0 MB). Free memory was 103.6 MB in the beginning and 216.6 MB in the end (delta: -113.0 MB). Peak memory consumption was 107.4 MB. Max. memory is 7.1 GB. [2019-11-07 00:36:44,122 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 00:36:44,123 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.15 ms. Allocated memory is still 145.8 MB. Free memory was 103.4 MB in the beginning and 93.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-11-07 00:36:44,124 INFO L168 Benchmark]: Boogie Preprocessor took 120.53 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 93.5 MB in the beginning and 180.5 MB in the end (delta: -87.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-11-07 00:36:44,124 INFO L168 Benchmark]: RCFGBuilder took 276.04 ms. Allocated memory is still 202.4 MB. Free memory was 180.5 MB in the beginning and 167.8 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2019-11-07 00:36:44,129 INFO L168 Benchmark]: TraceAbstraction took 21112.70 ms. Allocated memory was 202.4 MB in the beginning and 264.8 MB in the end (delta: 62.4 MB). Free memory was 167.8 MB in the beginning and 216.6 MB in the end (delta: -48.8 MB). Peak memory consumption was 114.9 MB. Max. memory is 7.1 GB. [2019-11-07 00:36:44,139 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 272.15 ms. Allocated memory is still 145.8 MB. Free memory was 103.4 MB in the beginning and 93.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 120.53 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 93.5 MB in the beginning and 180.5 MB in the end (delta: -87.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 276.04 ms. Allocated memory is still 202.4 MB. Free memory was 180.5 MB in the beginning and 167.8 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21112.70 ms. Allocated memory was 202.4 MB in the beginning and 264.8 MB in the end (delta: 62.4 MB). Free memory was 167.8 MB in the beginning and 216.6 MB in the end (delta: -48.8 MB). Peak memory consumption was 114.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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: 28]: Loop Invariant Derived loop invariant: ((a == x * p + y * r && 1 <= x) && p * s == r * q + 1) && a == y * (r + s * -1) + b + x * (p + q * -1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Result: SAFE, OverallTime: 21.0s, OverallIterations: 10, TraceHistogramMax: 8, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.6s, HoareTripleCheckerStatistics: 270 SDtfs, 104 SDslu, 914 SDs, 0 SdLazy, 496 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 523 GetRequests, 439 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 24 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 46 PreInvPairs, 78 NumberOfFragments, 382 HoareAnnotationTreeSize, 46 FomulaSimplifications, 1464 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 563 FormulaSimplificationTreeSizeReductionInter, 15.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 268 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 507 ConstructedInterpolants, 20 QuantifiedInterpolants, 60077 SizeOfPredicates, 37 NumberOfNonLiveVariables, 681 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 19 InterpolantComputations, 14 PerfectInterpolantSequences, 570/600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...