java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label58_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 06:54:04,105 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 06:54:04,108 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 06:54:04,126 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 06:54:04,126 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 06:54:04,127 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 06:54:04,129 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 06:54:04,131 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 06:54:04,135 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 06:54:04,142 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 06:54:04,145 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 06:54:04,145 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 06:54:04,146 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 06:54:04,147 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 06:54:04,149 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 06:54:04,149 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 06:54:04,150 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 06:54:04,152 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 06:54:04,153 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 06:54:04,155 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 06:54:04,156 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 06:54:04,158 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 06:54:04,160 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 06:54:04,160 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 06:54:04,160 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 06:54:04,161 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 06:54:04,162 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 06:54:04,163 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 06:54:04,164 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 06:54:04,165 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 06:54:04,165 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 06:54:04,166 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 06:54:04,166 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 06:54:04,166 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 06:54:04,167 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 06:54:04,168 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 06:54:04,168 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf [2018-09-19 06:54:04,194 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 06:54:04,194 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 06:54:04,195 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 06:54:04,195 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 06:54:04,195 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 06:54:04,196 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 06:54:04,196 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 06:54:04,196 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 06:54:04,196 INFO L133 SettingsManager]: * Abstract domain=CongruenceDomain [2018-09-19 06:54:04,196 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 06:54:04,197 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 06:54:04,197 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 06:54:04,197 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 06:54:04,198 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 06:54:04,198 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 06:54:04,198 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 06:54:04,198 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 06:54:04,198 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 06:54:04,199 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 06:54:04,199 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 06:54:04,199 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 06:54:04,199 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 06:54:04,199 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 06:54:04,200 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 06:54:04,200 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 06:54:04,200 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 06:54:04,200 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 06:54:04,200 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 06:54:04,201 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 06:54:04,201 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 06:54:04,201 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 06:54:04,201 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 06:54:04,201 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 06:54:04,202 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 06:54:04,202 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 06:54:04,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 06:54:04,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 06:54:04,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 06:54:04,279 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 06:54:04,279 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 06:54:04,280 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label58_true-unreach-call_false-termination.c [2018-09-19 06:54:04,631 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc59f60c/cf4163a393874377adf8b2696c37f2a4/FLAG2e86eb1a4 [2018-09-19 06:54:04,914 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 06:54:04,915 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label58_true-unreach-call_false-termination.c [2018-09-19 06:54:04,936 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc59f60c/cf4163a393874377adf8b2696c37f2a4/FLAG2e86eb1a4 [2018-09-19 06:54:04,964 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc59f60c/cf4163a393874377adf8b2696c37f2a4 [2018-09-19 06:54:04,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 06:54:04,981 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 06:54:04,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 06:54:04,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 06:54:04,990 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 06:54:04,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:54:04" (1/1) ... [2018-09-19 06:54:04,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b894ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:54:04, skipping insertion in model container [2018-09-19 06:54:04,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:54:04" (1/1) ... [2018-09-19 06:54:05,007 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 06:54:05,569 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:54:05,595 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 06:54:05,716 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:54:05,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:54:05 WrapperNode [2018-09-19 06:54:05,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 06:54:05,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 06:54:05,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 06:54:05,757 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 06:54:05,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:54:05" (1/1) ... [2018-09-19 06:54:05,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:54:05" (1/1) ... [2018-09-19 06:54:05,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 06:54:05,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 06:54:05,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 06:54:05,843 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 06:54:05,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:54:05" (1/1) ... [2018-09-19 06:54:05,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:54:05" (1/1) ... [2018-09-19 06:54:05,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:54:05" (1/1) ... [2018-09-19 06:54:05,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:54:05" (1/1) ... [2018-09-19 06:54:06,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:54:05" (1/1) ... [2018-09-19 06:54:06,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:54:05" (1/1) ... [2018-09-19 06:54:06,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:54:05" (1/1) ... [2018-09-19 06:54:06,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 06:54:06,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 06:54:06,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 06:54:06,077 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 06:54:06,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:54:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 06:54:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 06:54:06,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 06:54:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 06:54:06,145 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 06:54:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 06:54:06,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 06:54:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 06:54:06,146 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 06:54:09,345 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 06:54:09,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:54:09 BoogieIcfgContainer [2018-09-19 06:54:09,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 06:54:09,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 06:54:09,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 06:54:09,355 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 06:54:09,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 06:54:04" (1/3) ... [2018-09-19 06:54:09,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90e432b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:54:09, skipping insertion in model container [2018-09-19 06:54:09,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:54:05" (2/3) ... [2018-09-19 06:54:09,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90e432b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:54:09, skipping insertion in model container [2018-09-19 06:54:09,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:54:09" (3/3) ... [2018-09-19 06:54:09,359 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label58_true-unreach-call_false-termination.c [2018-09-19 06:54:09,370 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 06:54:09,379 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 06:54:09,434 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 06:54:09,435 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 06:54:09,435 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 06:54:09,435 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 06:54:09,436 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 06:54:09,436 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 06:54:09,436 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 06:54:09,436 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 06:54:09,436 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 06:54:09,464 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-09-19 06:54:09,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-19 06:54:09,477 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:54:09,479 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-19 06:54:09,480 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:54:09,485 INFO L82 PathProgramCache]: Analyzing trace with hash 361697296, now seen corresponding path program 1 times [2018-09-19 06:54:09,487 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:54:09,488 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2018-09-19 06:54:09,491 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [551], [553], [867], [871], [877], [881], [888], [889], [890], [892] [2018-09-19 06:54:09,530 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-19 06:54:09,530 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:54:09,790 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:54:09,793 INFO L272 AbstractInterpreter]: Visited 109 different actions 109 times. Never merged. Never widened. Never found a fixpoint. Largest state had 37 variables. [2018-09-19 06:54:09,815 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:54:10,061 INFO L232 lantSequenceWeakener]: Weakened 107 states. On average, predicates are now at 80.78% of their original sizes. [2018-09-19 06:54:10,061 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:54:10,321 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:54:10,323 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:54:10,323 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 06:54:10,324 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:54:10,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 06:54:10,342 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 06:54:10,343 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-19 06:54:10,346 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 6 states. [2018-09-19 06:54:13,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:54:13,560 INFO L93 Difference]: Finished difference Result 622 states and 1061 transitions. [2018-09-19 06:54:13,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-19 06:54:13,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-09-19 06:54:13,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:54:13,580 INFO L225 Difference]: With dead ends: 622 [2018-09-19 06:54:13,580 INFO L226 Difference]: Without dead ends: 383 [2018-09-19 06:54:13,586 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-19 06:54:13,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-09-19 06:54:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 380. [2018-09-19 06:54:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-09-19 06:54:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 531 transitions. [2018-09-19 06:54:13,659 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 531 transitions. Word has length 110 [2018-09-19 06:54:13,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:54:13,660 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 531 transitions. [2018-09-19 06:54:13,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 06:54:13,661 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 531 transitions. [2018-09-19 06:54:13,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-19 06:54:13,668 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:54:13,668 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-19 06:54:13,669 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:54:13,669 INFO L82 PathProgramCache]: Analyzing trace with hash 142681137, now seen corresponding path program 1 times [2018-09-19 06:54:13,669 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:54:13,670 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 121 with the following transitions: [2018-09-19 06:54:13,670 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [551], [553], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-19 06:54:13,675 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-19 06:54:13,675 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:54:13,790 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:54:13,791 INFO L272 AbstractInterpreter]: Visited 113 different actions 220 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-09-19 06:54:13,833 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:54:13,979 INFO L232 lantSequenceWeakener]: Weakened 117 states. On average, predicates are now at 80.83% of their original sizes. [2018-09-19 06:54:13,979 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:54:14,317 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:54:14,318 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:54:14,318 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 06:54:14,318 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:54:14,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 06:54:14,320 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 06:54:14,320 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-19 06:54:14,322 INFO L87 Difference]: Start difference. First operand 380 states and 531 transitions. Second operand 9 states. [2018-09-19 06:54:17,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:54:17,714 INFO L93 Difference]: Finished difference Result 908 states and 1353 transitions. [2018-09-19 06:54:17,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 06:54:17,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2018-09-19 06:54:17,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:54:17,721 INFO L225 Difference]: With dead ends: 908 [2018-09-19 06:54:17,721 INFO L226 Difference]: Without dead ends: 534 [2018-09-19 06:54:17,724 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 126 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-19 06:54:17,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-09-19 06:54:17,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 528. [2018-09-19 06:54:17,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-09-19 06:54:17,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 706 transitions. [2018-09-19 06:54:17,758 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 706 transitions. Word has length 120 [2018-09-19 06:54:17,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:54:17,759 INFO L480 AbstractCegarLoop]: Abstraction has 528 states and 706 transitions. [2018-09-19 06:54:17,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 06:54:17,759 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 706 transitions. [2018-09-19 06:54:17,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-19 06:54:17,766 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:54:17,766 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-19 06:54:17,766 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:54:17,767 INFO L82 PathProgramCache]: Analyzing trace with hash -2072090327, now seen corresponding path program 1 times [2018-09-19 06:54:17,767 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:54:17,767 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 125 with the following transitions: [2018-09-19 06:54:17,771 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [551], [553], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-19 06:54:17,775 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-19 06:54:17,775 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:54:17,856 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:54:17,856 INFO L272 AbstractInterpreter]: Visited 113 different actions 220 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-09-19 06:54:17,896 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:54:18,015 INFO L232 lantSequenceWeakener]: Weakened 121 states. On average, predicates are now at 82.58% of their original sizes. [2018-09-19 06:54:18,015 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:54:18,470 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:54:18,470 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:54:18,471 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 06:54:18,471 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:54:18,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 06:54:18,472 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 06:54:18,472 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-19 06:54:18,472 INFO L87 Difference]: Start difference. First operand 528 states and 706 transitions. Second operand 9 states. [2018-09-19 06:54:20,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:54:20,611 INFO L93 Difference]: Finished difference Result 1211 states and 1711 transitions. [2018-09-19 06:54:20,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 06:54:20,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2018-09-19 06:54:20,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:54:20,619 INFO L225 Difference]: With dead ends: 1211 [2018-09-19 06:54:20,620 INFO L226 Difference]: Without dead ends: 689 [2018-09-19 06:54:20,621 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 130 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-19 06:54:20,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2018-09-19 06:54:20,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 679. [2018-09-19 06:54:20,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2018-09-19 06:54:20,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 895 transitions. [2018-09-19 06:54:20,650 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 895 transitions. Word has length 124 [2018-09-19 06:54:20,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:54:20,651 INFO L480 AbstractCegarLoop]: Abstraction has 679 states and 895 transitions. [2018-09-19 06:54:20,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 06:54:20,651 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 895 transitions. [2018-09-19 06:54:20,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-09-19 06:54:20,654 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:54:20,655 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-19 06:54:20,655 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:54:20,655 INFO L82 PathProgramCache]: Analyzing trace with hash -80250532, now seen corresponding path program 1 times [2018-09-19 06:54:20,655 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:54:20,656 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2018-09-19 06:54:20,656 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [551], [553], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-19 06:54:20,658 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-19 06:54:20,659 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:54:20,762 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:54:20,762 INFO L272 AbstractInterpreter]: Visited 114 different actions 333 times. Merged at 7 different actions 13 times. Never widened. Found 3 fixpoints after 1 different actions. Largest state had 38 variables. [2018-09-19 06:54:20,803 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:54:20,932 INFO L232 lantSequenceWeakener]: Weakened 126 states. On average, predicates are now at 84.76% of their original sizes. [2018-09-19 06:54:20,932 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:54:21,525 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:54:21,526 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:54:21,526 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 06:54:21,526 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:54:21,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 06:54:21,527 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 06:54:21,527 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-19 06:54:21,528 INFO L87 Difference]: Start difference. First operand 679 states and 895 transitions. Second operand 9 states. [2018-09-19 06:54:24,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:54:24,864 INFO L93 Difference]: Finished difference Result 1587 states and 2223 transitions. [2018-09-19 06:54:24,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-19 06:54:24,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2018-09-19 06:54:24,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:54:24,871 INFO L225 Difference]: With dead ends: 1587 [2018-09-19 06:54:24,871 INFO L226 Difference]: Without dead ends: 914 [2018-09-19 06:54:24,874 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 139 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2018-09-19 06:54:24,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2018-09-19 06:54:24,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 903. [2018-09-19 06:54:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2018-09-19 06:54:24,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1180 transitions. [2018-09-19 06:54:24,907 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1180 transitions. Word has length 129 [2018-09-19 06:54:24,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:54:24,908 INFO L480 AbstractCegarLoop]: Abstraction has 903 states and 1180 transitions. [2018-09-19 06:54:24,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 06:54:24,909 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1180 transitions. [2018-09-19 06:54:24,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-19 06:54:24,913 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:54:24,913 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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-09-19 06:54:24,914 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:54:24,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1649630047, now seen corresponding path program 1 times [2018-09-19 06:54:24,914 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:54:24,915 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2018-09-19 06:54:24,915 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [551], [553], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-19 06:54:24,918 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-19 06:54:24,918 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:54:25,032 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 06:54:25,032 INFO L272 AbstractInterpreter]: Visited 115 different actions 335 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-09-19 06:54:25,071 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 06:54:25,114 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 06:54:25,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 06:54:25 BoogieIcfgContainer [2018-09-19 06:54:25,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 06:54:25,115 INFO L168 Benchmark]: Toolchain (without parser) took 20138.19 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 902.8 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -174.7 MB). Peak memory consumption was 728.1 MB. Max. memory is 7.1 GB. [2018-09-19 06:54:25,119 INFO L168 Benchmark]: CDTParser took 0.23 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-09-19 06:54:25,120 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-19 06:54:25,122 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 06:54:25,122 INFO L168 Benchmark]: Boogie Preprocessor took 234.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -857.7 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. [2018-09-19 06:54:25,124 INFO L168 Benchmark]: RCFGBuilder took 3269.01 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.2 MB). Peak memory consumption was 104.2 MB. Max. memory is 7.1 GB. [2018-09-19 06:54:25,125 INFO L168 Benchmark]: TraceAbstraction took 15767.83 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 130.5 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 536.5 MB). Peak memory consumption was 667.0 MB. Max. memory is 7.1 GB. [2018-09-19 06:54:25,134 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.23 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 773.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 85.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 234.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -857.7 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3269.01 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.2 MB). Peak memory consumption was 104.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15767.83 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 130.5 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 536.5 MB). Peak memory consumption was 667.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 481]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L51] a28 = 11 [L52] a25 = 1 [L53] RET return 26; [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND TRUE ((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)) [L100] a17 = 7 [L101] a25 = 0 [L102] a11 = 1 [L103] a28 = 10 [L104] a19 = 0 [L105] RET return -1; [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L426] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L429] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) [L432] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) [L435] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L438] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L441] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==8))) [L444] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==11))&&!(a19==1))&&(a21==1))&&(a17==8))) [L447] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L450] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==7))) [L453] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) [L456] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==11))&&(a19==1))&&(a21==1))&&(a17==7))) [L459] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==7))) [L462] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==7))) [L465] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) [L468] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L471] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==8))) [L474] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==8))) [L477] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==7))) [L480] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==11))&&!(a19==1))&&(a21==1))&&(a17==8)) [L481] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. UNKNOWN Result, 15.6s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 12.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 883 SDtfs, 2596 SDslu, 1253 SDs, 0 SdLazy, 5888 SolverSat, 857 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 505 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=903occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.9975549116734607 AbsIntWeakeningRatio, 0.2254697286012526 AbsIntAvgWeakeningVarsNumRemoved, 27.588726513569938 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 30 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label58_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_06-54-25-156.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label58_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_06-54-25-156.csv Received shutdown request...