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_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label34_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 01:52:14,157 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 01:52:14,160 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 01:52:14,172 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 01:52:14,172 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 01:52:14,173 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 01:52:14,174 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 01:52:14,176 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 01:52:14,178 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 01:52:14,179 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 01:52:14,179 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 01:52:14,180 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 01:52:14,181 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 01:52:14,182 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 01:52:14,183 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 01:52:14,184 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 01:52:14,185 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 01:52:14,186 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 01:52:14,189 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 01:52:14,190 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 01:52:14,191 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 01:52:14,193 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 01:52:14,195 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 01:52:14,195 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 01:52:14,195 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 01:52:14,196 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 01:52:14,197 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 01:52:14,198 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 01:52:14,199 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 01:52:14,200 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 01:52:14,201 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 01:52:14,201 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 01:52:14,202 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 01:52:14,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 01:52:14,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 01:52:14,203 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 01:52:14,204 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf [2018-09-19 01:52:14,237 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 01:52:14,238 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 01:52:14,244 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 01:52:14,244 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 01:52:14,244 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 01:52:14,244 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 01:52:14,245 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 01:52:14,245 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 01:52:14,245 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 01:52:14,245 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 01:52:14,245 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 01:52:14,246 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 01:52:14,246 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 01:52:14,247 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 01:52:14,247 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 01:52:14,247 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 01:52:14,247 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 01:52:14,247 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 01:52:14,248 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 01:52:14,248 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 01:52:14,249 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 01:52:14,249 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 01:52:14,249 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 01:52:14,249 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 01:52:14,249 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 01:52:14,250 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 01:52:14,250 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 01:52:14,250 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 01:52:14,250 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 01:52:14,250 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 01:52:14,252 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 01:52:14,252 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 01:52:14,252 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 01:52:14,252 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 01:52:14,306 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 01:52:14,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 01:52:14,322 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 01:52:14,324 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 01:52:14,324 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 01:52:14,325 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label34_true-unreach-call_false-termination.c [2018-09-19 01:52:14,661 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad005ef15/641c0056500647f395a7e4d453eff5a2/FLAG1e8fc8497 [2018-09-19 01:52:14,921 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 01:52:14,925 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label34_true-unreach-call_false-termination.c [2018-09-19 01:52:14,950 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad005ef15/641c0056500647f395a7e4d453eff5a2/FLAG1e8fc8497 [2018-09-19 01:52:14,970 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad005ef15/641c0056500647f395a7e4d453eff5a2 [2018-09-19 01:52:14,979 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 01:52:14,983 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 01:52:14,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 01:52:14,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 01:52:14,990 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 01:52:14,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 01:52:14" (1/1) ... [2018-09-19 01:52:14,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@108b7f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:52:14, skipping insertion in model container [2018-09-19 01:52:14,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 01:52:14" (1/1) ... [2018-09-19 01:52:15,007 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 01:52:15,490 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 01:52:15,515 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 01:52:15,645 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 01:52:15,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:52:15 WrapperNode [2018-09-19 01:52:15,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 01:52:15,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 01:52:15,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 01:52:15,711 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 01:52:15,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:52:15" (1/1) ... [2018-09-19 01:52:15,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:52:15" (1/1) ... [2018-09-19 01:52:15,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 01:52:15,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 01:52:15,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 01:52:15,814 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 01:52:15,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:52:15" (1/1) ... [2018-09-19 01:52:15,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:52:15" (1/1) ... [2018-09-19 01:52:15,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:52:15" (1/1) ... [2018-09-19 01:52:15,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:52:15" (1/1) ... [2018-09-19 01:52:15,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:52:15" (1/1) ... [2018-09-19 01:52:16,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:52:15" (1/1) ... [2018-09-19 01:52:16,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:52:15" (1/1) ... [2018-09-19 01:52:16,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 01:52:16,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 01:52:16,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 01:52:16,042 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 01:52:16,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:52:15" (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 01:52:16,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 01:52:16,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 01:52:16,119 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 01:52:16,119 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 01:52:16,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 01:52:16,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 01:52:16,120 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 01:52:16,120 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 01:52:19,548 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 01:52:19,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 01:52:19 BoogieIcfgContainer [2018-09-19 01:52:19,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 01:52:19,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 01:52:19,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 01:52:19,555 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 01:52:19,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 01:52:14" (1/3) ... [2018-09-19 01:52:19,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369aec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 01:52:19, skipping insertion in model container [2018-09-19 01:52:19,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:52:15" (2/3) ... [2018-09-19 01:52:19,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369aec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 01:52:19, skipping insertion in model container [2018-09-19 01:52:19,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 01:52:19" (3/3) ... [2018-09-19 01:52:19,560 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label34_true-unreach-call_false-termination.c [2018-09-19 01:52:19,571 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 01:52:19,580 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 01:52:19,637 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 01:52:19,638 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 01:52:19,638 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 01:52:19,639 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 01:52:19,639 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 01:52:19,639 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 01:52:19,640 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 01:52:19,640 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 01:52:19,640 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 01:52:19,670 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-09-19 01:52:19,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-19 01:52:19,684 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 01:52:19,686 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] [2018-09-19 01:52:19,687 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 01:52:19,693 INFO L82 PathProgramCache]: Analyzing trace with hash -2048669081, now seen corresponding path program 1 times [2018-09-19 01:52:19,696 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 01:52:19,697 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2018-09-19 01:52:19,700 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], [511], [513], [867], [871], [877], [881], [888], [889], [890], [892] [2018-09-19 01:52:19,779 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 01:52:19,779 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 01:52:37,249 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 01:52:37,251 INFO L272 AbstractInterpreter]: Visited 104 different actions 104 times. Never merged. Never widened. Never found a fixpoint. Largest state had 37 variables. [2018-09-19 01:52:37,292 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 01:52:39,837 INFO L232 lantSequenceWeakener]: Weakened 103 states. On average, predicates are now at 80.82% of their original sizes. [2018-09-19 01:52:39,837 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 01:52:40,649 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 01:52:40,651 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 01:52:40,651 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 01:52:40,651 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 01:52:40,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 01:52:40,665 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 01:52:40,666 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-09-19 01:52:40,668 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 10 states. [2018-09-19 01:52:45,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 01:52:45,186 INFO L93 Difference]: Finished difference Result 622 states and 1061 transitions. [2018-09-19 01:52:45,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-19 01:52:45,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2018-09-19 01:52:45,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 01:52:45,209 INFO L225 Difference]: With dead ends: 622 [2018-09-19 01:52:45,209 INFO L226 Difference]: Without dead ends: 383 [2018-09-19 01:52:45,216 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-09-19 01:52:45,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-09-19 01:52:45,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 380. [2018-09-19 01:52:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-09-19 01:52:45,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 531 transitions. [2018-09-19 01:52:45,297 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 531 transitions. Word has length 105 [2018-09-19 01:52:45,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 01:52:45,299 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 531 transitions. [2018-09-19 01:52:45,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 01:52:45,299 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 531 transitions. [2018-09-19 01:52:45,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-19 01:52:45,306 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 01:52:45,306 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] [2018-09-19 01:52:45,307 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 01:52:45,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1840519770, now seen corresponding path program 1 times [2018-09-19 01:52:45,307 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 01:52:45,308 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2018-09-19 01:52:45,308 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], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-19 01:52:45,315 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 01:52:45,315 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 01:53:16,655 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 01:53:16,655 INFO L272 AbstractInterpreter]: Visited 108 different actions 210 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 01:53:16,694 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 01:53:19,367 INFO L232 lantSequenceWeakener]: Weakened 113 states. On average, predicates are now at 80.85% of their original sizes. [2018-09-19 01:53:19,367 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 01:53:20,329 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 01:53:20,329 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 01:53:20,330 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 01:53:20,330 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 01:53:20,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 01:53:20,332 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 01:53:20,332 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-19 01:53:20,332 INFO L87 Difference]: Start difference. First operand 380 states and 531 transitions. Second operand 14 states. [2018-09-19 01:53:28,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 01:53:28,044 INFO L93 Difference]: Finished difference Result 910 states and 1354 transitions. [2018-09-19 01:53:28,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-19 01:53:28,045 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 115 [2018-09-19 01:53:28,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 01:53:28,051 INFO L225 Difference]: With dead ends: 910 [2018-09-19 01:53:28,051 INFO L226 Difference]: Without dead ends: 536 [2018-09-19 01:53:28,056 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 129 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2018-09-19 01:53:28,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-09-19 01:53:28,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 528. [2018-09-19 01:53:28,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-09-19 01:53:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 701 transitions. [2018-09-19 01:53:28,102 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 701 transitions. Word has length 115 [2018-09-19 01:53:28,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 01:53:28,103 INFO L480 AbstractCegarLoop]: Abstraction has 528 states and 701 transitions. [2018-09-19 01:53:28,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 01:53:28,104 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 701 transitions. [2018-09-19 01:53:28,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-09-19 01:53:28,110 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 01:53:28,111 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] [2018-09-19 01:53:28,111 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 01:53:28,111 INFO L82 PathProgramCache]: Analyzing trace with hash 669345198, now seen corresponding path program 1 times [2018-09-19 01:53:28,112 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 01:53:28,112 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2018-09-19 01:53:28,112 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], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-19 01:53:28,117 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 01:53:28,118 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 01:53:55,643 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 01:53:55,643 INFO L272 AbstractInterpreter]: Visited 108 different actions 210 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 01:53:55,653 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 01:53:58,251 INFO L232 lantSequenceWeakener]: Weakened 117 states. On average, predicates are now at 80.84% of their original sizes. [2018-09-19 01:53:58,252 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 01:53:59,631 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 01:53:59,632 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 01:53:59,632 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 01:53:59,632 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 01:53:59,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 01:53:59,633 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 01:53:59,633 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-19 01:53:59,634 INFO L87 Difference]: Start difference. First operand 528 states and 701 transitions. Second operand 14 states. [2018-09-19 01:54:09,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 01:54:09,462 INFO L93 Difference]: Finished difference Result 1208 states and 1697 transitions. [2018-09-19 01:54:09,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-19 01:54:09,465 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 119 [2018-09-19 01:54:09,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 01:54:09,470 INFO L225 Difference]: With dead ends: 1208 [2018-09-19 01:54:09,471 INFO L226 Difference]: Without dead ends: 686 [2018-09-19 01:54:09,473 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 132 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=171, Invalid=585, Unknown=0, NotChecked=0, Total=756 [2018-09-19 01:54:09,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2018-09-19 01:54:09,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 676. [2018-09-19 01:54:09,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-09-19 01:54:09,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 881 transitions. [2018-09-19 01:54:09,513 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 881 transitions. Word has length 119 [2018-09-19 01:54:09,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 01:54:09,513 INFO L480 AbstractCegarLoop]: Abstraction has 676 states and 881 transitions. [2018-09-19 01:54:09,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 01:54:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 881 transitions. [2018-09-19 01:54:09,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-19 01:54:09,521 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 01:54:09,521 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] [2018-09-19 01:54:09,522 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 01:54:09,522 INFO L82 PathProgramCache]: Analyzing trace with hash -283524709, now seen corresponding path program 1 times [2018-09-19 01:54:09,522 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 01:54:09,522 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 125 with the following transitions: [2018-09-19 01:54:09,523 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], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-19 01:54:09,528 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 01:54:09,529 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 01:54:54,518 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 01:54:54,518 INFO L272 AbstractInterpreter]: Visited 109 different actions 319 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 01:54:54,526 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 01:54:56,951 INFO L232 lantSequenceWeakener]: Weakened 122 states. On average, predicates are now at 80.88% of their original sizes. [2018-09-19 01:54:56,951 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 01:54:57,670 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 01:54:57,671 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 01:54:57,671 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 01:54:57,672 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 01:54:57,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 01:54:57,673 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 01:54:57,673 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-19 01:54:57,673 INFO L87 Difference]: Start difference. First operand 676 states and 881 transitions. Second operand 14 states. [2018-09-19 01:55:09,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 01:55:09,199 INFO L93 Difference]: Finished difference Result 1577 states and 2188 transitions. [2018-09-19 01:55:09,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-19 01:55:09,199 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 124 [2018-09-19 01:55:09,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 01:55:09,207 INFO L225 Difference]: With dead ends: 1577 [2018-09-19 01:55:09,207 INFO L226 Difference]: Without dead ends: 907 [2018-09-19 01:55:09,210 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 139 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2018-09-19 01:55:09,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-09-19 01:55:09,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 886. [2018-09-19 01:55:09,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2018-09-19 01:55:09,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1117 transitions. [2018-09-19 01:55:09,252 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1117 transitions. Word has length 124 [2018-09-19 01:55:09,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 01:55:09,253 INFO L480 AbstractCegarLoop]: Abstraction has 886 states and 1117 transitions. [2018-09-19 01:55:09,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 01:55:09,253 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1117 transitions. [2018-09-19 01:55:09,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-19 01:55:09,256 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 01:55:09,257 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2018-09-19 01:55:09,257 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 01:55:09,257 INFO L82 PathProgramCache]: Analyzing trace with hash -999247390, now seen corresponding path program 1 times [2018-09-19 01:55:09,258 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 01:55:09,258 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 139 with the following transitions: [2018-09-19 01:55:09,258 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [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], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-19 01:55:09,264 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 01:55:09,264 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 01:56:11,922 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 01:56:11,922 INFO L272 AbstractInterpreter]: Visited 110 different actions 440 times. Merged at 8 different actions 33 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 38 variables. [2018-09-19 01:56:11,930 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 01:56:14,185 INFO L232 lantSequenceWeakener]: Weakened 136 states. On average, predicates are now at 80.88% of their original sizes. [2018-09-19 01:56:14,186 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 01:56:14,944 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 01:56:14,944 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 01:56:14,944 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 01:56:14,945 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 01:56:14,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 01:56:14,945 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 01:56:14,945 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-19 01:56:14,946 INFO L87 Difference]: Start difference. First operand 886 states and 1117 transitions. Second operand 14 states. [2018-09-19 01:56:22,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 01:56:22,834 INFO L93 Difference]: Finished difference Result 2074 states and 2748 transitions. [2018-09-19 01:56:22,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-19 01:56:22,835 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 138 [2018-09-19 01:56:22,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 01:56:22,843 INFO L225 Difference]: With dead ends: 2074 [2018-09-19 01:56:22,843 INFO L226 Difference]: Without dead ends: 1194 [2018-09-19 01:56:22,847 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 153 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2018-09-19 01:56:22,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2018-09-19 01:56:22,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1159. [2018-09-19 01:56:22,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1159 states. [2018-09-19 01:56:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1430 transitions. [2018-09-19 01:56:22,894 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1430 transitions. Word has length 138 [2018-09-19 01:56:22,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 01:56:22,895 INFO L480 AbstractCegarLoop]: Abstraction has 1159 states and 1430 transitions. [2018-09-19 01:56:22,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 01:56:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1430 transitions. [2018-09-19 01:56:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-19 01:56:22,899 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 01:56:22,899 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] [2018-09-19 01:56:22,899 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 01:56:22,900 INFO L82 PathProgramCache]: Analyzing trace with hash 506322742, now seen corresponding path program 1 times [2018-09-19 01:56:22,900 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 01:56:22,900 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 143 with the following transitions: [2018-09-19 01:56:22,901 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], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-19 01:56:22,905 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 01:56:22,905 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) Received shutdown request... [2018-09-19 01:56:40,985 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-19 01:56:40,986 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-19 01:56:40,987 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 01:56:41,030 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 01:56:41,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 01:56:41 BoogieIcfgContainer [2018-09-19 01:56:41,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 01:56:41,035 INFO L168 Benchmark]: Toolchain (without parser) took 266055.06 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 01:56:41,040 INFO L168 Benchmark]: CDTParser took 0.19 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 01:56:41,041 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.78 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 01:56:41,043 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.61 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 01:56:41,044 INFO L168 Benchmark]: Boogie Preprocessor took 227.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -831.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2018-09-19 01:56:41,046 INFO L168 Benchmark]: RCFGBuilder took 3507.88 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: 108.0 MB). Peak memory consumption was 108.0 MB. Max. memory is 7.1 GB. [2018-09-19 01:56:41,047 INFO L168 Benchmark]: TraceAbstraction took 261483.20 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 01:56:41,055 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.19 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. * CACSL2BoogieTranslator took 726.78 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 102.61 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 227.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -831.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3507.88 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: 108.0 MB). Peak memory consumption was 108.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 261483.20 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 466]: 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 TRUE (((((!(a25==1)&&!(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7)) [L466] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. UNKNOWN Result, 261.4s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 41.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1131 SDtfs, 4997 SDslu, 2390 SDs, 0 SdLazy, 10555 SolverSat, 1071 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.8s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 661 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1159occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 202.2s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.99303195371281 AbsIntWeakeningRatio, 0.24664429530201343 AbsIntAvgWeakeningVarsNumRemoved, 2429.1375838926174 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 77 StatesRemovedByMinimization, 5 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_label34_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_01-56-41-076.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label34_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_01-56-41-076.csv Completed graceful shutdown