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/Problem01_label04_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 15:48:08,174 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 15:48:08,177 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 15:48:08,192 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 15:48:08,192 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 15:48:08,193 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 15:48:08,197 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 15:48:08,199 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 15:48:08,201 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 15:48:08,202 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 15:48:08,203 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 15:48:08,203 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 15:48:08,204 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 15:48:08,205 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 15:48:08,206 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 15:48:08,207 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 15:48:08,208 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 15:48:08,210 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 15:48:08,212 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 15:48:08,213 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 15:48:08,215 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 15:48:08,216 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 15:48:08,219 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 15:48:08,219 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 15:48:08,219 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 15:48:08,220 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 15:48:08,221 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 15:48:08,222 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 15:48:08,223 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 15:48:08,224 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 15:48:08,224 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 15:48:08,225 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 15:48:08,226 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 15:48:08,226 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 15:48:08,227 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 15:48:08,228 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 15:48:08,228 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-15 15:48:08,245 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 15:48:08,246 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 15:48:08,247 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 15:48:08,247 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 15:48:08,247 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 15:48:08,247 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 15:48:08,248 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 15:48:08,248 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-15 15:48:08,248 INFO L133 SettingsManager]: * Abstract domain=CongruenceDomain [2018-09-15 15:48:08,248 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 15:48:08,249 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 15:48:08,249 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 15:48:08,250 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 15:48:08,250 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 15:48:08,250 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 15:48:08,250 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 15:48:08,250 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 15:48:08,250 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 15:48:08,251 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 15:48:08,251 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 15:48:08,251 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 15:48:08,251 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 15:48:08,251 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 15:48:08,252 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 15:48:08,252 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 15:48:08,252 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 15:48:08,252 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 15:48:08,253 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 15:48:08,253 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 15:48:08,253 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 15:48:08,253 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 15:48:08,253 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 15:48:08,254 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 15:48:08,254 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 15:48:08,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 15:48:08,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 15:48:08,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 15:48:08,351 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 15:48:08,352 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 15:48:08,353 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label04_true-unreach-call_false-termination.c [2018-09-15 15:48:08,699 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0366d6aed/2678af2c866f43f09bccf2ac7261f111/FLAG1e1ed9d6e [2018-09-15 15:48:09,001 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 15:48:09,002 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label04_true-unreach-call_false-termination.c [2018-09-15 15:48:09,022 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0366d6aed/2678af2c866f43f09bccf2ac7261f111/FLAG1e1ed9d6e [2018-09-15 15:48:09,037 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0366d6aed/2678af2c866f43f09bccf2ac7261f111 [2018-09-15 15:48:09,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 15:48:09,053 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 15:48:09,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 15:48:09,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 15:48:09,061 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 15:48:09,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 03:48:09" (1/1) ... [2018-09-15 15:48:09,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66ef8fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:09, skipping insertion in model container [2018-09-15 15:48:09,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 03:48:09" (1/1) ... [2018-09-15 15:48:09,079 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 15:48:09,588 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 15:48:09,609 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 15:48:09,727 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 15:48:09,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:09 WrapperNode [2018-09-15 15:48:09,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 15:48:09,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 15:48:09,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 15:48:09,768 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 15:48:09,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:09" (1/1) ... [2018-09-15 15:48:09,805 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:09" (1/1) ... [2018-09-15 15:48:09,877 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 15:48:09,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 15:48:09,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 15:48:09,878 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 15:48:10,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:09" (1/1) ... [2018-09-15 15:48:10,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:09" (1/1) ... [2018-09-15 15:48:10,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:09" (1/1) ... [2018-09-15 15:48:10,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:09" (1/1) ... [2018-09-15 15:48:10,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:09" (1/1) ... [2018-09-15 15:48:10,101 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:09" (1/1) ... [2018-09-15 15:48:10,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:09" (1/1) ... [2018-09-15 15:48:10,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 15:48:10,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 15:48:10,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 15:48:10,118 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 15:48:10,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:09" (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-15 15:48:10,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 15:48:10,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 15:48:10,197 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 15:48:10,197 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 15:48:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 15:48:10,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 15:48:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 15:48:10,198 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 15:48:13,397 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 15:48:13,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 03:48:13 BoogieIcfgContainer [2018-09-15 15:48:13,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 15:48:13,399 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 15:48:13,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 15:48:13,403 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 15:48:13,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 03:48:09" (1/3) ... [2018-09-15 15:48:13,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a68efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 03:48:13, skipping insertion in model container [2018-09-15 15:48:13,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:09" (2/3) ... [2018-09-15 15:48:13,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a68efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 03:48:13, skipping insertion in model container [2018-09-15 15:48:13,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 03:48:13" (3/3) ... [2018-09-15 15:48:13,406 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label04_true-unreach-call_false-termination.c [2018-09-15 15:48:13,417 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 15:48:13,425 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 15:48:13,479 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 15:48:13,479 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 15:48:13,480 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 15:48:13,480 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 15:48:13,480 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 15:48:13,480 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 15:48:13,480 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 15:48:13,481 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 15:48:13,481 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 15:48:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-09-15 15:48:13,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-15 15:48:13,520 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 15:48:13,521 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] [2018-09-15 15:48:13,523 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 15:48:13,528 INFO L82 PathProgramCache]: Analyzing trace with hash 576878093, now seen corresponding path program 1 times [2018-09-15 15:48:13,530 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 15:48:13,531 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 104 with the following transitions: [2018-09-15 15:48:13,534 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [761], [765], [771], [775], [782], [783], [784], [786] [2018-09-15 15:48:13,570 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 15:48:13,570 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 15:48:13,819 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 15:48:13,821 INFO L272 AbstractInterpreter]: Visited 102 different actions 102 times. Never merged. Never widened. Never found a fixpoint. Largest state had 41 variables. [2018-09-15 15:48:13,868 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 15:48:14,115 INFO L232 lantSequenceWeakener]: Weakened 100 states. On average, predicates are now at 80.19% of their original sizes. [2018-09-15 15:48:14,116 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 15:48:14,405 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 15:48:14,407 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 15:48:14,407 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 15:48:14,408 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 15:48:14,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 15:48:14,422 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 15:48:14,423 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-15 15:48:14,426 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 6 states. [2018-09-15 15:48:16,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 15:48:16,906 INFO L93 Difference]: Finished difference Result 552 states and 944 transitions. [2018-09-15 15:48:16,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 15:48:16,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-09-15 15:48:16,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 15:48:16,925 INFO L225 Difference]: With dead ends: 552 [2018-09-15 15:48:16,925 INFO L226 Difference]: Without dead ends: 342 [2018-09-15 15:48:16,932 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-15 15:48:16,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-09-15 15:48:16,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2018-09-15 15:48:16,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-09-15 15:48:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 473 transitions. [2018-09-15 15:48:17,003 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 473 transitions. Word has length 103 [2018-09-15 15:48:17,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 15:48:17,004 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 473 transitions. [2018-09-15 15:48:17,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 15:48:17,005 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 473 transitions. [2018-09-15 15:48:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-15 15:48:17,010 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 15:48:17,011 INFO L376 BasicCegarLoop]: trace histogram [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] [2018-09-15 15:48:17,011 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 15:48:17,012 INFO L82 PathProgramCache]: Analyzing trace with hash -570149942, now seen corresponding path program 1 times [2018-09-15 15:48:17,012 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 15:48:17,012 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2018-09-15 15:48:17,013 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-09-15 15:48:17,020 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 15:48:17,020 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 15:48:17,193 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 15:48:17,193 INFO L272 AbstractInterpreter]: Visited 106 different actions 206 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-09-15 15:48:17,223 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 15:48:17,449 INFO L232 lantSequenceWeakener]: Weakened 109 states. On average, predicates are now at 80.26% of their original sizes. [2018-09-15 15:48:17,449 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 15:48:17,625 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 15:48:17,625 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 15:48:17,625 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 15:48:17,626 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 15:48:17,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 15:48:17,627 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 15:48:17,627 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 15:48:17,628 INFO L87 Difference]: Start difference. First operand 340 states and 473 transitions. Second operand 9 states. [2018-09-15 15:48:20,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 15:48:20,817 INFO L93 Difference]: Finished difference Result 679 states and 1068 transitions. [2018-09-15 15:48:20,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-15 15:48:20,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2018-09-15 15:48:20,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 15:48:20,827 INFO L225 Difference]: With dead ends: 679 [2018-09-15 15:48:20,827 INFO L226 Difference]: Without dead ends: 481 [2018-09-15 15:48:20,831 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 117 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-09-15 15:48:20,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-09-15 15:48:20,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 478. [2018-09-15 15:48:20,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-09-15 15:48:20,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 625 transitions. [2018-09-15 15:48:20,869 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 625 transitions. Word has length 112 [2018-09-15 15:48:20,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 15:48:20,870 INFO L480 AbstractCegarLoop]: Abstraction has 478 states and 625 transitions. [2018-09-15 15:48:20,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 15:48:20,870 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 625 transitions. [2018-09-15 15:48:20,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-15 15:48:20,878 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 15:48:20,878 INFO L376 BasicCegarLoop]: trace histogram [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-15 15:48:20,880 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 15:48:20,880 INFO L82 PathProgramCache]: Analyzing trace with hash -41888134, now seen corresponding path program 1 times [2018-09-15 15:48:20,881 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 15:48:20,881 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2018-09-15 15:48:20,882 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-09-15 15:48:20,886 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 15:48:20,887 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 15:48:21,007 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 15:48:21,007 INFO L272 AbstractInterpreter]: Visited 106 different actions 205 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-09-15 15:48:21,047 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 15:48:21,187 INFO L232 lantSequenceWeakener]: Weakened 112 states. On average, predicates are now at 80.25% of their original sizes. [2018-09-15 15:48:21,187 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 15:48:21,836 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 15:48:21,836 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 15:48:21,836 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 15:48:21,837 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 15:48:21,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 15:48:21,837 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 15:48:21,838 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 15:48:21,838 INFO L87 Difference]: Start difference. First operand 478 states and 625 transitions. Second operand 9 states. [2018-09-15 15:48:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 15:48:25,835 INFO L93 Difference]: Finished difference Result 998 states and 1569 transitions. [2018-09-15 15:48:25,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-15 15:48:25,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2018-09-15 15:48:25,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 15:48:25,844 INFO L225 Difference]: With dead ends: 998 [2018-09-15 15:48:25,844 INFO L226 Difference]: Without dead ends: 800 [2018-09-15 15:48:25,847 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 121 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-15 15:48:25,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-09-15 15:48:25,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 793. [2018-09-15 15:48:25,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2018-09-15 15:48:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 959 transitions. [2018-09-15 15:48:25,892 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 959 transitions. Word has length 115 [2018-09-15 15:48:25,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 15:48:25,892 INFO L480 AbstractCegarLoop]: Abstraction has 793 states and 959 transitions. [2018-09-15 15:48:25,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 15:48:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 959 transitions. [2018-09-15 15:48:25,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-15 15:48:25,898 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 15:48:25,898 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 15:48:25,898 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 15:48:25,898 INFO L82 PathProgramCache]: Analyzing trace with hash 844561917, now seen corresponding path program 1 times [2018-09-15 15:48:25,899 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 15:48:25,899 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 125 with the following transitions: [2018-09-15 15:48:25,899 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-09-15 15:48:25,902 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 15:48:25,902 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 15:48:26,053 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 15:48:26,053 INFO L272 AbstractInterpreter]: Visited 107 different actions 418 times. Merged at 7 different actions 23 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 42 variables. [2018-09-15 15:48:26,092 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 15:48:26,245 INFO L232 lantSequenceWeakener]: Weakened 121 states. On average, predicates are now at 83.44% of their original sizes. [2018-09-15 15:48:26,245 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 15:48:26,718 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 15:48:26,718 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 15:48:26,718 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 15:48:26,718 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 15:48:26,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 15:48:26,719 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 15:48:26,719 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 15:48:26,720 INFO L87 Difference]: Start difference. First operand 793 states and 959 transitions. Second operand 9 states. [2018-09-15 15:48:30,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 15:48:30,676 INFO L93 Difference]: Finished difference Result 1596 states and 2099 transitions. [2018-09-15 15:48:30,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-15 15:48:30,676 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2018-09-15 15:48:30,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 15:48:30,684 INFO L225 Difference]: With dead ends: 1596 [2018-09-15 15:48:30,684 INFO L226 Difference]: Without dead ends: 1083 [2018-09-15 15:48:30,687 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 130 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-15 15:48:30,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-09-15 15:48:30,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1062. [2018-09-15 15:48:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2018-09-15 15:48:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1316 transitions. [2018-09-15 15:48:30,739 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1316 transitions. Word has length 124 [2018-09-15 15:48:30,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 15:48:30,739 INFO L480 AbstractCegarLoop]: Abstraction has 1062 states and 1316 transitions. [2018-09-15 15:48:30,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 15:48:30,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1316 transitions. [2018-09-15 15:48:30,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-15 15:48:30,746 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 15:48:30,746 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 15:48:30,746 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 15:48:30,747 INFO L82 PathProgramCache]: Analyzing trace with hash -822578322, now seen corresponding path program 1 times [2018-09-15 15:48:30,747 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 15:48:30,747 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 139 with the following transitions: [2018-09-15 15:48:30,748 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [25], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-09-15 15:48:30,750 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 15:48:30,751 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 15:48:31,013 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 15:48:31,013 INFO L272 AbstractInterpreter]: Visited 108 different actions 530 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 42 variables. [2018-09-15 15:48:31,018 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 15:48:31,299 INFO L232 lantSequenceWeakener]: Weakened 135 states. On average, predicates are now at 83.75% of their original sizes. [2018-09-15 15:48:31,299 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 15:48:31,409 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 15:48:31,409 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 15:48:31,410 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 15:48:31,410 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 15:48:31,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 15:48:31,411 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 15:48:31,411 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 15:48:31,411 INFO L87 Difference]: Start difference. First operand 1062 states and 1316 transitions. Second operand 9 states. [2018-09-15 15:48:33,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 15:48:33,989 INFO L93 Difference]: Finished difference Result 2149 states and 2801 transitions. [2018-09-15 15:48:33,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-15 15:48:33,990 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 138 [2018-09-15 15:48:33,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 15:48:33,998 INFO L225 Difference]: With dead ends: 2149 [2018-09-15 15:48:33,998 INFO L226 Difference]: Without dead ends: 1367 [2018-09-15 15:48:34,001 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 146 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-09-15 15:48:34,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-09-15 15:48:34,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1335. [2018-09-15 15:48:34,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1335 states. [2018-09-15 15:48:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1689 transitions. [2018-09-15 15:48:34,050 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1689 transitions. Word has length 138 [2018-09-15 15:48:34,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 15:48:34,051 INFO L480 AbstractCegarLoop]: Abstraction has 1335 states and 1689 transitions. [2018-09-15 15:48:34,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 15:48:34,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1689 transitions. [2018-09-15 15:48:34,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-15 15:48:34,055 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 15:48:34,056 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 15:48:34,056 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 15:48:34,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1666534429, now seen corresponding path program 1 times [2018-09-15 15:48:34,056 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 15:48:34,057 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 155 with the following transitions: [2018-09-15 15:48:34,057 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [25], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-09-15 15:48:34,059 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 15:48:34,059 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 15:48:34,358 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-15 15:48:34,359 INFO L272 AbstractInterpreter]: Visited 110 different actions 647 times. Merged at 9 different actions 47 times. Widened at 1 different actions 1 times. Found 12 fixpoints after 2 different actions. Largest state had 42 variables. [2018-09-15 15:48:34,403 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 15:48:34,447 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 15:48:34,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 03:48:34 BoogieIcfgContainer [2018-09-15 15:48:34,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 15:48:34,452 INFO L168 Benchmark]: Toolchain (without parser) took 25402.75 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -582.5 MB). Peak memory consumption was 475.5 MB. Max. memory is 7.1 GB. [2018-09-15 15:48:34,456 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-15 15:48:34,457 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.90 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-15 15:48:34,458 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.31 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-15 15:48:34,459 INFO L168 Benchmark]: Boogie Preprocessor took 239.94 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.8 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2018-09-15 15:48:34,462 INFO L168 Benchmark]: RCFGBuilder took 3280.72 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 125.2 MB). Peak memory consumption was 125.2 MB. Max. memory is 7.1 GB. [2018-09-15 15:48:34,464 INFO L168 Benchmark]: TraceAbstraction took 21052.05 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 329.3 MB). Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 56.9 MB). Peak memory consumption was 386.1 MB. Max. memory is 7.1 GB. [2018-09-15 15:48:34,472 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 712.90 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 109.31 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 239.94 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.8 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3280.72 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 125.2 MB). Peak memory consumption was 125.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21052.05 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 329.3 MB). Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 56.9 MB). Peak memory consumption was 386.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 464]: 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 d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND TRUE ((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8))) [L50] a8 = 13 [L51] a7 = 1 [L52] a16 = 4 [L53] RET return -1; [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND TRUE (((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)) [L32] a16 = 5 [L33] a20 = 0 [L34] RET return 24; [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] RET return 26; [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] RET return 26; [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L418] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L421] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L424] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L427] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L430] COND FALSE !((((((((a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L433] COND FALSE !((((((((a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==6))&&(a21==1))) [L436] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L439] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L442] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L445] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L448] COND FALSE !((((((((a17==1)&&(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L451] COND FALSE !((((((((a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==6))&&(a21==1))) [L454] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==15))&&(a12==8))&&(a16==6))&&(a21==1))) [L457] COND FALSE !((((((((a17==1)&&(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L460] COND FALSE !((((((((a17==1)&&(a7==1))&&(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L463] COND TRUE ((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1)) [L464] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. UNKNOWN Result, 20.9s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 16.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 899 SDtfs, 3449 SDslu, 1282 SDs, 0 SdLazy, 6339 SolverSat, 1065 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 617 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1335occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.5s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.9972336627130922 AbsIntWeakeningRatio, 0.2674616695059625 AbsIntAvgWeakeningVarsNumRemoved, 11.65076660988075 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 65 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/Problem01_label04_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_15-48-34-505.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label04_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_15-48-34-505.csv Received shutdown request...