./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-regression/rule60_list2_true-termination.c_false-unreach-call_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ldv-regression/rule60_list2_true-termination.c_false-unreach-call_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f18f7f1f917468e24f0e5d26966f1156107884dd ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 15:47:25,917 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:47:25,924 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:47:25,942 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:47:25,943 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:47:25,944 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:47:25,945 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:47:25,947 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:47:25,949 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:47:25,950 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:47:25,950 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:47:25,951 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:47:25,952 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:47:25,953 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:47:25,955 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:47:25,956 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:47:25,957 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:47:25,959 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:47:25,961 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:47:25,963 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:47:25,964 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:47:25,965 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:47:25,968 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:47:25,968 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:47:25,969 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:47:25,970 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:47:25,971 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:47:25,972 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:47:25,973 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:47:25,974 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:47:25,974 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:47:25,976 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:47:25,976 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:47:25,976 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:47:25,977 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:47:25,978 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:47:25,978 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 15:47:25,994 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:47:25,994 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:47:25,996 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:47:25,996 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:47:25,996 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:47:25,997 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:47:25,997 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:47:25,997 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 15:47:25,997 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:47:25,998 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:47:25,998 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:47:25,998 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:47:25,998 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:47:25,998 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:47:25,998 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:47:25,999 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:47:25,999 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:47:25,999 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:47:25,999 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:47:25,999 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:47:25,999 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:47:26,001 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:47:26,002 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:47:26,002 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:47:26,002 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 15:47:26,002 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:47:26,002 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 15:47:26,002 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f18f7f1f917468e24f0e5d26966f1156107884dd [2019-01-14 15:47:26,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:47:26,056 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:47:26,061 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:47:26,063 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:47:26,065 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:47:26,067 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/rule60_list2_true-termination.c_false-unreach-call_1.i [2019-01-14 15:47:26,132 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/908cc888f/ab89c25ebc6c4e8e90eee558497797d0/FLAG46fef4807 [2019-01-14 15:47:26,667 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:47:26,668 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/rule60_list2_true-termination.c_false-unreach-call_1.i [2019-01-14 15:47:26,681 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/908cc888f/ab89c25ebc6c4e8e90eee558497797d0/FLAG46fef4807 [2019-01-14 15:47:26,955 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/908cc888f/ab89c25ebc6c4e8e90eee558497797d0 [2019-01-14 15:47:26,959 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:47:26,961 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:47:26,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:47:26,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:47:26,971 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:47:26,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:47:26" (1/1) ... [2019-01-14 15:47:26,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a569fe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:47:26, skipping insertion in model container [2019-01-14 15:47:26,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:47:26" (1/1) ... [2019-01-14 15:47:26,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:47:27,042 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:47:27,395 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:47:27,401 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:47:27,454 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:47:27,622 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:47:27,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:47:27 WrapperNode [2019-01-14 15:47:27,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:47:27,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:47:27,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:47:27,624 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:47:27,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:47:27" (1/1) ... [2019-01-14 15:47:27,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:47:27" (1/1) ... [2019-01-14 15:47:27,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:47:27,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:47:27,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:47:27,693 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:47:27,704 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:47:27" (1/1) ... [2019-01-14 15:47:27,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:47:27" (1/1) ... [2019-01-14 15:47:27,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:47:27" (1/1) ... [2019-01-14 15:47:27,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:47:27" (1/1) ... [2019-01-14 15:47:27,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:47:27" (1/1) ... [2019-01-14 15:47:27,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:47:27" (1/1) ... [2019-01-14 15:47:27,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:47:27" (1/1) ... [2019-01-14 15:47:27,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:47:27,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:47:27,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:47:27,726 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:47:27,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:47:27" (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 [2019-01-14 15:47:27,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 15:47:27,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 15:47:27,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:47:27,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:47:28,353 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:47:28,355 INFO L286 CfgBuilder]: Removed 34 assue(true) statements. [2019-01-14 15:47:28,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:47:28 BoogieIcfgContainer [2019-01-14 15:47:28,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:47:28,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:47:28,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:47:28,363 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:47:28,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:47:26" (1/3) ... [2019-01-14 15:47:28,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279649ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:47:28, skipping insertion in model container [2019-01-14 15:47:28,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:47:27" (2/3) ... [2019-01-14 15:47:28,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279649ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:47:28, skipping insertion in model container [2019-01-14 15:47:28,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:47:28" (3/3) ... [2019-01-14 15:47:28,369 INFO L112 eAbstractionObserver]: Analyzing ICFG rule60_list2_true-termination.c_false-unreach-call_1.i [2019-01-14 15:47:28,384 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:47:28,397 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-14 15:47:28,415 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-14 15:47:28,447 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:47:28,448 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:47:28,448 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:47:28,448 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:47:28,449 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:47:28,449 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:47:28,449 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:47:28,450 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:47:28,450 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:47:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2019-01-14 15:47:28,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-14 15:47:28,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:47:28,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-14 15:47:28,476 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:47:28,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:47:28,481 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-01-14 15:47:28,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:47:28,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:47:28,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:28,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:47:28,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:47:28,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:47:28,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:47:28,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:47:28,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:47:28,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:47:28,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:47:28,671 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2019-01-14 15:47:28,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:47:28,728 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-01-14 15:47:28,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:47:28,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-14 15:47:28,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:47:28,741 INFO L225 Difference]: With dead ends: 85 [2019-01-14 15:47:28,742 INFO L226 Difference]: Without dead ends: 36 [2019-01-14 15:47:28,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:47:28,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-14 15:47:28,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-14 15:47:28,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 15:47:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-01-14 15:47:28,785 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 4 [2019-01-14 15:47:28,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:47:28,786 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-01-14 15:47:28,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:47:28,786 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-01-14 15:47:28,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 15:47:28,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:47:28,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:47:28,787 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:47:28,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:47:28,789 INFO L82 PathProgramCache]: Analyzing trace with hash 170685048, now seen corresponding path program 1 times [2019-01-14 15:47:28,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:47:28,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:47:28,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:28,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:47:28,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:47:28,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:47:28,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:47:28,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 15:47:28,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 15:47:28,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 15:47:28,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:47:28,996 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 5 states. [2019-01-14 15:47:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:47:29,245 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-01-14 15:47:29,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 15:47:29,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-01-14 15:47:29,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:47:29,249 INFO L225 Difference]: With dead ends: 64 [2019-01-14 15:47:29,249 INFO L226 Difference]: Without dead ends: 38 [2019-01-14 15:47:29,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:47:29,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-14 15:47:29,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-01-14 15:47:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 15:47:29,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-01-14 15:47:29,263 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 15 [2019-01-14 15:47:29,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:47:29,264 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-01-14 15:47:29,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 15:47:29,264 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-01-14 15:47:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 15:47:29,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:47:29,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:47:29,265 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:47:29,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:47:29,265 INFO L82 PathProgramCache]: Analyzing trace with hash 227943350, now seen corresponding path program 1 times [2019-01-14 15:47:29,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:47:29,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:47:29,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:29,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:47:29,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:47:29,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:47:29,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:47:29,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 15:47:29,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:47:29,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:47:29,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:47:29,499 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 7 states. [2019-01-14 15:47:30,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:47:30,305 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-01-14 15:47:30,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 15:47:30,306 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-01-14 15:47:30,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:47:30,307 INFO L225 Difference]: With dead ends: 54 [2019-01-14 15:47:30,307 INFO L226 Difference]: Without dead ends: 52 [2019-01-14 15:47:30,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-14 15:47:30,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-14 15:47:30,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 34. [2019-01-14 15:47:30,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 15:47:30,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-01-14 15:47:30,315 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 15 [2019-01-14 15:47:30,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:47:30,316 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-01-14 15:47:30,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:47:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-01-14 15:47:30,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 15:47:30,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:47:30,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:47:30,319 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:47:30,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:47:30,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1186712674, now seen corresponding path program 1 times [2019-01-14 15:47:30,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:47:30,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:47:30,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:30,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:47:30,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:47:30,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:47:30,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:47:30,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 15:47:30,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 15:47:30,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 15:47:30,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:47:30,479 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2019-01-14 15:47:30,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:47:30,539 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2019-01-14 15:47:30,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 15:47:30,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-01-14 15:47:30,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:47:30,541 INFO L225 Difference]: With dead ends: 63 [2019-01-14 15:47:30,541 INFO L226 Difference]: Without dead ends: 34 [2019-01-14 15:47:30,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:47:30,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-14 15:47:30,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-14 15:47:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 15:47:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-01-14 15:47:30,548 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 19 [2019-01-14 15:47:30,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:47:30,549 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-01-14 15:47:30,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 15:47:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-01-14 15:47:30,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 15:47:30,550 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:47:30,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:47:30,551 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:47:30,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:47:30,551 INFO L82 PathProgramCache]: Analyzing trace with hash -93151004, now seen corresponding path program 1 times [2019-01-14 15:47:30,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:47:30,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:47:30,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:30,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:47:30,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:47:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:47:30,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:47:30,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-14 15:47:30,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 15:47:30,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 15:47:30,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-01-14 15:47:30,805 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 12 states. [2019-01-14 15:47:31,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:47:31,593 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-01-14 15:47:31,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 15:47:31,594 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-01-14 15:47:31,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:47:31,595 INFO L225 Difference]: With dead ends: 50 [2019-01-14 15:47:31,595 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 15:47:31,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-01-14 15:47:31,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 15:47:31,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-14 15:47:31,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 15:47:31,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-01-14 15:47:31,605 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2019-01-14 15:47:31,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:47:31,605 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-01-14 15:47:31,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 15:47:31,606 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-01-14 15:47:31,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 15:47:31,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:47:31,607 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:47:31,609 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:47:31,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:47:31,609 INFO L82 PathProgramCache]: Analyzing trace with hash -93091422, now seen corresponding path program 1 times [2019-01-14 15:47:31,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:47:31,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:47:31,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:31,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:47:31,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:47:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:47:31,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:47:31,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 15:47:31,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 15:47:31,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 15:47:31,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 15:47:31,907 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 8 states. [2019-01-14 15:47:32,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:47:32,198 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-01-14 15:47:32,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 15:47:32,199 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-01-14 15:47:32,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:47:32,200 INFO L225 Difference]: With dead ends: 54 [2019-01-14 15:47:32,201 INFO L226 Difference]: Without dead ends: 46 [2019-01-14 15:47:32,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-01-14 15:47:32,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-14 15:47:32,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2019-01-14 15:47:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 15:47:32,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-01-14 15:47:32,208 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 19 [2019-01-14 15:47:32,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:47:32,210 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-01-14 15:47:32,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 15:47:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-01-14 15:47:32,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 15:47:32,211 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:47:32,211 INFO L402 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] [2019-01-14 15:47:32,211 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:47:32,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:47:32,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1793070580, now seen corresponding path program 1 times [2019-01-14 15:47:32,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:47:32,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:47:32,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:32,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:47:32,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:47:32,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:47:32,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:47:32,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 15:47:32,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 15:47:32,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 15:47:32,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-14 15:47:32,392 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 10 states. [2019-01-14 15:47:32,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:47:32,733 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-01-14 15:47:32,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 15:47:32,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-01-14 15:47:32,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:47:32,736 INFO L225 Difference]: With dead ends: 56 [2019-01-14 15:47:32,736 INFO L226 Difference]: Without dead ends: 48 [2019-01-14 15:47:32,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-01-14 15:47:32,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-14 15:47:32,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-01-14 15:47:32,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 15:47:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-01-14 15:47:32,744 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 25 [2019-01-14 15:47:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:47:32,745 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-01-14 15:47:32,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 15:47:32,745 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-01-14 15:47:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 15:47:32,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:47:32,748 INFO L402 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] [2019-01-14 15:47:32,748 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:47:32,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:47:32,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1793130162, now seen corresponding path program 1 times [2019-01-14 15:47:32,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:47:32,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:47:32,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:32,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:47:32,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:47:32,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:47:32,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:47:32,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-14 15:47:32,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 15:47:32,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 15:47:32,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-01-14 15:47:32,925 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 14 states. [2019-01-14 15:47:33,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:47:33,493 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-01-14 15:47:33,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 15:47:33,495 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-01-14 15:47:33,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:47:33,496 INFO L225 Difference]: With dead ends: 55 [2019-01-14 15:47:33,496 INFO L226 Difference]: Without dead ends: 53 [2019-01-14 15:47:33,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2019-01-14 15:47:33,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-14 15:47:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2019-01-14 15:47:33,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-14 15:47:33,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-01-14 15:47:33,502 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 25 [2019-01-14 15:47:33,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:47:33,503 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-01-14 15:47:33,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 15:47:33,504 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-01-14 15:47:33,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 15:47:33,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:47:33,506 INFO L402 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] [2019-01-14 15:47:33,506 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:47:33,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:47:33,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1850388464, now seen corresponding path program 1 times [2019-01-14 15:47:33,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:47:33,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:47:33,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:33,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:47:33,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:47:33,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:47:33,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:47:33,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 15:47:33,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 15:47:33,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 15:47:33,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:47:33,736 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2019-01-14 15:47:33,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:47:33,820 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-01-14 15:47:33,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 15:47:33,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-01-14 15:47:33,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:47:33,823 INFO L225 Difference]: With dead ends: 46 [2019-01-14 15:47:33,823 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 15:47:33,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:47:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 15:47:33,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-14 15:47:33,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 15:47:33,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-01-14 15:47:33,831 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 25 [2019-01-14 15:47:33,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:47:33,831 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-01-14 15:47:33,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 15:47:33,832 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-01-14 15:47:33,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 15:47:33,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:47:33,834 INFO L402 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] [2019-01-14 15:47:33,834 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:47:33,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:47:33,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1400103152, now seen corresponding path program 1 times [2019-01-14 15:47:33,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:47:33,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:47:33,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:33,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:47:33,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:47:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:47:34,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:47:34,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-14 15:47:34,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 15:47:34,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 15:47:34,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-14 15:47:34,082 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 13 states. [2019-01-14 15:47:34,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:47:34,780 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-01-14 15:47:34,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 15:47:34,781 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-01-14 15:47:34,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:47:34,782 INFO L225 Difference]: With dead ends: 50 [2019-01-14 15:47:34,782 INFO L226 Difference]: Without dead ends: 48 [2019-01-14 15:47:34,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2019-01-14 15:47:34,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-14 15:47:34,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2019-01-14 15:47:34,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 15:47:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-01-14 15:47:34,787 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 25 [2019-01-14 15:47:34,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:47:34,787 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-01-14 15:47:34,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 15:47:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-01-14 15:47:34,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 15:47:34,788 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:47:34,789 INFO L402 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] [2019-01-14 15:47:34,791 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:47:34,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:47:34,792 INFO L82 PathProgramCache]: Analyzing trace with hash 758876958, now seen corresponding path program 1 times [2019-01-14 15:47:34,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:47:34,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:47:34,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:34,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:47:34,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:47:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:47:35,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:47:35,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 15:47:35,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 15:47:35,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 15:47:35,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-14 15:47:35,077 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2019-01-14 15:47:35,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:47:35,301 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-01-14 15:47:35,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 15:47:35,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-01-14 15:47:35,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:47:35,303 INFO L225 Difference]: With dead ends: 44 [2019-01-14 15:47:35,303 INFO L226 Difference]: Without dead ends: 34 [2019-01-14 15:47:35,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-01-14 15:47:35,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-14 15:47:35,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-01-14 15:47:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 15:47:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-14 15:47:35,309 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 29 [2019-01-14 15:47:35,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:47:35,310 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-14 15:47:35,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 15:47:35,310 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-14 15:47:35,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 15:47:35,310 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:47:35,311 INFO L402 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] [2019-01-14 15:47:35,311 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:47:35,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:47:35,311 INFO L82 PathProgramCache]: Analyzing trace with hash -50469668, now seen corresponding path program 1 times [2019-01-14 15:47:35,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:47:35,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:47:35,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:35,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:47:35,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:47:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:47:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:47:35,400 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 15:47:35,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:47:35 BoogieIcfgContainer [2019-01-14 15:47:35,463 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:47:35,464 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:47:35,464 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:47:35,464 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:47:35,465 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:47:28" (3/4) ... [2019-01-14 15:47:35,469 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 15:47:35,550 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:47:35,553 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:47:35,555 INFO L168 Benchmark]: Toolchain (without parser) took 8595.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.7 MB). Free memory was 951.3 MB in the beginning and 950.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 188.9 MB. Max. memory is 11.5 GB. [2019-01-14 15:47:35,556 INFO L168 Benchmark]: CDTParser took 1.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:47:35,557 INFO L168 Benchmark]: CACSL2BoogieTranslator took 660.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -156.6 MB). Peak memory consumption was 42.1 MB. Max. memory is 11.5 GB. [2019-01-14 15:47:35,557 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:47:35,559 INFO L168 Benchmark]: Boogie Preprocessor took 32.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:47:35,559 INFO L168 Benchmark]: RCFGBuilder took 631.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:47:35,561 INFO L168 Benchmark]: TraceAbstraction took 7105.38 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 958.2 MB in the end (delta: 117.1 MB). Peak memory consumption was 191.0 MB. Max. memory is 11.5 GB. [2019-01-14 15:47:35,561 INFO L168 Benchmark]: Witness Printer took 90.08 ms. Allocated memory is still 1.2 GB. Free memory was 958.2 MB in the beginning and 950.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2019-01-14 15:47:35,566 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 660.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -156.6 MB). Peak memory consumption was 42.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 631.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7105.38 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 958.2 MB in the end (delta: 117.1 MB). Peak memory consumption was 191.0 MB. Max. memory is 11.5 GB. * Witness Printer took 90.08 ms. Allocated memory is still 1.2 GB. Free memory was 958.2 MB in the beginning and 950.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L867] void * guard_malloc_counter = 0; [L887] struct list_head *elem = ((void *)0); [L900] static struct list_head head; VAL [elem={0:0}, guard_malloc_counter={0:0}, head={1:0}] [L903] struct list_head *dev1, *dev2; [L871] (size > 0) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:0}, head={1:0}] [L872] guard_malloc_counter++ [L873] COND FALSE !(!__VERIFIER_nondet_int()) [L875] return (void *) guard_malloc_counter; VAL [elem={0:0}, guard_malloc_counter={0:1}, head={1:0}] [L879] return __getMemory(size); [L904] dev1 = my_malloc(sizeof(*dev1)) [L871] (size > 0) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:1}, head={1:0}] [L872] guard_malloc_counter++ [L873] COND FALSE !(!__VERIFIER_nondet_int()) [L875] return (void *) guard_malloc_counter; VAL [elem={0:0}, guard_malloc_counter={0:2}, head={1:0}] [L879] return __getMemory(size); [L905] dev2 = my_malloc(sizeof(*dev2)) [L906] COND TRUE dev1!=((void *)0) && dev2!=((void *)0) [L890] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:2}, head={1:0}] [L891] COND TRUE __VERIFIER_nondet_int() [L892] elem = new VAL [elem={0:2}, guard_malloc_counter={0:2}, head={1:0}] [L890] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:2}, guard_malloc_counter={0:2}, head={1:0}] [L891] COND TRUE __VERIFIER_nondet_int() [L892] elem = new VAL [elem={0:1}, guard_malloc_counter={0:2}, head={1:0}] [L896] COND FALSE !(entry==elem) VAL [elem={0:1}, guard_malloc_counter={0:2}, head={1:0}] [L890] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:1}, guard_malloc_counter={0:2}, head={1:0}] [L891] COND FALSE !(__VERIFIER_nondet_int()) [L890] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:1}, guard_malloc_counter={0:2}, head={1:0}] [L6] __VERIFIER_error() VAL [elem={0:1}, guard_malloc_counter={0:2}, head={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 6 error locations. UNSAFE Result, 7.0s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 316 SDtfs, 1037 SDslu, 725 SDs, 0 SdLazy, 1052 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 55 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 19201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...