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_INTCON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label56_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 11:39:56,209 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 11:39:56,214 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 11:39:56,227 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 11:39:56,228 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 11:39:56,229 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 11:39:56,231 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 11:39:56,233 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 11:39:56,235 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 11:39:56,237 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 11:39:56,241 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 11:39:56,241 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 11:39:56,242 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 11:39:56,243 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 11:39:56,247 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 11:39:56,248 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 11:39:56,249 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 11:39:56,253 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 11:39:56,262 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 11:39:56,266 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 11:39:56,268 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 11:39:56,272 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 11:39:56,277 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 11:39:56,277 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 11:39:56,277 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 11:39:56,281 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 11:39:56,282 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 11:39:56,284 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 11:39:56,285 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 11:39:56,286 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 11:39:56,286 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 11:39:56,290 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 11:39:56,290 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 11:39:56,290 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 11:39:56,291 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 11:39:56,292 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 11:39:56,294 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf [2018-09-19 11:39:56,321 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 11:39:56,322 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 11:39:56,323 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 11:39:56,324 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 11:39:56,324 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 11:39:56,324 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 11:39:56,324 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 11:39:56,325 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 11:39:56,325 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 11:39:56,325 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 11:39:56,325 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 11:39:56,325 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 11:39:56,326 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 11:39:56,328 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 11:39:56,328 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 11:39:56,328 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 11:39:56,328 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 11:39:56,328 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 11:39:56,329 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 11:39:56,329 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 11:39:56,329 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 11:39:56,331 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 11:39:56,331 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 11:39:56,331 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 11:39:56,331 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 11:39:56,332 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 11:39:56,332 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 11:39:56,332 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 11:39:56,332 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 11:39:56,332 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 11:39:56,333 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 11:39:56,333 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 11:39:56,333 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 11:39:56,333 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 11:39:56,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 11:39:56,424 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 11:39:56,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 11:39:56,432 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 11:39:56,433 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 11:39:56,434 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label56_true-unreach-call_false-termination.c [2018-09-19 11:39:56,836 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/876312141/157f77d19b6e48c6afd41e331a6ba157/FLAG538316187 [2018-09-19 11:39:57,099 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 11:39:57,100 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label56_true-unreach-call_false-termination.c [2018-09-19 11:39:57,131 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/876312141/157f77d19b6e48c6afd41e331a6ba157/FLAG538316187 [2018-09-19 11:39:57,168 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/876312141/157f77d19b6e48c6afd41e331a6ba157 [2018-09-19 11:39:57,183 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 11:39:57,186 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 11:39:57,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 11:39:57,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 11:39:57,197 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 11:39:57,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 11:39:57" (1/1) ... [2018-09-19 11:39:57,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66ef8fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:39:57, skipping insertion in model container [2018-09-19 11:39:57,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 11:39:57" (1/1) ... [2018-09-19 11:39:57,215 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 11:39:57,717 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 11:39:57,741 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 11:39:57,865 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 11:39:57,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:39:57 WrapperNode [2018-09-19 11:39:57,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 11:39:57,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 11:39:57,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 11:39:57,903 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 11:39:57,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:39:57" (1/1) ... [2018-09-19 11:39:57,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:39:57" (1/1) ... [2018-09-19 11:39:58,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 11:39:58,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 11:39:58,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 11:39:58,002 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 11:39:58,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:39:57" (1/1) ... [2018-09-19 11:39:58,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:39:57" (1/1) ... [2018-09-19 11:39:58,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:39:57" (1/1) ... [2018-09-19 11:39:58,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:39:57" (1/1) ... [2018-09-19 11:39:58,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:39:57" (1/1) ... [2018-09-19 11:39:58,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:39:57" (1/1) ... [2018-09-19 11:39:58,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:39:57" (1/1) ... [2018-09-19 11:39:58,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 11:39:58,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 11:39:58,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 11:39:58,240 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 11:39:58,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:39:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 11:39:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 11:39:58,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 11:39:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 11:39:58,321 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 11:39:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 11:39:58,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 11:39:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 11:39:58,321 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 11:40:01,796 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 11:40:01,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 11:40:01 BoogieIcfgContainer [2018-09-19 11:40:01,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 11:40:01,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 11:40:01,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 11:40:01,802 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 11:40:01,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 11:39:57" (1/3) ... [2018-09-19 11:40:01,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293f556b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 11:40:01, skipping insertion in model container [2018-09-19 11:40:01,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:39:57" (2/3) ... [2018-09-19 11:40:01,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293f556b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 11:40:01, skipping insertion in model container [2018-09-19 11:40:01,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 11:40:01" (3/3) ... [2018-09-19 11:40:01,806 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label56_true-unreach-call_false-termination.c [2018-09-19 11:40:01,818 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 11:40:01,831 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 11:40:01,910 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 11:40:01,911 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 11:40:01,911 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 11:40:01,912 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 11:40:01,912 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 11:40:01,912 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 11:40:01,914 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 11:40:01,914 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 11:40:01,914 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 11:40:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-09-19 11:40:01,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-19 11:40:01,983 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 11:40:01,984 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, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 11:40:01,986 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 11:40:01,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1901339872, now seen corresponding path program 1 times [2018-09-19 11:40:01,996 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 11:40:01,997 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2018-09-19 11:40:02,002 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], [659], [667], [675], [683], [691], [699], [707], [711], [713], [867], [871], [877], [881], [888], [889], [890], [892] [2018-09-19 11:40:02,086 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 11:40:02,087 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 11:40:02,765 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 11:40:02,767 INFO L272 AbstractInterpreter]: Visited 129 different actions 129 times. Never merged. Never widened. Never found a fixpoint. Largest state had 37 variables. [2018-09-19 11:40:02,824 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 11:40:03,370 INFO L232 lantSequenceWeakener]: Weakened 127 states. On average, predicates are now at 81.17% of their original sizes. [2018-09-19 11:40:03,371 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 11:40:04,148 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 11:40:04,150 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 11:40:04,151 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 11:40:04,151 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 11:40:04,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 11:40:04,165 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 11:40:04,166 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-09-19 11:40:04,169 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 10 states. [2018-09-19 11:40:06,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 11:40:06,919 INFO L93 Difference]: Finished difference Result 622 states and 1061 transitions. [2018-09-19 11:40:06,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-19 11:40:06,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 130 [2018-09-19 11:40:06,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 11:40:06,939 INFO L225 Difference]: With dead ends: 622 [2018-09-19 11:40:06,939 INFO L226 Difference]: Without dead ends: 383 [2018-09-19 11:40:06,946 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 133 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-09-19 11:40:06,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-09-19 11:40:07,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 380. [2018-09-19 11:40:07,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-09-19 11:40:07,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 531 transitions. [2018-09-19 11:40:07,021 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 531 transitions. Word has length 130 [2018-09-19 11:40:07,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 11:40:07,022 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 531 transitions. [2018-09-19 11:40:07,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 11:40:07,023 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 531 transitions. [2018-09-19 11:40:07,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-19 11:40:07,028 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 11:40:07,029 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, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 11:40:07,029 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 11:40:07,030 INFO L82 PathProgramCache]: Analyzing trace with hash 662934721, now seen corresponding path program 1 times [2018-09-19 11:40:07,030 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 11:40:07,030 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2018-09-19 11:40:07,031 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], [659], [667], [675], [683], [691], [699], [707], [711], [713], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-19 11:40:07,037 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 11:40:07,038 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 11:40:07,471 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 11:40:07,471 INFO L272 AbstractInterpreter]: Visited 133 different actions 260 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-09-19 11:40:07,508 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 11:40:07,901 INFO L232 lantSequenceWeakener]: Weakened 137 states. On average, predicates are now at 81.16% of their original sizes. [2018-09-19 11:40:07,901 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 11:40:08,713 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 11:40:08,719 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 11:40:08,719 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 11:40:08,719 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 11:40:08,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 11:40:08,723 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 11:40:08,723 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 11:40:08,724 INFO L87 Difference]: Start difference. First operand 380 states and 531 transitions. Second operand 10 states. [2018-09-19 11:40:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 11:40:12,823 INFO L93 Difference]: Finished difference Result 906 states and 1350 transitions. [2018-09-19 11:40:12,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 11:40:12,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2018-09-19 11:40:12,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 11:40:12,833 INFO L225 Difference]: With dead ends: 906 [2018-09-19 11:40:12,833 INFO L226 Difference]: Without dead ends: 532 [2018-09-19 11:40:12,843 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 147 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 11:40:12,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-09-19 11:40:12,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 526. [2018-09-19 11:40:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2018-09-19 11:40:12,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 699 transitions. [2018-09-19 11:40:12,885 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 699 transitions. Word has length 140 [2018-09-19 11:40:12,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 11:40:12,886 INFO L480 AbstractCegarLoop]: Abstraction has 526 states and 699 transitions. [2018-09-19 11:40:12,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 11:40:12,886 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 699 transitions. [2018-09-19 11:40:12,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-19 11:40:12,889 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 11:40:12,890 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, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 11:40:12,890 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 11:40:12,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1738232391, now seen corresponding path program 1 times [2018-09-19 11:40:12,891 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 11:40:12,891 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 145 with the following transitions: [2018-09-19 11:40:12,892 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], [659], [667], [675], [683], [691], [699], [707], [711], [713], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-19 11:40:12,897 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 11:40:12,897 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 11:40:13,219 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 11:40:13,219 INFO L272 AbstractInterpreter]: Visited 133 different actions 260 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-09-19 11:40:13,260 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 11:40:13,587 INFO L232 lantSequenceWeakener]: Weakened 141 states. On average, predicates are now at 81.15% of their original sizes. [2018-09-19 11:40:13,588 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 11:40:13,754 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 11:40:13,754 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 11:40:13,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 11:40:13,755 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 11:40:13,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 11:40:13,756 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 11:40:13,756 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 11:40:13,756 INFO L87 Difference]: Start difference. First operand 526 states and 699 transitions. Second operand 10 states. [2018-09-19 11:40:17,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 11:40:17,577 INFO L93 Difference]: Finished difference Result 1207 states and 1697 transitions. [2018-09-19 11:40:17,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 11:40:17,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 144 [2018-09-19 11:40:17,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 11:40:17,587 INFO L225 Difference]: With dead ends: 1207 [2018-09-19 11:40:17,587 INFO L226 Difference]: Without dead ends: 687 [2018-09-19 11:40:17,589 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 151 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 11:40:17,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-09-19 11:40:17,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 677. [2018-09-19 11:40:17,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2018-09-19 11:40:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 888 transitions. [2018-09-19 11:40:17,622 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 888 transitions. Word has length 144 [2018-09-19 11:40:17,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 11:40:17,623 INFO L480 AbstractCegarLoop]: Abstraction has 677 states and 888 transitions. [2018-09-19 11:40:17,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 11:40:17,623 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 888 transitions. [2018-09-19 11:40:17,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-09-19 11:40:17,629 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 11:40:17,630 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 11:40:17,630 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 11:40:17,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1972459924, now seen corresponding path program 1 times [2018-09-19 11:40:17,630 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 11:40:17,631 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2018-09-19 11:40:17,631 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [711], [713], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-19 11:40:17,642 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 11:40:17,643 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 11:40:17,988 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 11:40:17,988 INFO L272 AbstractInterpreter]: Visited 134 different actions 393 times. Merged at 7 different actions 13 times. Never widened. Found 3 fixpoints after 1 different actions. Largest state had 38 variables. [2018-09-19 11:40:18,027 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 11:40:18,299 INFO L232 lantSequenceWeakener]: Weakened 146 states. On average, predicates are now at 81.17% of their original sizes. [2018-09-19 11:40:18,299 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 11:40:18,490 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 11:40:18,490 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 11:40:18,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 11:40:18,490 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 11:40:18,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 11:40:18,491 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 11:40:18,491 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 11:40:18,492 INFO L87 Difference]: Start difference. First operand 677 states and 888 transitions. Second operand 10 states. [2018-09-19 11:40:22,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 11:40:22,656 INFO L93 Difference]: Finished difference Result 1742 states and 2412 transitions. [2018-09-19 11:40:22,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 11:40:22,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 149 [2018-09-19 11:40:22,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 11:40:22,664 INFO L225 Difference]: With dead ends: 1742 [2018-09-19 11:40:22,664 INFO L226 Difference]: Without dead ends: 1071 [2018-09-19 11:40:22,667 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 157 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-09-19 11:40:22,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2018-09-19 11:40:22,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1054. [2018-09-19 11:40:22,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2018-09-19 11:40:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1343 transitions. [2018-09-19 11:40:22,700 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1343 transitions. Word has length 149 [2018-09-19 11:40:22,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 11:40:22,701 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 1343 transitions. [2018-09-19 11:40:22,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 11:40:22,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1343 transitions. [2018-09-19 11:40:22,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-09-19 11:40:22,705 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 11:40:22,705 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, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 11:40:22,706 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 11:40:22,706 INFO L82 PathProgramCache]: Analyzing trace with hash -2096380923, now seen corresponding path program 1 times [2018-09-19 11:40:22,706 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 11:40:22,706 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-09-19 11:40:22,707 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], [659], [667], [675], [683], [691], [699], [707], [711], [713], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-19 11:40:22,710 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 11:40:22,710 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 11:40:23,321 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 11:40:23,322 INFO L272 AbstractInterpreter]: Visited 135 different actions 536 times. Merged at 8 different actions 29 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 38 variables. [2018-09-19 11:40:23,362 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 11:40:23,659 INFO L232 lantSequenceWeakener]: Weakened 160 states. On average, predicates are now at 81.15% of their original sizes. [2018-09-19 11:40:23,659 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 11:40:23,779 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 11:40:23,780 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 11:40:23,780 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 11:40:23,780 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 11:40:23,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 11:40:23,781 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 11:40:23,781 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 11:40:23,781 INFO L87 Difference]: Start difference. First operand 1054 states and 1343 transitions. Second operand 10 states. [2018-09-19 11:40:26,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 11:40:26,025 INFO L93 Difference]: Finished difference Result 2400 states and 3169 transitions. [2018-09-19 11:40:26,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 11:40:26,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 163 [2018-09-19 11:40:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 11:40:26,046 INFO L225 Difference]: With dead ends: 2400 [2018-09-19 11:40:26,046 INFO L226 Difference]: Without dead ends: 1352 [2018-09-19 11:40:26,049 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 171 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-09-19 11:40:26,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2018-09-19 11:40:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1326. [2018-09-19 11:40:26,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2018-09-19 11:40:26,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1676 transitions. [2018-09-19 11:40:26,106 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1676 transitions. Word has length 163 [2018-09-19 11:40:26,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 11:40:26,107 INFO L480 AbstractCegarLoop]: Abstraction has 1326 states and 1676 transitions. [2018-09-19 11:40:26,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 11:40:26,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1676 transitions. [2018-09-19 11:40:26,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-09-19 11:40:26,113 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 11:40:26,113 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, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 11:40:26,114 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 11:40:26,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1994030385, now seen corresponding path program 1 times [2018-09-19 11:40:26,114 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 11:40:26,115 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 168 with the following transitions: [2018-09-19 11:40:26,115 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], [659], [667], [675], [683], [691], [699], [707], [711], [713], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-19 11:40:26,118 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 11:40:26,118 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 11:40:26,476 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 11:40:26,476 INFO L272 AbstractInterpreter]: Visited 135 different actions 395 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-09-19 11:40:26,513 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 11:40:26,552 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 11:40:26,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 11:40:26 BoogieIcfgContainer [2018-09-19 11:40:26,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 11:40:26,553 INFO L168 Benchmark]: Toolchain (without parser) took 29369.52 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -425.2 MB). Peak memory consumption was 682.6 MB. Max. memory is 7.1 GB. [2018-09-19 11:40:26,555 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 11:40:26,556 INFO L168 Benchmark]: CACSL2BoogieTranslator took 714.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-19 11:40:26,556 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 11:40:26,557 INFO L168 Benchmark]: Boogie Preprocessor took 237.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -828.0 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2018-09-19 11:40:26,558 INFO L168 Benchmark]: RCFGBuilder took 3557.84 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: 120.5 MB). Peak memory consumption was 120.5 MB. Max. memory is 7.1 GB. [2018-09-19 11:40:26,559 INFO L168 Benchmark]: TraceAbstraction took 24754.31 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 355.5 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 250.5 MB). Peak memory consumption was 606.0 MB. Max. memory is 7.1 GB. [2018-09-19 11:40:26,564 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.22 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 714.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 98.70 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 237.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -828.0 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3557.84 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: 120.5 MB). Peak memory consumption was 120.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24754.31 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 355.5 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 250.5 MB). Peak memory consumption was 606.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 541]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L51] a28 = 11 [L52] a25 = 1 [L53] RET return 26; [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND TRUE ((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)) [L100] a17 = 7 [L101] a25 = 0 [L102] a11 = 1 [L103] a28 = 10 [L104] a19 = 0 [L105] RET return -1; [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L426] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L429] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) [L432] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) [L435] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L438] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L441] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==8))) [L444] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==11))&&!(a19==1))&&(a21==1))&&(a17==8))) [L447] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L450] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==7))) [L453] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) [L456] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==11))&&(a19==1))&&(a21==1))&&(a17==7))) [L459] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==7))) [L462] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==7))) [L465] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) [L468] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L471] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==8))) [L474] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==8))) [L477] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==7))) [L480] COND 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 FALSE !(((((((a25==1)&&!(a11==1))&&(a28==8))&&!(a19==1))&&(a21==1))&&(a17==7))) [L522] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) [L525] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==8))&&!(a19==1))&&(a21==1))&&(a17==7))) [L528] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==11))&&!(a19==1))&&(a21==1))&&(a17==7))) [L531] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==11))&&!(a19==1))&&(a21==1))&&(a17==7))) [L534] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==7))) [L537] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==11))&&(a19==1))&&(a21==1))&&(a17==7))) [L540] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==8)) [L541] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. UNKNOWN Result, 24.6s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 17.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1101 SDtfs, 3546 SDslu, 1641 SDs, 0 SdLazy, 7996 SolverSat, 1003 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.0s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 759 GetRequests, 681 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1326occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.1s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.9975881702282937 AbsIntWeakeningRatio, 0.20388349514563106 AbsIntAvgWeakeningVarsNumRemoved, 33.39528432732316 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 62 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label56_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_11-40-26-583.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label56_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_11-40-26-583.csv Received shutdown request...