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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/bitvector/soft_float_2.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:45:01,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:45:01,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:45:01,807 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:45:01,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:45:01,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:45:01,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:45:01,818 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:45:01,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:45:01,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:45:01,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:45:01,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:45:01,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:45:01,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:45:01,826 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:45:01,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:45:01,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:45:01,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:45:01,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:45:01,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:45:01,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:45:01,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:45:01,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:45:01,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:45:01,852 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:45:01,852 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:45:01,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:45:01,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:45:01,854 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:45:01,855 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:45:01,855 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:45:01,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:45:01,858 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:45:01,859 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:45:01,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:45:01,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:45:01,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:45:01,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:45:01,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:45:01,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:45:01,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:45:01,867 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:45:01,883 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:45:01,883 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:45:01,883 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:45:01,883 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:45:01,884 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:45:01,884 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:45:01,885 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:45:01,885 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:45:01,885 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:45:01,885 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:45:01,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:45:01,886 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:45:01,886 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:45:01,886 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:45:01,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:45:01,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:45:01,887 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:45:01,887 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:45:01,887 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:45:01,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:45:01,888 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:45:01,888 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:45:01,888 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:45:01,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:45:01,889 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:45:01,889 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:45:01,889 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:45:01,889 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:45:01,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:45:01,890 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:45:01,928 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:45:01,940 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:45:01,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:45:01,945 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:45:01,946 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:45:01,946 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_2.c.cil.c [2019-09-09 05:45:02,007 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e646c5829/0b03b4ac093e40a0b931976d72589186/FLAG0e5957c5d [2019-09-09 05:45:02,466 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:45:02,466 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_2.c.cil.c [2019-09-09 05:45:02,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e646c5829/0b03b4ac093e40a0b931976d72589186/FLAG0e5957c5d [2019-09-09 05:45:02,830 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e646c5829/0b03b4ac093e40a0b931976d72589186 [2019-09-09 05:45:02,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:45:02,842 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:45:02,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:45:02,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:45:02,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:45:02,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:45:02" (1/1) ... [2019-09-09 05:45:02,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57ccb992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:02, skipping insertion in model container [2019-09-09 05:45:02,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:45:02" (1/1) ... [2019-09-09 05:45:02,857 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:45:02,894 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:45:03,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:45:03,131 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:45:03,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:45:03,282 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:45:03,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:03 WrapperNode [2019-09-09 05:45:03,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:45:03,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:45:03,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:45:03,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:45:03,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:03" (1/1) ... [2019-09-09 05:45:03,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:03" (1/1) ... [2019-09-09 05:45:03,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:03" (1/1) ... [2019-09-09 05:45:03,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:03" (1/1) ... [2019-09-09 05:45:03,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:03" (1/1) ... [2019-09-09 05:45:03,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:03" (1/1) ... [2019-09-09 05:45:03,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:03" (1/1) ... [2019-09-09 05:45:03,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:45:03,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:45:03,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:45:03,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:45:03,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:45:03,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:45:03,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:45:03,380 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-09 05:45:03,380 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2019-09-09 05:45:03,381 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2019-09-09 05:45:03,381 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2019-09-09 05:45:03,381 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:45:03,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:45:03,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:45:03,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-09 05:45:03,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-09 05:45:03,382 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2019-09-09 05:45:03,382 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2019-09-09 05:45:03,383 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2019-09-09 05:45:03,383 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:45:03,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:45:03,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:45:03,822 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:45:03,822 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-09 05:45:03,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:45:03 BoogieIcfgContainer [2019-09-09 05:45:03,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:45:03,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:45:03,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:45:03,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:45:03,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:45:02" (1/3) ... [2019-09-09 05:45:03,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7a5d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:45:03, skipping insertion in model container [2019-09-09 05:45:03,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:03" (2/3) ... [2019-09-09 05:45:03,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7a5d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:45:03, skipping insertion in model container [2019-09-09 05:45:03,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:45:03" (3/3) ... [2019-09-09 05:45:03,831 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_2.c.cil.c [2019-09-09 05:45:03,841 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:45:03,848 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:45:03,865 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:45:03,887 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:45:03,887 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:45:03,887 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:45:03,887 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:45:03,887 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:45:03,887 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:45:03,887 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:45:03,887 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:45:03,902 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2019-09-09 05:45:03,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-09 05:45:03,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:03,913 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:03,916 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:03,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:03,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1570912407, now seen corresponding path program 1 times [2019-09-09 05:45:03,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:03,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:03,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:03,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:03,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:04,129 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-09 05:45:04,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:04,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:04,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:04,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:04,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:04,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:04,153 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2019-09-09 05:45:04,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:04,213 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2019-09-09 05:45:04,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:04,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-09-09 05:45:04,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:04,230 INFO L225 Difference]: With dead ends: 65 [2019-09-09 05:45:04,231 INFO L226 Difference]: Without dead ends: 52 [2019-09-09 05:45:04,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:04,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-09 05:45:04,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-09-09 05:45:04,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-09 05:45:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2019-09-09 05:45:04,282 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 70 transitions. Word has length 48 [2019-09-09 05:45:04,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:04,284 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 70 transitions. [2019-09-09 05:45:04,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:04,285 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2019-09-09 05:45:04,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-09 05:45:04,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:04,288 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:04,289 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:04,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:04,289 INFO L82 PathProgramCache]: Analyzing trace with hash -880454641, now seen corresponding path program 1 times [2019-09-09 05:45:04,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:04,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:04,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:04,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:04,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-09 05:45:04,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:04,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:45:04,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:04,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:45:04,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:45:04,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:45:04,425 INFO L87 Difference]: Start difference. First operand 52 states and 70 transitions. Second operand 4 states. [2019-09-09 05:45:04,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:04,465 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2019-09-09 05:45:04,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:45:04,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-09-09 05:45:04,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:04,467 INFO L225 Difference]: With dead ends: 56 [2019-09-09 05:45:04,468 INFO L226 Difference]: Without dead ends: 52 [2019-09-09 05:45:04,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:45:04,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-09 05:45:04,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-09-09 05:45:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-09 05:45:04,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2019-09-09 05:45:04,477 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 50 [2019-09-09 05:45:04,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:04,477 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2019-09-09 05:45:04,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:45:04,478 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2019-09-09 05:45:04,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-09 05:45:04,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:04,480 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:04,480 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:04,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:04,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1901522995, now seen corresponding path program 1 times [2019-09-09 05:45:04,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:04,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:04,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:04,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:04,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:04,571 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:04,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:04,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:04,573 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2019-09-09 05:45:04,575 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [62], [63], [64], [67], [73], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [138], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:04,612 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:04,613 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:04,686 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:04,693 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:45:04,694 INFO L272 AbstractInterpreter]: Visited 13 different actions 15 times. Never merged. Never widened. Performed 20 root evaluator evaluations with a maximum evaluation depth of 2. Performed 20 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Never found a fixpoint. Largest state had 23 variables. [2019-09-09 05:45:04,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:04,698 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:45:04,748 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 79.33% of their original sizes. [2019-09-09 05:45:04,749 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:45:04,879 INFO L420 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2019-09-09 05:45:04,880 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:45:04,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:45:04,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2019-09-09 05:45:04,881 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:04,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-09 05:45:04,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-09 05:45:04,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:45:04,883 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand 11 states. [2019-09-09 05:45:05,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:05,471 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2019-09-09 05:45:05,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-09 05:45:05,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-09-09 05:45:05,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:05,474 INFO L225 Difference]: With dead ends: 78 [2019-09-09 05:45:05,475 INFO L226 Difference]: Without dead ends: 78 [2019-09-09 05:45:05,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2019-09-09 05:45:05,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-09 05:45:05,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2019-09-09 05:45:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-09 05:45:05,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2019-09-09 05:45:05,485 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 50 [2019-09-09 05:45:05,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:05,486 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2019-09-09 05:45:05,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-09 05:45:05,486 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2019-09-09 05:45:05,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-09 05:45:05,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:05,488 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:05,488 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:05,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:05,489 INFO L82 PathProgramCache]: Analyzing trace with hash 922622062, now seen corresponding path program 1 times [2019-09-09 05:45:05,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:05,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:05,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:05,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:05,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:05,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:05,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:05,527 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2019-09-09 05:45:05,527 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [22], [62], [63], [64], [67], [73], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [145], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:05,530 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:05,530 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:05,533 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:05,538 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:45:05,538 INFO L272 AbstractInterpreter]: Visited 17 different actions 23 times. Never merged. Never widened. Performed 28 root evaluator evaluations with a maximum evaluation depth of 4. Performed 28 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 23 variables. [2019-09-09 05:45:05,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:05,540 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:45:05,572 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 71.46% of their original sizes. [2019-09-09 05:45:05,573 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:45:05,664 INFO L420 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2019-09-09 05:45:05,664 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:45:05,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:45:05,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2019-09-09 05:45:05,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:05,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-09 05:45:05,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-09 05:45:05,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-09 05:45:05,666 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand 12 states. [2019-09-09 05:45:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:06,195 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2019-09-09 05:45:06,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-09 05:45:06,195 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-09-09 05:45:06,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:06,200 INFO L225 Difference]: With dead ends: 75 [2019-09-09 05:45:06,200 INFO L226 Difference]: Without dead ends: 75 [2019-09-09 05:45:06,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-09-09 05:45:06,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-09 05:45:06,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2019-09-09 05:45:06,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-09 05:45:06,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2019-09-09 05:45:06,227 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 55 [2019-09-09 05:45:06,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:06,230 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2019-09-09 05:45:06,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-09 05:45:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2019-09-09 05:45:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-09 05:45:06,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:06,233 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:06,233 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:06,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:06,235 INFO L82 PathProgramCache]: Analyzing trace with hash -577786995, now seen corresponding path program 1 times [2019-09-09 05:45:06,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:06,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:06,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:06,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:06,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:06,363 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:06,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:06,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:06,364 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2019-09-09 05:45:06,364 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [24], [29], [60], [62], [63], [64], [67], [73], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [145], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:06,369 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:06,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:06,373 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:06,520 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:06,521 INFO L272 AbstractInterpreter]: Visited 46 different actions 262 times. Merged at 20 different actions 86 times. Never widened. Performed 461 root evaluator evaluations with a maximum evaluation depth of 4. Performed 461 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 1 different actions. Largest state had 23 variables. [2019-09-09 05:45:06,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:06,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:06,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:06,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:45:06,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:06,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:06,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-09 05:45:06,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-09 05:45:06,654 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-09 05:45:06,717 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:45:06,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [5] total 11 [2019-09-09 05:45:06,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:06,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:45:06,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:45:06,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:45:06,719 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 6 states. [2019-09-09 05:45:06,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:06,760 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2019-09-09 05:45:06,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:45:06,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-09 05:45:06,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:06,767 INFO L225 Difference]: With dead ends: 73 [2019-09-09 05:45:06,767 INFO L226 Difference]: Without dead ends: 69 [2019-09-09 05:45:06,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-09-09 05:45:06,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-09 05:45:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-09-09 05:45:06,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-09 05:45:06,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-09-09 05:45:06,774 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 57 [2019-09-09 05:45:06,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:06,775 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-09-09 05:45:06,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:45:06,775 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-09-09 05:45:06,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-09 05:45:06,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:06,777 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:06,777 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:06,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:06,777 INFO L82 PathProgramCache]: Analyzing trace with hash -635045297, now seen corresponding path program 1 times [2019-09-09 05:45:06,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:06,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:06,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:06,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:06,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:06,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:06,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:06,869 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2019-09-09 05:45:06,869 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [24], [29], [60], [62], [63], [64], [67], [73], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:06,873 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:06,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:06,876 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:06,944 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:06,945 INFO L272 AbstractInterpreter]: Visited 46 different actions 262 times. Merged at 20 different actions 86 times. Never widened. Performed 450 root evaluator evaluations with a maximum evaluation depth of 4. Performed 450 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 1 different actions. Largest state had 23 variables. [2019-09-09 05:45:06,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:06,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:06,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:06,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:45:06,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:06,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:06,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-09 05:45:06,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:07,148 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-09 05:45:07,148 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:07,427 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-09 05:45:07,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-09 05:45:07,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 10] total 17 [2019-09-09 05:45:07,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:07,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:45:07,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:45:07,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-09 05:45:07,433 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 8 states. [2019-09-09 05:45:07,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:07,587 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2019-09-09 05:45:07,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:45:07,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-09-09 05:45:07,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:07,590 INFO L225 Difference]: With dead ends: 90 [2019-09-09 05:45:07,590 INFO L226 Difference]: Without dead ends: 90 [2019-09-09 05:45:07,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-09-09 05:45:07,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-09 05:45:07,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2019-09-09 05:45:07,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-09 05:45:07,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2019-09-09 05:45:07,619 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 57 [2019-09-09 05:45:07,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:07,619 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2019-09-09 05:45:07,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:45:07,619 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2019-09-09 05:45:07,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-09 05:45:07,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:07,621 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:07,621 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:07,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:07,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1646162547, now seen corresponding path program 1 times [2019-09-09 05:45:07,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:07,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:07,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:07,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:07,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:07,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:07,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:07,741 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2019-09-09 05:45:07,741 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [24], [29], [60], [62], [63], [64], [69], [73], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:07,745 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:07,745 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:07,746 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:07,790 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:07,790 INFO L272 AbstractInterpreter]: Visited 46 different actions 262 times. Merged at 20 different actions 86 times. Never widened. Performed 429 root evaluator evaluations with a maximum evaluation depth of 4. Performed 429 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 1 different actions. Largest state had 23 variables. [2019-09-09 05:45:07,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:07,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:07,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:07,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:07,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:07,817 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:07,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-09 05:45:07,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:07,917 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-09 05:45:08,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-09 05:45:08,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 8] total 14 [2019-09-09 05:45:08,056 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:08,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:45:08,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:45:08,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-09 05:45:08,057 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand 6 states. [2019-09-09 05:45:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:08,119 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2019-09-09 05:45:08,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:45:08,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-09 05:45:08,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:08,121 INFO L225 Difference]: With dead ends: 88 [2019-09-09 05:45:08,121 INFO L226 Difference]: Without dead ends: 73 [2019-09-09 05:45:08,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-09-09 05:45:08,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-09 05:45:08,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-09-09 05:45:08,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-09 05:45:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2019-09-09 05:45:08,127 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 57 [2019-09-09 05:45:08,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:08,128 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2019-09-09 05:45:08,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:45:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2019-09-09 05:45:08,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-09 05:45:08,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:08,130 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:08,130 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:08,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:08,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1094827318, now seen corresponding path program 1 times [2019-09-09 05:45:08,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:08,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:08,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:08,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:08,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:08,217 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:08,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:08,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:08,218 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2019-09-09 05:45:08,219 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [24], [29], [35], [44], [48], [54], [60], [62], [63], [64], [67], [75], [78], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:08,222 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:08,223 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:08,225 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:08,342 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:08,343 INFO L272 AbstractInterpreter]: Visited 51 different actions 365 times. Merged at 21 different actions 119 times. Never widened. Performed 748 root evaluator evaluations with a maximum evaluation depth of 6. Performed 748 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 11 fixpoints after 1 different actions. Largest state had 23 variables. [2019-09-09 05:45:08,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:08,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:08,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:08,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:08,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:08,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:08,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-09 05:45:08,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-09 05:45:08,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-09 05:45:08,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:08,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 9] total 19 [2019-09-09 05:45:08,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:08,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-09 05:45:08,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-09 05:45:08,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-09-09 05:45:08,786 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand 13 states. [2019-09-09 05:45:09,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:09,461 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2019-09-09 05:45:09,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-09 05:45:09,461 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-09-09 05:45:09,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:09,463 INFO L225 Difference]: With dead ends: 136 [2019-09-09 05:45:09,463 INFO L226 Difference]: Without dead ends: 132 [2019-09-09 05:45:09,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2019-09-09 05:45:09,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-09 05:45:09,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 90. [2019-09-09 05:45:09,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-09 05:45:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2019-09-09 05:45:09,475 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 62 [2019-09-09 05:45:09,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:09,475 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2019-09-09 05:45:09,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-09 05:45:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2019-09-09 05:45:09,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:45:09,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:09,477 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:09,477 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:09,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:09,478 INFO L82 PathProgramCache]: Analyzing trace with hash -2062971430, now seen corresponding path program 1 times [2019-09-09 05:45:09,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:09,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:09,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:09,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:09,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:09,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:09,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:09,529 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2019-09-09 05:45:09,529 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [22], [24], [27], [35], [44], [48], [54], [62], [63], [64], [69], [75], [78], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:09,532 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:09,532 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:09,534 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:09,578 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:09,579 INFO L272 AbstractInterpreter]: Visited 51 different actions 224 times. Merged at 14 different actions 89 times. Widened at 2 different actions 8 times. Performed 500 root evaluator evaluations with a maximum evaluation depth of 6. Performed 500 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 14 fixpoints after 4 different actions. Largest state had 23 variables. [2019-09-09 05:45:09,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:09,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:09,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:09,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:09,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:09,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:09,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-09 05:45:09,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-09 05:45:09,653 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:09,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:09,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2019-09-09 05:45:09,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:09,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:45:09,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:45:09,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:45:09,745 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand 5 states. [2019-09-09 05:45:09,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:09,805 INFO L93 Difference]: Finished difference Result 117 states and 143 transitions. [2019-09-09 05:45:09,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:45:09,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-09 05:45:09,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:09,807 INFO L225 Difference]: With dead ends: 117 [2019-09-09 05:45:09,808 INFO L226 Difference]: Without dead ends: 114 [2019-09-09 05:45:09,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2019-09-09 05:45:09,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-09 05:45:09,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 92. [2019-09-09 05:45:09,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-09 05:45:09,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 111 transitions. [2019-09-09 05:45:09,823 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 111 transitions. Word has length 63 [2019-09-09 05:45:09,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:09,823 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 111 transitions. [2019-09-09 05:45:09,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:45:09,824 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 111 transitions. [2019-09-09 05:45:09,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-09 05:45:09,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:09,825 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:09,825 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:09,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:09,826 INFO L82 PathProgramCache]: Analyzing trace with hash 387817051, now seen corresponding path program 1 times [2019-09-09 05:45:09,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:09,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:09,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:09,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:09,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:09,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:09,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:09,943 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2019-09-09 05:45:09,944 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [24], [27], [29], [35], [44], [48], [54], [60], [62], [63], [64], [69], [75], [78], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:09,948 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:09,948 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:09,950 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:10,044 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:10,044 INFO L272 AbstractInterpreter]: Visited 52 different actions 529 times. Merged at 25 different actions 259 times. Widened at 3 different actions 28 times. Performed 1179 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1179 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 43 fixpoints after 7 different actions. Largest state had 23 variables. [2019-09-09 05:45:10,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:10,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:10,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:10,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:10,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:10,068 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:10,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-09 05:45:10,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:10,244 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-09 05:45:10,244 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:10,667 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-09 05:45:10,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:10,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 9] total 20 [2019-09-09 05:45:10,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:10,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-09 05:45:10,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-09 05:45:10,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-09-09 05:45:10,674 INFO L87 Difference]: Start difference. First operand 92 states and 111 transitions. Second operand 14 states. [2019-09-09 05:45:11,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:11,980 INFO L93 Difference]: Finished difference Result 140 states and 172 transitions. [2019-09-09 05:45:11,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-09 05:45:11,982 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-09-09 05:45:11,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:11,984 INFO L225 Difference]: With dead ends: 140 [2019-09-09 05:45:11,984 INFO L226 Difference]: Without dead ends: 114 [2019-09-09 05:45:11,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=1087, Unknown=0, NotChecked=0, Total=1260 [2019-09-09 05:45:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-09 05:45:11,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 73. [2019-09-09 05:45:11,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-09 05:45:11,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2019-09-09 05:45:11,990 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 65 [2019-09-09 05:45:11,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:11,990 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2019-09-09 05:45:11,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-09 05:45:11,991 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2019-09-09 05:45:11,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-09 05:45:11,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:11,992 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:11,992 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:11,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:11,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1629892824, now seen corresponding path program 1 times [2019-09-09 05:45:11,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:11,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:11,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:11,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:11,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:12,041 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-09 05:45:12,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:12,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:12,042 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2019-09-09 05:45:12,042 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [22], [24], [27], [35], [44], [48], [54], [62], [63], [64], [67], [75], [78], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:12,046 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:12,046 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:12,048 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:12,075 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:12,076 INFO L272 AbstractInterpreter]: Visited 51 different actions 215 times. Merged at 14 different actions 84 times. Widened at 2 different actions 8 times. Performed 428 root evaluator evaluations with a maximum evaluation depth of 6. Performed 428 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 15 fixpoints after 5 different actions. Largest state had 23 variables. [2019-09-09 05:45:12,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:12,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:12,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:12,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:45:12,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:12,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:12,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-09 05:45:12,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:12,131 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-09 05:45:12,132 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:12,211 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-09 05:45:12,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:12,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2019-09-09 05:45:12,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:12,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:45:12,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:45:12,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-09 05:45:12,219 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand 6 states. [2019-09-09 05:45:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:12,275 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2019-09-09 05:45:12,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:45:12,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-09 05:45:12,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:12,278 INFO L225 Difference]: With dead ends: 98 [2019-09-09 05:45:12,278 INFO L226 Difference]: Without dead ends: 95 [2019-09-09 05:45:12,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:45:12,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-09 05:45:12,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 75. [2019-09-09 05:45:12,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-09 05:45:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2019-09-09 05:45:12,283 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 70 [2019-09-09 05:45:12,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:12,284 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2019-09-09 05:45:12,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:45:12,284 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2019-09-09 05:45:12,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-09 05:45:12,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:12,285 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:12,285 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:12,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:12,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1490208921, now seen corresponding path program 1 times [2019-09-09 05:45:12,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:12,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:12,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:12,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:12,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:12,368 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-09 05:45:12,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:12,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:12,369 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2019-09-09 05:45:12,369 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [24], [27], [29], [35], [44], [48], [54], [60], [62], [63], [64], [67], [75], [78], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:12,372 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:12,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:12,373 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:12,453 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:12,454 INFO L272 AbstractInterpreter]: Visited 52 different actions 529 times. Merged at 25 different actions 259 times. Widened at 3 different actions 28 times. Performed 1213 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1213 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 43 fixpoints after 7 different actions. Largest state had 23 variables. [2019-09-09 05:45:12,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:12,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:12,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:12,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:12,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:12,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:12,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-09 05:45:12,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:12,662 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-09 05:45:12,662 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-09 05:45:13,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:13,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 15] total 28 [2019-09-09 05:45:13,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:13,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-09 05:45:13,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-09 05:45:13,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2019-09-09 05:45:13,201 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 15 states. [2019-09-09 05:45:13,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:13,935 INFO L93 Difference]: Finished difference Result 117 states and 140 transitions. [2019-09-09 05:45:13,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-09 05:45:13,936 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-09-09 05:45:13,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:13,937 INFO L225 Difference]: With dead ends: 117 [2019-09-09 05:45:13,937 INFO L226 Difference]: Without dead ends: 108 [2019-09-09 05:45:13,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 123 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=1225, Unknown=0, NotChecked=0, Total=1406 [2019-09-09 05:45:13,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-09 05:45:13,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 79. [2019-09-09 05:45:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-09 05:45:13,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2019-09-09 05:45:13,943 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 72 [2019-09-09 05:45:13,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:13,944 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2019-09-09 05:45:13,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-09 05:45:13,944 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2019-09-09 05:45:13,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-09 05:45:13,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:13,945 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:13,945 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:13,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:13,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2061159901, now seen corresponding path program 1 times [2019-09-09 05:45:13,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:13,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:13,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:13,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:13,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-09 05:45:14,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:14,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:14,005 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 74 with the following transitions: [2019-09-09 05:45:14,006 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [22], [24], [27], [35], [44], [48], [50], [54], [60], [62], [63], [64], [67], [75], [78], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:14,007 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:14,007 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:14,009 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:14,079 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:14,079 INFO L272 AbstractInterpreter]: Visited 53 different actions 507 times. Merged at 25 different actions 224 times. Widened at 2 different actions 15 times. Performed 1093 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1093 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 39 fixpoints after 7 different actions. Largest state had 23 variables. [2019-09-09 05:45:14,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:14,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:14,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:14,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:45:14,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:14,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:14,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-09 05:45:14,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:14,138 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-09 05:45:14,138 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-09 05:45:14,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:14,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2019-09-09 05:45:14,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:14,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:45:14,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:45:14,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2019-09-09 05:45:14,237 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 7 states. [2019-09-09 05:45:14,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:14,295 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2019-09-09 05:45:14,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 05:45:14,296 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-09-09 05:45:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:14,297 INFO L225 Difference]: With dead ends: 111 [2019-09-09 05:45:14,297 INFO L226 Difference]: Without dead ends: 108 [2019-09-09 05:45:14,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2019-09-09 05:45:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-09 05:45:14,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 81. [2019-09-09 05:45:14,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-09 05:45:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2019-09-09 05:45:14,303 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 73 [2019-09-09 05:45:14,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:14,303 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2019-09-09 05:45:14,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:45:14,303 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2019-09-09 05:45:14,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-09 05:45:14,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:14,304 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:14,304 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:14,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:14,305 INFO L82 PathProgramCache]: Analyzing trace with hash 2146435620, now seen corresponding path program 1 times [2019-09-09 05:45:14,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:14,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:14,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:14,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:14,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-09 05:45:14,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:14,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:14,447 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 76 with the following transitions: [2019-09-09 05:45:14,448 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [24], [27], [29], [35], [44], [48], [50], [54], [60], [62], [63], [64], [67], [75], [78], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:14,450 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:14,450 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:14,452 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:14,553 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:14,553 INFO L272 AbstractInterpreter]: Visited 53 different actions 608 times. Merged at 25 different actions 288 times. Widened at 3 different actions 29 times. Performed 1318 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1318 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 56 fixpoints after 7 different actions. Largest state had 23 variables. [2019-09-09 05:45:14,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:14,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:14,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:14,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:45:14,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:14,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:14,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-09 05:45:14,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-09 05:45:14,804 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:15,283 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-09 05:45:15,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:15,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 23 [2019-09-09 05:45:15,300 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:15,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-09 05:45:15,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-09 05:45:15,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2019-09-09 05:45:15,302 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand 16 states. [2019-09-09 05:45:16,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:16,003 INFO L93 Difference]: Finished difference Result 129 states and 151 transitions. [2019-09-09 05:45:16,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-09 05:45:16,004 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2019-09-09 05:45:16,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:16,005 INFO L225 Difference]: With dead ends: 129 [2019-09-09 05:45:16,005 INFO L226 Difference]: Without dead ends: 115 [2019-09-09 05:45:16,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 134 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2019-09-09 05:45:16,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-09 05:45:16,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 82. [2019-09-09 05:45:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-09 05:45:16,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2019-09-09 05:45:16,011 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 75 [2019-09-09 05:45:16,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:16,011 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2019-09-09 05:45:16,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-09 05:45:16,011 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2019-09-09 05:45:16,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-09 05:45:16,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:16,012 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:16,012 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:16,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:16,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1127100362, now seen corresponding path program 1 times [2019-09-09 05:45:16,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:16,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:16,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:16,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:16,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-09 05:45:16,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:16,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:16,080 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 77 with the following transitions: [2019-09-09 05:45:16,081 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [22], [24], [27], [35], [44], [48], [50], [54], [60], [62], [63], [64], [69], [75], [78], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:16,082 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:16,082 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:16,084 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:16,157 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:16,157 INFO L272 AbstractInterpreter]: Visited 53 different actions 507 times. Merged at 25 different actions 224 times. Widened at 2 different actions 15 times. Performed 1076 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1076 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 39 fixpoints after 7 different actions. Largest state had 23 variables. [2019-09-09 05:45:16,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:16,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:16,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:16,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:16,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:16,179 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:16,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-09 05:45:16,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 26 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-09 05:45:16,234 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:16,358 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 05:45:16,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:16,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2019-09-09 05:45:16,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:16,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:45:16,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:45:16,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-09-09 05:45:16,363 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 8 states. [2019-09-09 05:45:16,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:16,426 INFO L93 Difference]: Finished difference Result 121 states and 140 transitions. [2019-09-09 05:45:16,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:45:16,427 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2019-09-09 05:45:16,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:16,430 INFO L225 Difference]: With dead ends: 121 [2019-09-09 05:45:16,430 INFO L226 Difference]: Without dead ends: 118 [2019-09-09 05:45:16,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=119, Unknown=0, NotChecked=0, Total=210 [2019-09-09 05:45:16,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-09 05:45:16,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 84. [2019-09-09 05:45:16,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-09 05:45:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2019-09-09 05:45:16,436 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 76 [2019-09-09 05:45:16,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:16,436 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2019-09-09 05:45:16,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:45:16,437 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2019-09-09 05:45:16,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-09 05:45:16,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:16,439 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:16,439 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:16,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:16,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1856995337, now seen corresponding path program 1 times [2019-09-09 05:45:16,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:16,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:16,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:16,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:16,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:16,542 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 4 proven. 41 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-09 05:45:16,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:16,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:16,542 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 79 with the following transitions: [2019-09-09 05:45:16,543 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [24], [27], [29], [35], [44], [48], [50], [54], [60], [62], [63], [64], [69], [75], [78], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:16,544 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:16,544 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:16,545 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:16,612 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:16,613 INFO L272 AbstractInterpreter]: Visited 53 different actions 562 times. Merged at 25 different actions 269 times. Widened at 3 different actions 29 times. Performed 1189 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1189 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 53 fixpoints after 8 different actions. Largest state had 23 variables. [2019-09-09 05:45:16,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:16,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:16,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:16,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:16,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:16,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:16,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-09 05:45:16,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:16,852 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-09 05:45:16,853 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:17,226 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 05:45:17,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:17,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 24 [2019-09-09 05:45:17,233 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:17,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-09 05:45:17,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-09 05:45:17,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2019-09-09 05:45:17,234 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 17 states. [2019-09-09 05:45:18,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:18,041 INFO L93 Difference]: Finished difference Result 116 states and 135 transitions. [2019-09-09 05:45:18,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-09 05:45:18,042 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 78 [2019-09-09 05:45:18,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:18,042 INFO L225 Difference]: With dead ends: 116 [2019-09-09 05:45:18,042 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:45:18,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2019-09-09 05:45:18,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:45:18,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:45:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:45:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:45:18,044 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2019-09-09 05:45:18,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:18,044 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:45:18,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-09 05:45:18,045 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:45:18,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:45:18,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:45:18 BoogieIcfgContainer [2019-09-09 05:45:18,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:45:18,053 INFO L168 Benchmark]: Toolchain (without parser) took 15210.87 ms. Allocated memory was 135.3 MB in the beginning and 393.7 MB in the end (delta: 258.5 MB). Free memory was 91.2 MB in the beginning and 318.9 MB in the end (delta: -227.7 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:18,054 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 135.3 MB. Free memory was 109.8 MB in the beginning and 109.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:45:18,055 INFO L168 Benchmark]: CACSL2BoogieTranslator took 440.36 ms. Allocated memory was 135.3 MB in the beginning and 201.3 MB in the end (delta: 66.1 MB). Free memory was 91.0 MB in the beginning and 176.2 MB in the end (delta: -85.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:18,055 INFO L168 Benchmark]: Boogie Preprocessor took 39.91 ms. Allocated memory is still 201.3 MB. Free memory was 176.2 MB in the beginning and 174.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:18,056 INFO L168 Benchmark]: RCFGBuilder took 500.50 ms. Allocated memory is still 201.3 MB. Free memory was 174.3 MB in the beginning and 150.5 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:18,057 INFO L168 Benchmark]: TraceAbstraction took 14225.95 ms. Allocated memory was 201.3 MB in the beginning and 393.7 MB in the end (delta: 192.4 MB). Free memory was 149.9 MB in the beginning and 319.0 MB in the end (delta: -169.0 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:18,060 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.20 ms. Allocated memory is still 135.3 MB. Free memory was 109.8 MB in the beginning and 109.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 440.36 ms. Allocated memory was 135.3 MB in the beginning and 201.3 MB in the end (delta: 66.1 MB). Free memory was 91.0 MB in the beginning and 176.2 MB in the end (delta: -85.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.91 ms. Allocated memory is still 201.3 MB. Free memory was 176.2 MB in the beginning and 174.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 500.50 ms. Allocated memory is still 201.3 MB. Free memory was 174.3 MB in the beginning and 150.5 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14225.95 ms. Allocated memory was 201.3 MB in the beginning and 393.7 MB in the end (delta: 192.4 MB). Free memory was 149.9 MB in the beginning and 319.0 MB in the end (delta: -169.0 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 72 locations, 1 error locations. SAFE Result, 14.1s OverallTime, 16 OverallIterations, 5 TraceHistogramMax, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1007 SDtfs, 643 SDslu, 6003 SDs, 0 SdLazy, 2552 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1885 GetRequests, 1582 SyntacticMatches, 22 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.1s AbstIntTime, 14 AbstIntIterations, 2 AbstIntStrong, 0.8666666666666665 AbsIntWeakeningRatio, 1.4854368932038835 AbsIntAvgWeakeningVarsNumRemoved, 0.4563106796116505 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 275 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1813 NumberOfCodeBlocks, 1813 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2578 ConstructedInterpolants, 96 QuantifiedInterpolants, 427469 SizeOfPredicates, 46 NumberOfNonLiveVariables, 2135 ConjunctsInSsa, 181 ConjunctsInUnsatCore, 40 InterpolantComputations, 6 PerfectInterpolantSequences, 1134/1641 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...