java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label07_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:44:56,910 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:44:56,912 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:44:56,927 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:44:56,927 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:44:56,928 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:44:56,932 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:44:56,935 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:44:56,938 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:44:56,938 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:44:56,939 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:44:56,940 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:44:56,940 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:44:56,944 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:44:56,945 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:44:56,948 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:44:56,949 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:44:56,952 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:44:56,956 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:44:56,959 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:44:56,960 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:44:56,962 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:44:56,966 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:44:56,967 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:44:56,967 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:44:56,969 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:44:56,970 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:44:56,971 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:44:56,972 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:44:56,973 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:44:56,973 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:44:56,974 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:44:56,974 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:44:56,974 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:44:56,975 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:44:56,976 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:44:56,976 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-24 23:44:56,992 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:44:56,992 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:44:56,993 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:44:56,993 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:44:56,993 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:44:56,993 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:44:56,994 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:44:56,994 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:44:56,994 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:44:56,994 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:44:56,994 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:44:56,995 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:44:56,995 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:44:56,995 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:44:56,996 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:44:56,996 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:44:56,996 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:44:56,996 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:44:56,996 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:44:56,997 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:44:56,997 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:44:56,997 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:44:56,997 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:44:56,998 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:44:56,998 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:44:56,998 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:44:56,998 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:44:56,998 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:44:56,998 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:44:56,999 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:44:56,999 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:44:56,999 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:44:56,999 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:44:56,999 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:44:57,000 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:44:57,000 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:44:57,044 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:44:57,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:44:57,067 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:44:57,069 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:44:57,069 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:44:57,070 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label07_false-unreach-call.c [2018-10-24 23:44:57,141 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5d2a83f08/fe66a7f831a140ef89807a60d98663b5/FLAG57e805f90 [2018-10-24 23:44:57,973 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:44:57,974 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label07_false-unreach-call.c [2018-10-24 23:44:58,004 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5d2a83f08/fe66a7f831a140ef89807a60d98663b5/FLAG57e805f90 [2018-10-24 23:44:58,024 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5d2a83f08/fe66a7f831a140ef89807a60d98663b5 [2018-10-24 23:44:58,038 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:44:58,041 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:44:58,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:44:58,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:44:58,048 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:44:58,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:44:58" (1/1) ... [2018-10-24 23:44:58,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d764c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:58, skipping insertion in model container [2018-10-24 23:44:58,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:44:58" (1/1) ... [2018-10-24 23:44:58,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:44:58,192 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:44:59,239 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:44:59,245 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:44:59,667 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:44:59,691 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:44:59,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:59 WrapperNode [2018-10-24 23:44:59,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:44:59,694 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:44:59,694 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:44:59,694 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:44:59,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:59" (1/1) ... [2018-10-24 23:44:59,769 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:59" (1/1) ... [2018-10-24 23:45:00,166 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:45:00,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:45:00,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:45:00,167 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:45:00,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:59" (1/1) ... [2018-10-24 23:45:00,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:59" (1/1) ... [2018-10-24 23:45:00,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:59" (1/1) ... [2018-10-24 23:45:00,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:59" (1/1) ... [2018-10-24 23:45:00,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:59" (1/1) ... [2018-10-24 23:45:00,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:59" (1/1) ... [2018-10-24 23:45:00,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:59" (1/1) ... [2018-10-24 23:45:00,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:45:00,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:45:00,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:45:00,450 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:45:00,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 23:45:00,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:45:00,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:45:00,531 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:45:00,531 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:45:00,531 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:45:00,532 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:45:00,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:45:00,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:45:00,533 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:45:00,533 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:45:12,424 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:45:12,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:45:12 BoogieIcfgContainer [2018-10-24 23:45:12,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:45:12,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:45:12,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:45:12,431 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:45:12,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:44:58" (1/3) ... [2018-10-24 23:45:12,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205f7124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:45:12, skipping insertion in model container [2018-10-24 23:45:12,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:59" (2/3) ... [2018-10-24 23:45:12,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205f7124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:45:12, skipping insertion in model container [2018-10-24 23:45:12,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:45:12" (3/3) ... [2018-10-24 23:45:12,434 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label07_false-unreach-call.c [2018-10-24 23:45:12,445 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:45:12,455 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:45:12,473 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:45:12,518 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:45:12,519 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:45:12,519 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:45:12,519 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:45:12,519 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:45:12,519 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:45:12,519 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:45:12,520 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:45:12,564 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-10-24 23:45:12,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-24 23:45:12,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:45:12,574 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:45:12,578 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:45:12,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:45:12,585 INFO L82 PathProgramCache]: Analyzing trace with hash -87983404, now seen corresponding path program 1 times [2018-10-24 23:45:12,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:45:12,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:45:12,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:45:12,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:45:12,639 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:45:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:45:13,049 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-10-24 23:45:13,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:45:13,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:45:13,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:45:13,077 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:45:13,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:45:13,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:45:13,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:45:13,104 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 4 states. [2018-10-24 23:45:23,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:45:23,966 INFO L93 Difference]: Finished difference Result 2125 states and 3954 transitions. [2018-10-24 23:45:23,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:45:23,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-10-24 23:45:23,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:45:24,007 INFO L225 Difference]: With dead ends: 2125 [2018-10-24 23:45:24,007 INFO L226 Difference]: Without dead ends: 1515 [2018-10-24 23:45:24,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:45:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2018-10-24 23:45:24,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1043. [2018-10-24 23:45:24,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2018-10-24 23:45:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1647 transitions. [2018-10-24 23:45:24,149 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1647 transitions. Word has length 34 [2018-10-24 23:45:24,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:45:24,150 INFO L481 AbstractCegarLoop]: Abstraction has 1043 states and 1647 transitions. [2018-10-24 23:45:24,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:45:24,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1647 transitions. [2018-10-24 23:45:24,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-24 23:45:24,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:45:24,157 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:45:24,157 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:45:24,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:45:24,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1635059426, now seen corresponding path program 1 times [2018-10-24 23:45:24,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:45:24,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:45:24,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:45:24,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:45:24,160 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:45:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:45:24,512 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:45:24,570 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:45:24,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:45:24,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:45:24,571 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:45:24,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:45:24,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:45:24,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:45:24,574 INFO L87 Difference]: Start difference. First operand 1043 states and 1647 transitions. Second operand 5 states. [2018-10-24 23:45:33,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:45:33,406 INFO L93 Difference]: Finished difference Result 3017 states and 4847 transitions. [2018-10-24 23:45:33,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:45:33,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2018-10-24 23:45:33,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:45:33,421 INFO L225 Difference]: With dead ends: 3017 [2018-10-24 23:45:33,421 INFO L226 Difference]: Without dead ends: 1980 [2018-10-24 23:45:33,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:45:33,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2018-10-24 23:45:33,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1954. [2018-10-24 23:45:33,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2018-10-24 23:45:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2892 transitions. [2018-10-24 23:45:33,497 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2892 transitions. Word has length 106 [2018-10-24 23:45:33,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:45:33,498 INFO L481 AbstractCegarLoop]: Abstraction has 1954 states and 2892 transitions. [2018-10-24 23:45:33,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:45:33,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2892 transitions. [2018-10-24 23:45:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-24 23:45:33,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:45:33,503 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:45:33,503 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:45:33,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:45:33,504 INFO L82 PathProgramCache]: Analyzing trace with hash -697579286, now seen corresponding path program 1 times [2018-10-24 23:45:33,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:45:33,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:45:33,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:45:33,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:45:33,505 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:45:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:45:34,083 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:45:34,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:45:34,084 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:45:34,085 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2018-10-24 23:45:34,087 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [882], [884], [887], [895], [903], [911], [919], [927], [935], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-10-24 23:45:34,156 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:45:34,157 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:45:35,820 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 23:45:35,821 INFO L272 AbstractInterpreter]: Visited 83 different actions 235 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-10-24 23:45:35,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:45:35,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 23:45:35,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:45:35,858 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 23:45:35,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:45:35,879 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 23:45:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:45:35,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 23:45:39,738 WARN L179 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 32 [2018-10-24 23:45:41,995 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:45:41,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 23:45:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:45:42,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-24 23:45:42,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 6] total 11 [2018-10-24 23:45:42,402 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:45:42,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:45:42,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:45:42,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=78, Unknown=2, NotChecked=0, Total=110 [2018-10-24 23:45:42,403 INFO L87 Difference]: Start difference. First operand 1954 states and 2892 transitions. Second operand 3 states. [2018-10-24 23:45:47,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:45:47,420 INFO L93 Difference]: Finished difference Result 4803 states and 7423 transitions. [2018-10-24 23:45:47,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:45:47,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-10-24 23:45:47,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:45:47,438 INFO L225 Difference]: With dead ends: 4803 [2018-10-24 23:45:47,438 INFO L226 Difference]: Without dead ends: 2855 [2018-10-24 23:45:47,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 214 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=30, Invalid=78, Unknown=2, NotChecked=0, Total=110 [2018-10-24 23:45:47,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2018-10-24 23:45:47,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2852. [2018-10-24 23:45:47,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2018-10-24 23:45:47,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4198 transitions. [2018-10-24 23:45:47,522 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4198 transitions. Word has length 109 [2018-10-24 23:45:47,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:45:47,523 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 4198 transitions. [2018-10-24 23:45:47,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:45:47,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4198 transitions. [2018-10-24 23:45:47,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-24 23:45:47,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:45:47,526 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:45:47,527 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:45:47,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:45:47,527 INFO L82 PathProgramCache]: Analyzing trace with hash 666938066, now seen corresponding path program 1 times [2018-10-24 23:45:47,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:45:47,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:45:47,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:45:47,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:45:47,529 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:45:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:45:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:45:47,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:45:47,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:45:47,721 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:45:47,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:45:47,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:45:47,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:45:47,722 INFO L87 Difference]: Start difference. First operand 2852 states and 4198 transitions. Second operand 6 states. [2018-10-24 23:45:53,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:45:53,835 INFO L93 Difference]: Finished difference Result 7097 states and 10487 transitions. [2018-10-24 23:45:53,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:45:53,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2018-10-24 23:45:53,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:45:53,863 INFO L225 Difference]: With dead ends: 7097 [2018-10-24 23:45:53,863 INFO L226 Difference]: Without dead ends: 4251 [2018-10-24 23:45:53,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:45:53,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4251 states. [2018-10-24 23:45:53,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4251 to 4216. [2018-10-24 23:45:53,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4216 states. [2018-10-24 23:45:53,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4216 states to 4216 states and 5447 transitions. [2018-10-24 23:45:53,998 INFO L78 Accepts]: Start accepts. Automaton has 4216 states and 5447 transitions. Word has length 114 [2018-10-24 23:45:53,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:45:53,999 INFO L481 AbstractCegarLoop]: Abstraction has 4216 states and 5447 transitions. [2018-10-24 23:45:54,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:45:54,000 INFO L276 IsEmpty]: Start isEmpty. Operand 4216 states and 5447 transitions. [2018-10-24 23:45:54,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-24 23:45:54,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:45:54,009 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:45:54,010 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:45:54,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:45:54,010 INFO L82 PathProgramCache]: Analyzing trace with hash -807827619, now seen corresponding path program 1 times [2018-10-24 23:45:54,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:45:54,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:45:54,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:45:54,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:45:54,011 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:45:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:45:54,399 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:45:54,712 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 99 proven. 35 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 23:45:54,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:45:54,712 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:45:54,713 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 210 with the following transitions: [2018-10-24 23:45:54,713 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [882], [884], [887], [895], [903], [911], [919], [927], [935], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1278], [1279], [1282], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-10-24 23:45:54,723 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:45:54,723 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:45:55,164 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 23:45:55,165 INFO L272 AbstractInterpreter]: Visited 97 different actions 190 times. Merged at 7 different actions 8 times. Never widened. Found 2 fixpoints after 1 different actions. Largest state had 26 variables. [2018-10-24 23:45:55,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:45:55,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 23:45:55,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:45:55,202 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 23:45:55,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:45:55,213 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 23:45:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:45:55,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 23:45:55,489 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-24 23:45:55,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 23:45:55,825 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-24 23:45:55,847 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:45:55,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2018-10-24 23:45:55,847 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:45:55,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:45:55,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:45:55,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:45:55,851 INFO L87 Difference]: Start difference. First operand 4216 states and 5447 transitions. Second operand 3 states. [2018-10-24 23:46:00,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:46:00,047 INFO L93 Difference]: Finished difference Result 8426 states and 10906 transitions. [2018-10-24 23:46:00,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:46:00,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2018-10-24 23:46:00,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:46:00,071 INFO L225 Difference]: With dead ends: 8426 [2018-10-24 23:46:00,072 INFO L226 Difference]: Without dead ends: 4216 [2018-10-24 23:46:00,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 418 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:46:00,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4216 states. [2018-10-24 23:46:00,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4216 to 4216. [2018-10-24 23:46:00,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4216 states. [2018-10-24 23:46:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4216 states to 4216 states and 5183 transitions. [2018-10-24 23:46:00,183 INFO L78 Accepts]: Start accepts. Automaton has 4216 states and 5183 transitions. Word has length 209 [2018-10-24 23:46:00,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:46:00,185 INFO L481 AbstractCegarLoop]: Abstraction has 4216 states and 5183 transitions. [2018-10-24 23:46:00,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:46:00,185 INFO L276 IsEmpty]: Start isEmpty. Operand 4216 states and 5183 transitions. [2018-10-24 23:46:00,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-24 23:46:00,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:46:00,189 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:46:00,189 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:46:00,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:46:00,189 INFO L82 PathProgramCache]: Analyzing trace with hash 158332413, now seen corresponding path program 1 times [2018-10-24 23:46:00,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:46:00,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:46:00,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:46:00,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:46:00,191 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:46:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:46:00,464 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 57 proven. 61 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-24 23:46:00,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:46:00,464 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:46:00,464 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-10-24 23:46:00,465 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [882], [884], [887], [895], [903], [911], [919], [927], [935], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1211], [1212], [1216], [1220], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-10-24 23:46:00,470 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:46:00,470 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:46:00,677 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:46:00,677 INFO L272 AbstractInterpreter]: Visited 115 different actions 115 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-24 23:46:00,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:46:00,712 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:46:01,212 INFO L232 lantSequenceWeakener]: Weakened 207 states. On average, predicates are now at 75.28% of their original sizes. [2018-10-24 23:46:01,212 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:46:01,450 INFO L413 sIntCurrentIteration]: We have 215 unified AI predicates [2018-10-24 23:46:01,450 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:46:01,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:46:01,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-10-24 23:46:01,451 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:46:01,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:46:01,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:46:01,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:46:01,452 INFO L87 Difference]: Start difference. First operand 4216 states and 5183 transitions. Second operand 6 states. [2018-10-24 23:46:39,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:46:39,613 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-24 23:46:39,619 INFO L168 Benchmark]: Toolchain (without parser) took 101580.31 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.9 GB in the end (delta: -2.5 GB). Peak memory consumption was 144.2 MB. Max. memory is 7.1 GB. [2018-10-24 23:46:39,620 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 23:46:39,621 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1651.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 126.8 MB). Peak memory consumption was 126.8 MB. Max. memory is 7.1 GB. [2018-10-24 23:46:39,622 INFO L168 Benchmark]: Boogie Procedure Inliner took 472.36 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 773.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -923.7 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. [2018-10-24 23:46:39,623 INFO L168 Benchmark]: Boogie Preprocessor took 282.74 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:46:39,624 INFO L168 Benchmark]: RCFGBuilder took 11976.40 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 472.9 MB). Peak memory consumption was 472.9 MB. Max. memory is 7.1 GB. [2018-10-24 23:46:39,624 INFO L168 Benchmark]: TraceAbstraction took 87191.52 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.7 GB in the beginning and 3.9 GB in the end (delta: -2.2 GB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 23:46:39,630 INFO L336 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 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1651.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 126.8 MB). Peak memory consumption was 126.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 472.36 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 773.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -923.7 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 282.74 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11976.40 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 472.9 MB). Peak memory consumption was 472.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 87191.52 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.7 GB in the beginning and 3.9 GB in the end (delta: -2.2 GB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger: modulus not positive: java.math.BigInteger.mod(BigInteger.java:2458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...