java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label31_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 15:50:43,908 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 15:50:43,910 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 15:50:43,922 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 15:50:43,923 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 15:50:43,924 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 15:50:43,925 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 15:50:43,927 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 15:50:43,929 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 15:50:43,930 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 15:50:43,930 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 15:50:43,931 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 15:50:43,932 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 15:50:43,933 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 15:50:43,934 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 15:50:43,935 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 15:50:43,936 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 15:50:43,937 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 15:50:43,941 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 15:50:43,943 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 15:50:43,946 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 15:50:43,948 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 15:50:43,954 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 15:50:43,954 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 15:50:43,954 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 15:50:43,958 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 15:50:43,959 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 15:50:43,962 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 15:50:43,963 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 15:50:43,964 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 15:50:43,965 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 15:50:43,965 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 15:50:43,966 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 15:50:43,966 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 15:50:43,968 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 15:50:43,969 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 15:50:43,969 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:50:43,995 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 15:50:43,995 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 15:50:43,998 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 15:50:43,998 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 15:50:43,998 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 15:50:43,998 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 15:50:43,999 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 15:50:43,999 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-15 15:50:43,999 INFO L133 SettingsManager]: * Abstract domain=CongruenceDomain [2018-09-15 15:50:43,999 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 15:50:44,000 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 15:50:44,000 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 15:50:44,001 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 15:50:44,001 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 15:50:44,001 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 15:50:44,001 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 15:50:44,002 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 15:50:44,002 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 15:50:44,002 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 15:50:44,002 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 15:50:44,002 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 15:50:44,003 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 15:50:44,003 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 15:50:44,003 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 15:50:44,003 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 15:50:44,005 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 15:50:44,005 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 15:50:44,006 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 15:50:44,006 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 15:50:44,006 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 15:50:44,006 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 15:50:44,006 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 15:50:44,007 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 15:50:44,007 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 15:50:44,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 15:50:44,078 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 15:50:44,082 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 15:50:44,084 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 15:50:44,085 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 15:50:44,085 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label31_true-unreach-call_false-termination.c [2018-09-15 15:50:44,432 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28c35608d/ba7f576b62ec42c6b907d6e32753c13f/FLAG21adb327d [2018-09-15 15:50:44,667 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 15:50:44,668 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label31_true-unreach-call_false-termination.c [2018-09-15 15:50:44,684 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28c35608d/ba7f576b62ec42c6b907d6e32753c13f/FLAG21adb327d [2018-09-15 15:50:44,713 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28c35608d/ba7f576b62ec42c6b907d6e32753c13f [2018-09-15 15:50:44,728 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 15:50:44,734 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 15:50:44,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 15:50:44,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 15:50:44,746 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 15:50:44,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 03:50:44" (1/1) ... [2018-09-15 15:50:44,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e8699f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:50:44, skipping insertion in model container [2018-09-15 15:50:44,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 03:50:44" (1/1) ... [2018-09-15 15:50:44,764 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 15:50:45,297 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 15:50:45,315 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 15:50:45,444 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 15:50:45,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:50:45 WrapperNode [2018-09-15 15:50:45,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 15:50:45,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 15:50:45,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 15:50:45,486 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 15:50:45,497 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:50:45" (1/1) ... [2018-09-15 15:50:45,529 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:50:45" (1/1) ... [2018-09-15 15:50:45,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 15:50:45,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 15:50:45,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 15:50:45,603 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 15:50:45,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:50:45" (1/1) ... [2018-09-15 15:50:45,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:50:45" (1/1) ... [2018-09-15 15:50:45,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:50:45" (1/1) ... [2018-09-15 15:50:45,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:50:45" (1/1) ... [2018-09-15 15:50:45,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:50:45" (1/1) ... [2018-09-15 15:50:45,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:50:45" (1/1) ... [2018-09-15 15:50:45,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:50:45" (1/1) ... [2018-09-15 15:50:45,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 15:50:45,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 15:50:45,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 15:50:45,813 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 15:50:45,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:50:45" (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:50:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 15:50:45,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 15:50:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 15:50:45,883 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 15:50:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 15:50:45,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 15:50:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 15:50:45,884 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 15:50:49,088 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 15:50:49,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 03:50:49 BoogieIcfgContainer [2018-09-15 15:50:49,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 15:50:49,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 15:50:49,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 15:50:49,097 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 15:50:49,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 03:50:44" (1/3) ... [2018-09-15 15:50:49,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73879101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 03:50:49, skipping insertion in model container [2018-09-15 15:50:49,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:50:45" (2/3) ... [2018-09-15 15:50:49,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73879101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 03:50:49, skipping insertion in model container [2018-09-15 15:50:49,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 03:50:49" (3/3) ... [2018-09-15 15:50:49,103 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label31_true-unreach-call_false-termination.c [2018-09-15 15:50:49,114 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 15:50:49,126 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 15:50:49,190 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 15:50:49,191 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 15:50:49,191 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 15:50:49,192 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 15:50:49,192 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 15:50:49,192 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 15:50:49,192 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 15:50:49,192 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 15:50:49,192 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 15:50:49,220 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-09-15 15:50:49,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-15 15:50:49,234 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 15:50:49,236 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 15:50:49,237 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 15:50:49,242 INFO L82 PathProgramCache]: Analyzing trace with hash -639549745, now seen corresponding path program 1 times [2018-09-15 15:50:49,244 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 15:50:49,245 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2018-09-15 15:50:49,248 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [655], [657], [867], [871], [877], [881], [888], [889], [890], [892] [2018-09-15 15:50:49,285 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 15:50:49,285 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 15:50:49,548 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 15:50:49,550 INFO L272 AbstractInterpreter]: Visited 122 different actions 122 times. Never merged. Never widened. Never found a fixpoint. Largest state had 37 variables. [2018-09-15 15:50:49,576 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 15:50:49,804 INFO L232 lantSequenceWeakener]: Weakened 120 states. On average, predicates are now at 81.06% of their original sizes. [2018-09-15 15:50:49,804 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 15:50:50,070 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 15:50:50,072 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 15:50:50,072 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 15:50:50,072 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 15:50:50,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 15:50:50,093 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 15:50:50,094 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-15 15:50:50,097 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 6 states. [2018-09-15 15:50:53,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 15:50:53,136 INFO L93 Difference]: Finished difference Result 622 states and 1061 transitions. [2018-09-15 15:50:53,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-15 15:50:53,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2018-09-15 15:50:53,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 15:50:53,157 INFO L225 Difference]: With dead ends: 622 [2018-09-15 15:50:53,157 INFO L226 Difference]: Without dead ends: 383 [2018-09-15 15:50:53,164 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 123 GetRequests, 118 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:50:53,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-09-15 15:50:53,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 380. [2018-09-15 15:50:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-09-15 15:50:53,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 531 transitions. [2018-09-15 15:50:53,246 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 531 transitions. Word has length 123 [2018-09-15 15:50:53,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 15:50:53,248 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 531 transitions. [2018-09-15 15:50:53,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 15:50:53,249 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 531 transitions. [2018-09-15 15:50:53,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-09-15 15:50:53,255 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 15:50:53,255 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 15:50:53,256 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 15:50:53,256 INFO L82 PathProgramCache]: Analyzing trace with hash 830908494, now seen corresponding path program 1 times [2018-09-15 15:50:53,256 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 15:50:53,256 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2018-09-15 15:50:53,257 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [655], [657], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-15 15:50:53,262 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 15:50:53,262 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 15:50:53,406 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 15:50:53,406 INFO L272 AbstractInterpreter]: Visited 126 different actions 246 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-09-15 15:50:53,449 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 15:50:53,695 INFO L232 lantSequenceWeakener]: Weakened 130 states. On average, predicates are now at 81.1% of their original sizes. [2018-09-15 15:50:53,695 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 15:50:53,974 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 15:50:53,974 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 15:50:53,974 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 15:50:53,975 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 15:50:53,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 15:50:53,976 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 15:50:53,977 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 15:50:53,977 INFO L87 Difference]: Start difference. First operand 380 states and 531 transitions. Second operand 9 states. [2018-09-15 15:50:58,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 15:50:58,126 INFO L93 Difference]: Finished difference Result 905 states and 1347 transitions. [2018-09-15 15:50:58,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 15:50:58,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2018-09-15 15:50:58,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 15:50:58,138 INFO L225 Difference]: With dead ends: 905 [2018-09-15 15:50:58,138 INFO L226 Difference]: Without dead ends: 531 [2018-09-15 15:50:58,143 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 139 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-15 15:50:58,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-09-15 15:50:58,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 527. [2018-09-15 15:50:58,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-09-15 15:50:58,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 690 transitions. [2018-09-15 15:50:58,198 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 690 transitions. Word has length 133 [2018-09-15 15:50:58,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 15:50:58,199 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 690 transitions. [2018-09-15 15:50:58,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 15:50:58,199 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 690 transitions. [2018-09-15 15:50:58,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-15 15:50:58,204 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 15:50:58,205 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 15:50:58,205 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 15:50:58,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1861011882, now seen corresponding path program 1 times [2018-09-15 15:50:58,205 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 15:50:58,206 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 138 with the following transitions: [2018-09-15 15:50:58,206 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [655], [657], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-15 15:50:58,211 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 15:50:58,211 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 15:50:58,311 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 15:50:58,311 INFO L272 AbstractInterpreter]: Visited 126 different actions 246 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-09-15 15:50:58,352 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 15:50:58,506 INFO L232 lantSequenceWeakener]: Weakened 134 states. On average, predicates are now at 81.08% of their original sizes. [2018-09-15 15:50:58,507 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 15:50:58,952 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 15:50:58,952 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 15:50:58,953 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 15:50:58,953 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 15:50:58,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 15:50:58,954 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 15:50:58,954 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 15:50:58,954 INFO L87 Difference]: Start difference. First operand 527 states and 690 transitions. Second operand 9 states. [2018-09-15 15:51:01,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 15:51:01,933 INFO L93 Difference]: Finished difference Result 1199 states and 1665 transitions. [2018-09-15 15:51:01,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 15:51:01,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2018-09-15 15:51:01,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 15:51:01,940 INFO L225 Difference]: With dead ends: 1199 [2018-09-15 15:51:01,940 INFO L226 Difference]: Without dead ends: 678 [2018-09-15 15:51:01,942 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 143 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-15 15:51:01,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2018-09-15 15:51:01,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 674. [2018-09-15 15:51:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-09-15 15:51:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 849 transitions. [2018-09-15 15:51:01,973 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 849 transitions. Word has length 137 [2018-09-15 15:51:01,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 15:51:01,974 INFO L480 AbstractCegarLoop]: Abstraction has 674 states and 849 transitions. [2018-09-15 15:51:01,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 15:51:01,974 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 849 transitions. [2018-09-15 15:51:01,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-15 15:51:01,978 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 15:51:01,978 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 15:51:01,978 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 15:51:01,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1234791019, now seen corresponding path program 1 times [2018-09-15 15:51:01,979 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 15:51:01,979 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2018-09-15 15:51:01,980 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [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], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [655], [657], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-15 15:51:01,983 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 15:51:01,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 15:51:02,102 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 15:51:02,103 INFO L272 AbstractInterpreter]: Visited 127 different actions 498 times. Merged at 7 different actions 23 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 38 variables. [2018-09-15 15:51:02,140 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 15:51:02,279 INFO L232 lantSequenceWeakener]: Weakened 144 states. On average, predicates are now at 82.69% of their original sizes. [2018-09-15 15:51:02,281 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 15:51:02,898 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 15:51:02,899 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 15:51:02,899 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 15:51:02,899 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 15:51:02,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 15:51:02,900 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 15:51:02,900 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 15:51:02,905 INFO L87 Difference]: Start difference. First operand 674 states and 849 transitions. Second operand 9 states. [2018-09-15 15:51:06,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 15:51:06,121 INFO L93 Difference]: Finished difference Result 1505 states and 1999 transitions. [2018-09-15 15:51:06,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-15 15:51:06,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2018-09-15 15:51:06,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 15:51:06,128 INFO L225 Difference]: With dead ends: 1505 [2018-09-15 15:51:06,128 INFO L226 Difference]: Without dead ends: 837 [2018-09-15 15:51:06,130 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 153 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-15 15:51:06,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2018-09-15 15:51:06,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 828. [2018-09-15 15:51:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-09-15 15:51:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1043 transitions. [2018-09-15 15:51:06,158 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1043 transitions. Word has length 147 [2018-09-15 15:51:06,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 15:51:06,159 INFO L480 AbstractCegarLoop]: Abstraction has 828 states and 1043 transitions. [2018-09-15 15:51:06,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 15:51:06,159 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1043 transitions. [2018-09-15 15:51:06,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-15 15:51:06,163 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 15:51:06,163 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 15:51:06,164 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 15:51:06,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1361288292, now seen corresponding path program 1 times [2018-09-15 15:51:06,164 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 15:51:06,165 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2018-09-15 15:51:06,165 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], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [655], [657], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-15 15:51:06,168 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 15:51:06,169 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 15:51:06,366 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 15:51:06,367 INFO L272 AbstractInterpreter]: Visited 128 different actions 757 times. Merged at 8 different actions 44 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 1 different actions. Largest state had 38 variables. [2018-09-15 15:51:06,405 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 15:51:06,535 INFO L232 lantSequenceWeakener]: Weakened 153 states. On average, predicates are now at 84.94% of their original sizes. [2018-09-15 15:51:06,536 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 15:51:07,179 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 15:51:07,181 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 15:51:07,181 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 15:51:07,181 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 15:51:07,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 15:51:07,182 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 15:51:07,182 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 15:51:07,182 INFO L87 Difference]: Start difference. First operand 828 states and 1043 transitions. Second operand 9 states. [2018-09-15 15:51:09,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 15:51:09,827 INFO L93 Difference]: Finished difference Result 1885 states and 2519 transitions. [2018-09-15 15:51:09,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-15 15:51:09,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 156 [2018-09-15 15:51:09,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 15:51:09,835 INFO L225 Difference]: With dead ends: 1885 [2018-09-15 15:51:09,835 INFO L226 Difference]: Without dead ends: 1063 [2018-09-15 15:51:09,837 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 166 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2018-09-15 15:51:09,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2018-09-15 15:51:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1052. [2018-09-15 15:51:09,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2018-09-15 15:51:09,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1328 transitions. [2018-09-15 15:51:09,874 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1328 transitions. Word has length 156 [2018-09-15 15:51:09,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 15:51:09,875 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 1328 transitions. [2018-09-15 15:51:09,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 15:51:09,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1328 transitions. [2018-09-15 15:51:09,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-15 15:51:09,879 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 15:51:09,879 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 15:51:09,880 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 15:51:09,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1343446494, now seen corresponding path program 1 times [2018-09-15 15:51:09,880 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 15:51:09,880 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2018-09-15 15:51:09,881 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [655], [657], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-15 15:51:09,888 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 15:51:09,888 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 15:51:09,977 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 15:51:09,977 INFO L272 AbstractInterpreter]: Visited 127 different actions 373 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-09-15 15:51:10,017 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 15:51:10,172 INFO L232 lantSequenceWeakener]: Weakened 157 states. On average, predicates are now at 81.41% of their original sizes. [2018-09-15 15:51:10,172 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 15:51:10,501 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 15:51:10,501 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 15:51:10,501 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 15:51:10,501 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 15:51:10,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 15:51:10,502 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 15:51:10,502 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 15:51:10,503 INFO L87 Difference]: Start difference. First operand 1052 states and 1328 transitions. Second operand 10 states. [2018-09-15 15:51:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 15:51:13,502 INFO L93 Difference]: Finished difference Result 2628 states and 3535 transitions. [2018-09-15 15:51:13,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-15 15:51:13,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 160 [2018-09-15 15:51:13,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 15:51:13,512 INFO L225 Difference]: With dead ends: 2628 [2018-09-15 15:51:13,512 INFO L226 Difference]: Without dead ends: 1582 [2018-09-15 15:51:13,516 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 173 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2018-09-15 15:51:13,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-09-15 15:51:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1565. [2018-09-15 15:51:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2018-09-15 15:51:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 1963 transitions. [2018-09-15 15:51:13,605 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 1963 transitions. Word has length 160 [2018-09-15 15:51:13,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 15:51:13,606 INFO L480 AbstractCegarLoop]: Abstraction has 1565 states and 1963 transitions. [2018-09-15 15:51:13,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 15:51:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1963 transitions. [2018-09-15 15:51:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-15 15:51:13,611 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 15:51:13,611 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:13,612 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 15:51:13,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1207739595, now seen corresponding path program 1 times [2018-09-15 15:51:13,612 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 15:51:13,612 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 177 with the following transitions: [2018-09-15 15:51:13,613 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [99], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [655], [657], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-15 15:51:13,615 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 15:51:13,615 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 15:51:13,746 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 15:51:13,746 INFO L272 AbstractInterpreter]: Visited 128 different actions 632 times. Merged at 8 different actions 36 times. Never widened. Found 9 fixpoints after 2 different actions. Largest state had 38 variables. [2018-09-15 15:51:13,782 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 15:51:13,907 INFO L232 lantSequenceWeakener]: Weakened 173 states. On average, predicates are now at 86.77% of their original sizes. [2018-09-15 15:51:13,907 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 15:51:13,997 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 15:51:13,997 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 15:51:13,997 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 15:51:13,998 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 15:51:13,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 15:51:13,998 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 15:51:13,999 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 15:51:13,999 INFO L87 Difference]: Start difference. First operand 1565 states and 1963 transitions. Second operand 9 states. [2018-09-15 15:51:16,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 15:51:16,750 INFO L93 Difference]: Finished difference Result 3474 states and 4505 transitions. [2018-09-15 15:51:16,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-15 15:51:16,762 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 176 [2018-09-15 15:51:16,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 15:51:16,772 INFO L225 Difference]: With dead ends: 3474 [2018-09-15 15:51:16,772 INFO L226 Difference]: Without dead ends: 1915 [2018-09-15 15:51:16,778 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 185 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2018-09-15 15:51:16,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2018-09-15 15:51:16,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1874. [2018-09-15 15:51:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2018-09-15 15:51:16,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2394 transitions. [2018-09-15 15:51:16,845 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2394 transitions. Word has length 176 [2018-09-15 15:51:16,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 15:51:16,845 INFO L480 AbstractCegarLoop]: Abstraction has 1874 states and 2394 transitions. [2018-09-15 15:51:16,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 15:51:16,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2394 transitions. [2018-09-15 15:51:16,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-09-15 15:51:16,851 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 15:51:16,851 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:16,852 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 15:51:16,852 INFO L82 PathProgramCache]: Analyzing trace with hash -72052945, now seen corresponding path program 1 times [2018-09-15 15:51:16,852 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 15:51:16,852 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2018-09-15 15:51:16,853 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [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], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [655], [657], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-15 15:51:16,854 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 15:51:16,854 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 15:51:16,990 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 15:51:16,991 INFO L272 AbstractInterpreter]: Visited 128 different actions 632 times. Merged at 8 different actions 36 times. Never widened. Found 9 fixpoints after 2 different actions. Largest state had 38 variables. [2018-09-15 15:51:17,026 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 15:51:17,176 INFO L232 lantSequenceWeakener]: Weakened 180 states. On average, predicates are now at 84.58% of their original sizes. [2018-09-15 15:51:17,177 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 15:51:17,361 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 15:51:17,361 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 15:51:17,361 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 15:51:17,362 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 15:51:17,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 15:51:17,362 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 15:51:17,362 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 15:51:17,362 INFO L87 Difference]: Start difference. First operand 1874 states and 2394 transitions. Second operand 9 states. [2018-09-15 15:51:19,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 15:51:19,866 INFO L93 Difference]: Finished difference Result 4106 states and 5378 transitions. [2018-09-15 15:51:19,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-15 15:51:19,879 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 183 [2018-09-15 15:51:19,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 15:51:19,891 INFO L225 Difference]: With dead ends: 4106 [2018-09-15 15:51:19,891 INFO L226 Difference]: Without dead ends: 2238 [2018-09-15 15:51:19,895 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 192 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2018-09-15 15:51:19,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2018-09-15 15:51:19,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 2194. [2018-09-15 15:51:19,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2194 states. [2018-09-15 15:51:19,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 2194 states and 2847 transitions. [2018-09-15 15:51:19,970 INFO L78 Accepts]: Start accepts. Automaton has 2194 states and 2847 transitions. Word has length 183 [2018-09-15 15:51:19,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 15:51:19,971 INFO L480 AbstractCegarLoop]: Abstraction has 2194 states and 2847 transitions. [2018-09-15 15:51:19,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 15:51:19,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2194 states and 2847 transitions. [2018-09-15 15:51:19,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-09-15 15:51:19,979 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 15:51:19,980 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-09-15 15:51:19,980 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 15:51:19,980 INFO L82 PathProgramCache]: Analyzing trace with hash 665578969, now seen corresponding path program 1 times [2018-09-15 15:51:19,980 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 15:51:19,981 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-09-15 15:51:19,981 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [99], [100], [104], [107], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [655], [657], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-15 15:51:19,983 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 15:51:19,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 15:51:20,179 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-15 15:51:20,179 INFO L272 AbstractInterpreter]: Visited 130 different actions 769 times. Merged at 9 different actions 49 times. Widened at 1 different actions 1 times. Found 13 fixpoints after 2 different actions. Largest state had 38 variables. [2018-09-15 15:51:20,217 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 15:51:20,270 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 15:51:20,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 03:51:20 BoogieIcfgContainer [2018-09-15 15:51:20,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 15:51:20,272 INFO L168 Benchmark]: Toolchain (without parser) took 35543.47 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 72.5 MB. Max. memory is 7.1 GB. [2018-09-15 15:51:20,277 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-15 15:51:20,277 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.42 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-15 15:51:20,278 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.81 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:51:20,278 INFO L168 Benchmark]: Boogie Preprocessor took 209.66 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -841.7 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2018-09-15 15:51:20,279 INFO L168 Benchmark]: RCFGBuilder took 3279.29 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: 106.3 MB). Peak memory consumption was 106.3 MB. Max. memory is 7.1 GB. [2018-09-15 15:51:20,280 INFO L168 Benchmark]: TraceAbstraction took 31177.59 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 438.8 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -429.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2018-09-15 15:51:20,285 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 746.42 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 116.81 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 209.66 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -841.7 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3279.29 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: 106.3 MB). Peak memory consumption was 106.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31177.59 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 438.8 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -429.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 520]: 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 TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] RET return 22; [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 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 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 TRUE (!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11))) [L135] a28 = 7 [L136] a19 = 0 [L137] a11 = 1 [L138] 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, 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 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 TRUE ((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8)) [L144] a17 = 7 [L145] a11 = 1 [L146] a25 = 1 [L147] RET return -1; [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L426] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L429] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) [L432] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) [L435] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L438] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L441] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==8))) [L444] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==11))&&!(a19==1))&&(a21==1))&&(a17==8))) [L447] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L450] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==7))) [L453] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) [L456] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==11))&&(a19==1))&&(a21==1))&&(a17==7))) [L459] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==7))) [L462] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==7))) [L465] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) [L468] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L471] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==8))) [L474] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==8))) [L477] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==7))) [L480] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==11))&&!(a19==1))&&(a21==1))&&(a17==8))) [L483] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==8))&&!(a19==1))&&(a21==1))&&(a17==8))) [L486] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==8))) [L489] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==7))) [L492] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==11))&&(a19==1))&&(a21==1))&&(a17==8))) [L495] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==8))&&!(a19==1))&&(a21==1))&&(a17==7))) [L498] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==8))&&!(a19==1))&&(a21==1))&&(a17==7))) [L501] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==8))&&!(a19==1))&&(a21==1))&&(a17==8))) [L504] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L507] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L510] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==7))) [L513] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==7))) [L516] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L519] COND TRUE ((((((a25==1)&&!(a11==1))&&(a28==8))&&!(a19==1))&&(a21==1))&&(a17==7)) [L520] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. UNKNOWN Result, 31.0s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 24.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1684 SDtfs, 6063 SDslu, 2997 SDs, 0 SdLazy, 13992 SolverSat, 1926 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.4s Time, PredicateUnifierStatistics: 16 DeclaredPredicates, 1274 GetRequests, 1153 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2194occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.7s AbstIntTime, 9 AbstIntIterations, 8 AbstIntStrong, 0.9970394353458354 AbsIntWeakeningRatio, 0.21375310687655344 AbsIntAvgWeakeningVarsNumRemoved, 17.239436619718308 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 133 StatesRemovedByMinimization, 8 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_label31_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_15-51-20-301.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label31_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_15-51-20-301.csv Received shutdown request...