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/Problem12_label09_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:36:34,953 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:36:34,955 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:36:34,968 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:36:34,968 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:36:34,969 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:36:34,971 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:36:34,973 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:36:34,983 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:36:34,984 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:36:34,985 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:36:34,985 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:36:34,986 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:36:34,987 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:36:34,988 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:36:34,989 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:36:34,990 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:36:34,992 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:36:34,994 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:36:34,995 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:36:34,997 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:36:34,998 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:36:35,001 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:36:35,001 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:36:35,001 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:36:35,002 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:36:35,003 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:36:35,004 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:36:35,005 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:36:35,006 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:36:35,006 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:36:35,007 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:36:35,007 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:36:35,007 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:36:35,008 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:36:35,009 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:36:35,009 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-25 01:36:35,025 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:36:35,025 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:36:35,026 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:36:35,026 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:36:35,026 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:36:35,027 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:36:35,027 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:36:35,027 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:36:35,027 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:36:35,027 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:36:35,028 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:36:35,028 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:36:35,028 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:36:35,028 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:36:35,029 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:36:35,029 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:36:35,029 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:36:35,030 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:36:35,030 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:36:35,030 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:36:35,030 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:36:35,030 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:36:35,031 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:36:35,031 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:36:35,031 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:36:35,031 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:36:35,032 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:36:35,032 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:36:35,032 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:36:35,032 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:36:35,032 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:36:35,033 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:36:35,033 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:36:35,033 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:36:35,033 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:36:35,033 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:36:35,090 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:36:35,109 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:36:35,114 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:36:35,116 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:36:35,116 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:36:35,117 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label09_true-unreach-call.c [2018-10-25 01:36:35,186 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b75697e6c/1caad5250d8841b2af0fab04dfce0808/FLAG3a7ba7866 [2018-10-25 01:36:36,015 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:36:36,016 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label09_true-unreach-call.c [2018-10-25 01:36:36,051 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b75697e6c/1caad5250d8841b2af0fab04dfce0808/FLAG3a7ba7866 [2018-10-25 01:36:36,071 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b75697e6c/1caad5250d8841b2af0fab04dfce0808 [2018-10-25 01:36:36,085 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:36:36,087 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:36:36,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:36:36,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:36:36,097 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:36:36,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:36:36" (1/1) ... [2018-10-25 01:36:36,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8de4687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:36, skipping insertion in model container [2018-10-25 01:36:36,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:36:36" (1/1) ... [2018-10-25 01:36:36,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:36:36,312 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:36:37,560 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:36:37,565 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:36:38,243 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:36:38,276 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:36:38,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:38 WrapperNode [2018-10-25 01:36:38,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:36:38,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:36:38,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:36:38,279 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:36:38,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:38" (1/1) ... [2018-10-25 01:36:38,342 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:38" (1/1) ... [2018-10-25 01:36:38,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:36:38,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:36:38,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:36:38,843 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:36:38,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:38" (1/1) ... [2018-10-25 01:36:38,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:38" (1/1) ... [2018-10-25 01:36:38,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:38" (1/1) ... [2018-10-25 01:36:38,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:38" (1/1) ... [2018-10-25 01:36:39,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:38" (1/1) ... [2018-10-25 01:36:39,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:38" (1/1) ... [2018-10-25 01:36:39,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:38" (1/1) ... [2018-10-25 01:36:39,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:36:39,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:36:39,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:36:39,176 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:36:39,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:38" (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-25 01:36:39,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:36:39,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:36:39,252 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:36:39,252 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:36:39,252 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:36:39,252 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:36:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:36:39,253 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:36:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:36:39,253 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:36:39,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:36:39,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:36:39,255 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:36:39,255 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:36:49,831 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:36:49,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:36:49 BoogieIcfgContainer [2018-10-25 01:36:49,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:36:49,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:36:49,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:36:49,839 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:36:49,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:36:36" (1/3) ... [2018-10-25 01:36:49,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be9eaa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:36:49, skipping insertion in model container [2018-10-25 01:36:49,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:36:38" (2/3) ... [2018-10-25 01:36:49,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be9eaa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:36:49, skipping insertion in model container [2018-10-25 01:36:49,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:36:49" (3/3) ... [2018-10-25 01:36:49,843 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label09_true-unreach-call.c [2018-10-25 01:36:49,854 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:36:49,867 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:36:49,885 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:36:49,933 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:36:49,934 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:36:49,934 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:36:49,934 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:36:49,934 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:36:49,935 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:36:49,935 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:36:49,935 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:36:50,096 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-10-25 01:36:50,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-25 01:36:50,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:36:50,110 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 01:36:50,116 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:36:50,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:36:50,145 INFO L82 PathProgramCache]: Analyzing trace with hash -539031517, now seen corresponding path program 1 times [2018-10-25 01:36:50,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:36:50,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:36:50,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:36:50,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:36:50,200 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:36:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:36:50,733 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:36:50,858 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-25 01:36:50,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:36:50,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:36:50,861 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:36:50,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:36:50,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:36:50,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:36:50,886 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 3 states. [2018-10-25 01:36:57,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:36:57,865 INFO L93 Difference]: Finished difference Result 2446 states and 4700 transitions. [2018-10-25 01:36:57,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:36:57,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-10-25 01:36:57,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:36:57,907 INFO L225 Difference]: With dead ends: 2446 [2018-10-25 01:36:57,907 INFO L226 Difference]: Without dead ends: 1604 [2018-10-25 01:36:57,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:36:57,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2018-10-25 01:36:58,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2018-10-25 01:36:58,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-10-25 01:36:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2969 transitions. [2018-10-25 01:36:58,098 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2969 transitions. Word has length 73 [2018-10-25 01:36:58,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:36:58,099 INFO L481 AbstractCegarLoop]: Abstraction has 1604 states and 2969 transitions. [2018-10-25 01:36:58,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:36:58,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2969 transitions. [2018-10-25 01:36:58,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-25 01:36:58,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:36:58,108 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, 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] [2018-10-25 01:36:58,108 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:36:58,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:36:58,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1174971868, now seen corresponding path program 1 times [2018-10-25 01:36:58,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:36:58,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:36:58,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:36:58,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:36:58,111 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:36:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:36:58,408 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:36:58,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:36:58,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:36:58,409 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:36:58,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:36:58,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:36:58,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:36:58,412 INFO L87 Difference]: Start difference. First operand 1604 states and 2969 transitions. Second operand 5 states. [2018-10-25 01:37:09,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:37:09,318 INFO L93 Difference]: Finished difference Result 4038 states and 7427 transitions. [2018-10-25 01:37:09,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:37:09,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-10-25 01:37:09,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:37:09,335 INFO L225 Difference]: With dead ends: 4038 [2018-10-25 01:37:09,336 INFO L226 Difference]: Without dead ends: 2440 [2018-10-25 01:37:09,341 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-25 01:37:09,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2440 states. [2018-10-25 01:37:09,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2440 to 2413. [2018-10-25 01:37:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2413 states. [2018-10-25 01:37:09,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 4141 transitions. [2018-10-25 01:37:09,413 INFO L78 Accepts]: Start accepts. Automaton has 2413 states and 4141 transitions. Word has length 147 [2018-10-25 01:37:09,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:37:09,414 INFO L481 AbstractCegarLoop]: Abstraction has 2413 states and 4141 transitions. [2018-10-25 01:37:09,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:37:09,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 4141 transitions. [2018-10-25 01:37:09,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-25 01:37:09,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:37:09,418 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, 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] [2018-10-25 01:37:09,419 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:37:09,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:37:09,419 INFO L82 PathProgramCache]: Analyzing trace with hash 710506752, now seen corresponding path program 1 times [2018-10-25 01:37:09,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:37:09,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:09,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:37:09,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:09,421 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:37:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:37:09,688 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:37:09,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:37:09,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:37:09,689 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:37:09,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:37:09,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:37:09,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:37:09,690 INFO L87 Difference]: Start difference. First operand 2413 states and 4141 transitions. Second operand 4 states. [2018-10-25 01:37:19,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:37:19,183 INFO L93 Difference]: Finished difference Result 9492 states and 16758 transitions. [2018-10-25 01:37:19,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:37:19,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-10-25 01:37:19,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:37:19,241 INFO L225 Difference]: With dead ends: 9492 [2018-10-25 01:37:19,241 INFO L226 Difference]: Without dead ends: 7085 [2018-10-25 01:37:19,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:37:19,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7085 states. [2018-10-25 01:37:19,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7085 to 7085. [2018-10-25 01:37:19,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7085 states. [2018-10-25 01:37:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7085 states to 7085 states and 11755 transitions. [2018-10-25 01:37:19,477 INFO L78 Accepts]: Start accepts. Automaton has 7085 states and 11755 transitions. Word has length 149 [2018-10-25 01:37:19,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:37:19,478 INFO L481 AbstractCegarLoop]: Abstraction has 7085 states and 11755 transitions. [2018-10-25 01:37:19,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:37:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 7085 states and 11755 transitions. [2018-10-25 01:37:19,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-25 01:37:19,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:37:19,486 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, 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] [2018-10-25 01:37:19,486 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:37:19,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:37:19,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2064727429, now seen corresponding path program 1 times [2018-10-25 01:37:19,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:37:19,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:19,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:37:19,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:19,488 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:37:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:37:19,779 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:37:19,832 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:37:19,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:37:19,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:37:19,833 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:37:19,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:37:19,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:37:19,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:37:19,834 INFO L87 Difference]: Start difference. First operand 7085 states and 11755 transitions. Second operand 6 states. [2018-10-25 01:37:26,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:37:26,805 INFO L93 Difference]: Finished difference Result 16634 states and 27837 transitions. [2018-10-25 01:37:26,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:37:26,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2018-10-25 01:37:26,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:37:26,857 INFO L225 Difference]: With dead ends: 16634 [2018-10-25 01:37:26,857 INFO L226 Difference]: Without dead ends: 9555 [2018-10-25 01:37:26,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:37:26,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9555 states. [2018-10-25 01:37:27,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9555 to 9513. [2018-10-25 01:37:27,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9513 states. [2018-10-25 01:37:27,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9513 states to 9513 states and 14979 transitions. [2018-10-25 01:37:27,130 INFO L78 Accepts]: Start accepts. Automaton has 9513 states and 14979 transitions. Word has length 176 [2018-10-25 01:37:27,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:37:27,131 INFO L481 AbstractCegarLoop]: Abstraction has 9513 states and 14979 transitions. [2018-10-25 01:37:27,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:37:27,131 INFO L276 IsEmpty]: Start isEmpty. Operand 9513 states and 14979 transitions. [2018-10-25 01:37:27,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-25 01:37:27,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:37:27,147 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 01:37:27,148 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:37:27,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:37:27,148 INFO L82 PathProgramCache]: Analyzing trace with hash -907554919, now seen corresponding path program 1 times [2018-10-25 01:37:27,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:37:27,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:27,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:37:27,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:27,150 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:37:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:37:27,486 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:37:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 132 proven. 69 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:37:27,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:37:27,588 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:37:27,589 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 240 with the following transitions: [2018-10-25 01:37:27,592 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2203], [2211], [2219], [2227], [2235], [2243], [2251], [2259], [2267], [2275], [2283], [2291], [2299], [2307], [2315], [2323], [2331], [2339], [2347], [2351], [2353], [2356], [2361], [2365], [2369], [2373], [2376], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2448], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-25 01:37:27,643 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:37:27,644 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:37:28,137 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:37:28,138 INFO L272 AbstractInterpreter]: Visited 97 different actions 97 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:37:28,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:37:28,180 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:37:28,817 INFO L232 lantSequenceWeakener]: Weakened 230 states. On average, predicates are now at 75.96% of their original sizes. [2018-10-25 01:37:28,817 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:37:29,053 INFO L413 sIntCurrentIteration]: We have 238 unified AI predicates [2018-10-25 01:37:29,053 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:37:29,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:37:29,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:37:29,057 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:37:29,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:37:29,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:37:29,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:37:29,058 INFO L87 Difference]: Start difference. First operand 9513 states and 14979 transitions. Second operand 6 states. [2018-10-25 01:37:38,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:37:38,655 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: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:92) 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.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.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.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) 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-25 01:37:38,667 INFO L168 Benchmark]: Toolchain (without parser) took 62580.63 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -185.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-10-25 01:37:38,668 INFO L168 Benchmark]: CDTParser took 0.21 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-25 01:37:38,669 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2189.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:37:38,671 INFO L168 Benchmark]: Boogie Procedure Inliner took 564.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 812.6 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 68.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:37:38,672 INFO L168 Benchmark]: Boogie Preprocessor took 331.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:37:38,672 INFO L168 Benchmark]: RCFGBuilder took 10656.50 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 647.8 MB). Peak memory consumption was 647.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:37:38,674 INFO L168 Benchmark]: TraceAbstraction took 48832.63 ms. Allocated memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: 695.2 MB). Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: -18.3 MB). Peak memory consumption was 676.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:37:38,684 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.21 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 2189.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 564.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 812.6 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 68.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 331.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10656.50 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 647.8 MB). Peak memory consumption was 647.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48832.63 ms. Allocated memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: 695.2 MB). Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: -18.3 MB). Peak memory consumption was 676.9 MB. 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...